|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| [[File:Toffoli gate.svg|150px|thumb|Circuit representation of Toffoli gate]]
| | These are troubling economic times for many businesses. However, there are certain equipment upgrades that are necessary even when money is tight. If your company is looking to save money by shopping around for the best deal when replacing work surfaces like solid epoxy resin countertops, the following is an affordable solution.<br><br>Affordable Solutions for Solid Epoxy Resin Countertops<br><br>During a recession, one of the easiest ways to make cost-effective improvements to your facility is to invest in replacement countertops, as opposed to buying a whole new table or workbench, for example.<br><br>If you loved this information and you want to receive more details regarding [http://wardd3.soup.io/post/430694889/Reciclaje-Practico-De-La-Fibra-De-Vidrio resinas epoxi] please visit our own web-site. OnePointe Solutions supplies high-quality, epoxy resin replacement countertops and new custom epoxy resin worktables with exceptional work surfaces. And if customization is what you need, we can handle that for you too. By constructing solid epoxy resin tops and workbenches to your exact specifications, you save valuable time and money.<br><br>Why Solid Epoxy Resin Tops/Countertops are a Superior Investment<br><br>To understand fully why epoxy resin tabletops are such a sound investment, lets look at a number of features of solid epoxy resin work surfaces:<br><br>They are strong resistance too many chemicals, Water Resistant, Extremely hard material, Durable and easy to clean, Approved for Food Services (NSF), Non Porous, Never Requires Sealing, Made in the USA.<br><br>In addition, solid epoxy resin countertops are stain resistant, moisture resistant and resist chipping and scratching.<br><br>For all of these reasons, solid epoxy resin countertops last for a long time, making them a sound investment in any economy. |
| | |
| In [[computer science]], the '''Toffoli gate''' (also '''CCNOT gate'''), invented by [[Tommaso Toffoli]], is a universal [[Reversible computing|reversible]] [[logic gate]], which means that any reversible circuit can be constructed from Toffoli gates. It is also known as the "controlled-controlled-not" gate, which describes its action. It has 3-bit inputs and outputs; if the first two bits are set, it inverts the third bit, otherwise all bits stay the same.
| |
| | |
| == Background ==
| |
| | |
| A [[logic gate]] ''L'' is reversible if, for any output ''y'', there is a unique input ''x'' such that applying ''L''(''x'') = ''y''. If a gate ''L'' is reversible, there is an inverse gate ''L''′ which maps ''y'' to ''x'' for which ''L''′(''y'') = ''x''. From common logic gates, NOT is reversible, as can be seen from its truthtable below.
| |
| {| class="wikitable"
| |
| ! INPUT !! OUTPUT
| |
| |- align=center
| |
| | 0
| |
| | 1
| |
| |- align=center
| |
| | 1
| |
| | 0
| |
| |}
| |
| | |
| The common AND gate is not reversible however. The inputs 00, 01 and 10 are all mapped to the output 0.
| |
| | |
| Reversible gates have been studied since the 1960s. The original motivation was that reversible gates dissipate less heat (or, in principle, no heat). In a normal gate, input states are lost, since less information is present in the output than was present at the input. This loss of information loses energy to the surrounding area as heat, because of [[thermodynamic entropy]]. Another way to understand this is that charges on a circuit are grounded and thus flow away, taking a small quantity of energy with them when they change state. A reversible gate only moves the states around, and since no information is lost, energy is conserved.
| |
| | |
| More recent motivation comes from [[quantum computing]]. [[Quantum mechanics]] requires the transformations to be reversible but allows more general states of the computation ([[Superposition principle|superposition]]s). Thus, the reversible gates form a subset of gates allowed by quantum mechanics and, if we can compute something reversibly, we can also compute it on a quantum computer.
| |
| | |
| ==Universality and Toffoli gate==
| |
| | |
| Any reversible gate must have the same number of input and output bits, by the [[pigeonhole principle]]. For one input bit, there are two possible [[Reversible computing|reversible]] gates. One of them is NOT. The other is the identity gate which maps its input to the output unchanged. For two input bits, the only non-trivial gate is the [[controlled NOT gate]] which XORs the first bit to the second bit and leaves the first bit unchanged.
| |
| | |
| {|
| |
| ! Truth table !! Permutation matrix form
| |
| |-
| |
| |
| |
| {| class="wikitable"
| |
| ! colspan="2" | INPUT
| |
| ! colspan="2" | OUTPUT
| |
| |- align="center"
| |
| | 0 || 0 || 0 || 0
| |
| |- align="center"
| |
| | 0 || 1 || 0 || 1
| |
| |- align="center"
| |
| | 1 || 0 || 1 || 1
| |
| |- align="center"
| |
| | 1 || 1 || 1 || 0
| |
| |}
| |
| |
| |
| <math> | |
| \begin{bmatrix}
| |
| 1 & 0 & 0 & 0 \\
| |
| 0 & 1 & 0 & 0 \\
| |
| 0 & 0 & 0 & 1 \\
| |
| 0 & 0 & 1 & 0 \\
| |
| \end{bmatrix}
| |
| </math> | |
| |}
| |
| | |
| Unfortunately, there are reversible functions that cannot be computed using just those gates. In other words, the set consisting of NOT and XOR gates is not [[functional completeness|universal]]. If we want to compute an arbitrary function using reversible gates, we need another gate. One possibility is the '''Toffoli gate''', proposed in 1980 by Toffoli.<ref>Technical Report MIT/LCS/TM-151 (1980) and an adapted and condensed version: {{cite conference
| |
| | url = http://pm1.bu.edu/~tt/publ/revcomp-rep.pdf
| |
| | title = Reversible computing
| |
| | first = Tommaso
| |
| | last = Toffoli
| |
| | authorlink = Tommaso Toffoli
| |
| | year = 1980
| |
| | conference = Automata, Languages and Programming, Seventh Colloquium
| |
| | editor = J. W. de Bakker and [[Jan van Leeuwen|J. van Leeuwen]]
| |
| | publisher = Springer Verlag
| |
| | location = Noordwijkerhout, Netherlands
| |
| | pages = 632-644
| |
| | doi = 10.1007/3-540-10003-2_104
| |
| | isbn = 3-540-10003-2}}</ref>
| |
| | |
| This gate has 3-bit inputs and outputs. If the first two bits are set, it flips the third bit. The following is a table of the input and output bits:
| |
| | |
| {|
| |
| ! Truth table !! Permutation matrix form
| |
| |-
| |
| |
| |
| {| class="wikitable"
| |
| ! colspan="3" | INPUT
| |
| ! colspan="3" | OUTPUT
| |
| |- align="center"
| |
| | 0 || 0 || 0 || 0 || 0 || 0
| |
| |- align="center"
| |
| | 0 || 0 || 1 || 0 || 0 || 1
| |
| |- align="center"
| |
| | 0 || 1 || 0 || 0 || 1 || 0
| |
| |- align="center"
| |
| | 0 || 1 || 1 || 0 || 1 || 1
| |
| |- align="center"
| |
| | 1 || 0 || 0 || 1 || 0 || 0
| |
| |- align="center"
| |
| | 1 || 0 || 1 || 1 || 0 || 1
| |
| |- align="center"
| |
| | 1 || 1 || 0 || 1 || 1 || 1
| |
| |- align="center"
| |
| | 1 || 1 || 1 || 1 || 1 || 0
| |
| |}
| |
| |
| |
| <math>
| |
| \begin{bmatrix}
| |
| 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\
| |
| 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\
| |
| 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\
| |
| 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 \\
| |
| 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\
| |
| 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\
| |
| 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\
| |
| 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\
| |
| \end{bmatrix}
| |
| </math>
| |
| |}
| |
| It can be also described as mapping bits a, b and c to a, b and c XOR (a AND b).
| |
| | |
| The Toffoli gate is universal; this means that for any [[Boolean function]] ''f''(''x''<sub>1</sub>, ''x''<sub>2</sub>, ..., ''x''<sub>''m''</sub>), there is a circuit consisting of Toffoli gates which takes ''x''<sub>1</sub>, ''x''<sub>2</sub>, ..., ''x''<sub>''m''</sub> and some extra bits set to 0 or 1 and outputs ''x''<sub>1</sub>, ''x''<sub>2</sub>, ..., ''x''<sub>''m''</sub>, ''f''(''x''<sub>1</sub>, ''x''<sub>2</sub>, ..., ''x''<sub>''m''</sub>), and some extra bits (called garbage). Essentially, this means that one can use Toffoli gates to build systems that will perform any desired Boolean function computation in a reversible manner.
| |
| | |
| == Related logic gates ==
| |
| [[File:Toffoli BilliardBall.gif|thumb|250px|Fredkin & Toffoli billiard ball model for gates]]
| |
| * The [[Fredkin gate]] is a reversible 3-bit gate that swaps the last two bits if the first bit is 1; a controlled-swap operation.
| |
| | |
| * The ''n''-bit Toffoli gate is a generalization of Toffoli gate. It takes ''n'' bits ''x''<sub>1</sub>, ''x''<sub>2</sub>, ..., ''x''<sub>''n''</sub> as inputs and outputs ''n'' bits. The first ''n''−1 output bits are just ''x''<sub>1</sub>, ..., ''x''<sub>''n''−1</sub>. The last output bit is (''x''<sub>1</sub> AND ... AND ''x''<sub>''n''−1</sub>) XOR ''x''<sub>''n''</sub>.
| |
| * The Toffoli gate can be realized by five two-[[qubit]] [[quantum gate]]s.<ref>{{cite journal
| |
| | last1 = Barenco
| |
| | first1 = Adriano
| |
| | last2 = Bennett
| |
| | first2 = Charles H.
| |
| | last3 = Cleve
| |
| | first3 = Richard
| |
| | last4 = DiVincenzo
| |
| | first4 = David P.
| |
| | last5 = Margolus
| |
| | first5 = Norman
| |
| | last6 = Shor
| |
| | first6 = Peter
| |
| | authorlink6 = Peter Shor
| |
| | last7 = Sleator
| |
| | first7 = Tycho
| |
| | last8 = Smolin
| |
| | first8 = John A.
| |
| | last9 = Weinfurter
| |
| | first9 = Harald
| |
| | displayauthors=9
| |
| |date=Nov 1995
| |
| | title = Elementary gates for quantum computation
| |
| | journal = Phys. Rev. A
| |
| | volume = 52
| |
| | issue = 5
| |
| | pages = 3457–3467
| |
| | publisher = American Physical Society
| |
| | doi = 10.1103/PhysRevA.52.3457
| |
| | arxiv = quant-ph/9503016
| |
| | pmid=9912645|bibcode = 1995PhRvA..52.3457B}}</ref>
| |
| | |
| * This gate is one of the reversible-gate cases that can be modeled with [[billiard ball]]s (see [[Billiard-ball computer]]). The billiard ball modeling was introduced by Fredkin and Toffoli.<ref>{{cite journal
| |
| | last1 = Fredkin
| |
| | first1 = Edward
| |
| | authorlink1 = Edward Fredkin
| |
| | last2 = Toffoli
| |
| | first2 = Tommaso
| |
| | authorlink2 = Tommaso Toffoli
| |
| |date=April 1982
| |
| | title = Conservative logic
| |
| | journal = International Journal of Theoretical Physics
| |
| | volume = 21
| |
| | issue = 3
| |
| | pages = 219–253
| |
| | publisher = Springer Netherlands
| |
| | issn = 0020-7748
| |
| | doi = 10.1007/BF01857727
| |
| | url = http://64.78.31.152/wp-content/uploads/2012/08/ConservativeLogic.pdf |bibcode = 1982IJTP...21..219F }}</ref> An example of how the collisions are used to model an electronic gate is shown in the figure.
| |
| | |
| ==Relation to quantum computing==
| |
| | |
| Any reversible gate can be implemented on a [[quantum computer]], and hence the Toffoli gate is also a quantum operator. However, the Toffoli gate can not be used for universal quantum computation, though it does mean that a quantum computer can implement all possible classical computations. The Toffoli gate has to be implemented along with single qubit gates to be used for universal quantum computation. The Toffoli gate has been successfully realized in January 2009 at the University of Innsbruck, Austria.<ref>{{cite journal
| |
| | last1 = Monz
| |
| | first1 = T.
| |
| | last2 = Kim
| |
| | first2 = K.
| |
| | last3 = Hänsel
| |
| | first3 = W.
| |
| | last4 = Riebe
| |
| | first4 = M.
| |
| | last5 = Villar
| |
| | first5 = A. S.
| |
| | last6 = Schindler
| |
| | first6 = P.
| |
| | last7 = Chwalla
| |
| | first7 = M.
| |
| | last8 = Hennrich
| |
| | first8 = M.
| |
| | last9 = Blatt
| |
| | first9 = R.
| |
| | displayauthors=9
| |
| |date=Jan 2009
| |
| | title = Realization of the Quantum Toffoli Gate with Trapped Ions
| |
| | journal = R.
| |
| | volume = 102
| |
| | issue = 4
| |
| | pages = 040501
| |
| | publisher = American Physical Society
| |
| | doi = 10.1103/PhysRevLett.102.040501
| |
| | arxiv = 0804.0082
| |
| | bibcode=2009PhRvL.102d0501M}}</ref>
| |
| | |
| == See also ==
| |
| * [[Fredkin gate]]
| |
| * [[Reversible computing]]
| |
| * [[Quantum computing]]
| |
| * [[Quantum gate]]
| |
| * [[Quantum programming]]
| |
| | |
| ==References==
| |
| <references/>
| |
| | |
| {{DEFAULTSORT:Toffoli Gate}}
| |
| [[Category:Logic gates]]
| |
| [[Category:Quantum gates]]
| |
These are troubling economic times for many businesses. However, there are certain equipment upgrades that are necessary even when money is tight. If your company is looking to save money by shopping around for the best deal when replacing work surfaces like solid epoxy resin countertops, the following is an affordable solution.
Affordable Solutions for Solid Epoxy Resin Countertops
During a recession, one of the easiest ways to make cost-effective improvements to your facility is to invest in replacement countertops, as opposed to buying a whole new table or workbench, for example.
If you loved this information and you want to receive more details regarding resinas epoxi please visit our own web-site. OnePointe Solutions supplies high-quality, epoxy resin replacement countertops and new custom epoxy resin worktables with exceptional work surfaces. And if customization is what you need, we can handle that for you too. By constructing solid epoxy resin tops and workbenches to your exact specifications, you save valuable time and money.
Why Solid Epoxy Resin Tops/Countertops are a Superior Investment
To understand fully why epoxy resin tabletops are such a sound investment, lets look at a number of features of solid epoxy resin work surfaces:
They are strong resistance too many chemicals, Water Resistant, Extremely hard material, Durable and easy to clean, Approved for Food Services (NSF), Non Porous, Never Requires Sealing, Made in the USA.
In addition, solid epoxy resin countertops are stain resistant, moisture resistant and resist chipping and scratching.
For all of these reasons, solid epoxy resin countertops last for a long time, making them a sound investment in any economy.