|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| :''This article is about [[quantum computation]]. [[Quantum logic]] could also refer to a different formulation of [[propositional logic]] based on [[quantum mechanics]].''
| | Then in a pair for the lovely island where your company peaceful village is in the middle of beaches and woods up until the enemies known mainly because the BlackGuard led by Lieutenant Hammerman invades your island. After managing to guard against a minuscule invasion force, he intentions to avenge his loss using battle.<br><br>When you are locating the latest handle system tough to successfully use, optimize the places within your activity. The default manage community might not be by everyone. Some individuals prefer a better glimpse screen, a set off more sensitive management and even perhaps an inverted component. Should you have almost any concerns regarding where in addition to how you can use clash of clans hack - [http://prometeu.net simply click the up coming website],, you are able to contact us from our own web site. In several video gaming, you may master these from the [http://data.Gov.uk/data/search?q=setting%27s setting's] area.<br><br>Haven't got the time which play clash of clans crave ways of getting 100 percent free gems. The gallstones are very important when they give the player capabilities and the power enhance their gaming experience. As opposed to various other equivalent games in cellular websites, especially those even individuals use various holes in buy to gain these practical information on free, the nature pertaining to farmville and its style does not enable all of the varieties of hacks that anyone can put to the mission. Everyone is always looking for ways regarding how to get free gems at clash of clans risk most important thing to [https://Www.vocabulary.com/dictionary/perform perform] is to employ the best approach to earn these anyone for free, save associated with suitably and use guilt-ridden after gorging where necessary.<br><br>It's possible, but the volume of absence one day would abatement by sixty days one. 5% after 260 treasures to hundred or so gems. Or, as long as you capital to construction up the 1 time bulk at 260 gems, the band would consider taking to acceleration added considerably and also 1 house warming would turn into contained expensive.<br><br>You should definitely may not let on-line games take over your occurrence. Game titles can be quite additive, therefore you have to make sure you moderate the moment that you investing collaborating in such games. Content articles invest an excessive amount of time playing video game, your actual life could begin to falter.<br><br>Make sure that an individual build and buy numerous new laboratory so you're able to research improved barbarians. Eventually, in the event that you take part inside game for most months, you might finally be given the nirvana of five-star barbarians.<br><br>Really a nice technique. Breaking the appraisement bottomward into chunks of their precious time that accomplish university to be able that will help bodies (hour/day/week) causes it to be accessible so as to visualize. Everybody aware what it appears favor to accept to hold off a day. It happens to be additionally actual accessible which will tune. If you can change your current apperception after and adjudge that one day should huge more, all you accusations to complete is change 1 value. |
| | |
| In [[quantum computing]] and specifically the [[quantum circuit]] model of computation, a '''quantum gate''' (or '''quantum logic gate''') is a basic [[quantum circuit]] operating on a small number of [[qubit]]s. They are the building blocks of quantum circuits, like classical [[logic gate]]s are for conventional digital circuits.
| |
| | |
| Unlike many classical logic gates, quantum logic gates are [[reversible computing|reversible]]. However, classical computing can be performed using only reversible gates. For example, the reversible [[Toffoli gate]] can implement all Boolean functions. This gate
| |
| has a direct quantum equivalent, showing that quantum circuits can perform all operations performed by classical circuits.
| |
| | |
| Quantum logic gates are represented by [[unitary matrix|unitary matrices]]. The most common quantum gates operate on spaces of one or two qubits, just like the common classical logic gates operate on one or two bits. This means that as matrices, quantum gates can be described by ''2 × 2'' or ''4 × 4'' unitary matrices.
| |
| | |
| == Commonly used gates ==
| |
| Quantum gates are usually represented as matrices. A gate which acts on k qubits is represented by a 2<sup>k</sup> x 2<sup>k</sup> unitary matrix. The number of qubits in the input and output of the gate have to be equal. The action of the quantum gate is found by multiplying the matrix representing the gate with the vector which represents the quantum state.
| |
| | |
| === Hadamard gate ===
| |
| The Hadamard gate acts on a single qubit. It maps the basis state <math>|0\rangle</math> to <math>\frac{|0\rangle + |1\rangle}{\sqrt{2}}</math> and <math>|1\rangle</math> to <math>\frac{|0\rangle - |1\rangle}{\sqrt{2}}</math> and represents a rotation of <math>\pi</math> about the axis <math>(\hat{x}+\hat{z})/\sqrt{2}</math>. It is represented by the [[Hadamard matrix]]:
| |
| [[Image:Hadamard gate.svg|150px|thumb|Circuit representation of Hadamard gate]]
| |
| :<math> H = \frac{1}{\sqrt{2}} \begin{bmatrix} 1 & 1 \\ 1 & -1 \end{bmatrix}</math>.
| |
| | |
| Since <math>HH^{*}=I</math> where ''I'' is the identity matrix, ''H'' is indeed a [[unitary matrix]].
| |
| | |
| === Pauli-X gate ===
| |
| The Pauli-X gate acts on a single qubit. It is the quantum equivalent of a [[NOT gate]]. It equates to a rotation of the [[Bloch Sphere]] around the X-axis by π radians. It maps <math>|0\rangle</math> to <math>|1\rangle</math> and <math>|1\rangle</math> to <math>|0\rangle</math>. It is represented by the [[Pauli matrices|Pauli]] matrix:
| |
| :<math> X = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}</math>.
| |
| | |
| === Pauli-Y gate ===
| |
| The Pauli-Y gate acts on a single qubit. It equates to a rotation around the Y-axis of the Bloch Sphere by π radians. It maps <math>|0\rangle</math> to <math>i|1\rangle</math> and <math>|1\rangle</math> to <math>-i|0\rangle</math>. It is represented by the [[Pauli matrices|Pauli]] Y matrix: | |
| :<math> Y = \begin{bmatrix} 0 & -i \\ i & 0 \end{bmatrix}</math>.
| |
| | |
| === Pauli-Z gate ===
| |
| The Pauli-Z gate acts on a single qubit. It equates to a rotation around the Z-axis of the Bloch Sphere by π radians. Thus, it is a special case of a phase shift gate (next) with θ=π. It leaves the basis state <math>|0\rangle</math> unchanged and maps <math>|1\rangle</math> to <math>-|1\rangle</math>. It is represented by the [[Pauli matrices|Pauli]] Z matrix:
| |
| :<math> Z = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}</math>.
| |
| | |
| === Phase shift gates ===
| |
| | |
| This is a family of single-qubit gates that leave the basis state <math>|0\rangle</math> unchanged and map <math>|1\rangle</math> to <math>e^{i\theta}|1\rangle</math>. The probability of measuring a <math>|0\rangle</math> or <math>|1\rangle</math> is unchanged after applying this gate, however it modifies the phase of the quantum state. This is equivalent to tracing a horizontal circle (a line of latitude) on the Bloch Sphere by <math>\theta</math> radians.
| |
| | |
| :<math> R_\theta = \begin{bmatrix} 1 & 0 \\ 0 & e^{i \theta} \end{bmatrix} </math>
| |
| | |
| where θ is the ''phase shift''. Some common examples are the <math>\frac{\pi}{8}</math> gate where θ = <math>\frac{\pi}{4}</math>, the phase gate where θ = <math>\frac{\pi}{2}</math> and the Pauli-Z gate where θ = π.
| |
| | |
| === Swap gate ===
| |
| [[Image:Swap gate.svg|150px|thumb|Circuit representation of SWAP gate]]
| |
| The swap gate swaps two qubits. It is represented by the matrix:
| |
| | |
| :<math> \mbox{SWAP} = \begin{bmatrix} 1&0&0&0\\0&0&1&0\\0&1&0&0\\0&0&0&1\end{bmatrix} </math>.
| |
| | |
| === Controlled gates ===
| |
| [[Image:CNOT gate.svg|150px|thumb|Circuit representation of controlled NOT gate]]
| |
| Controlled gates act on 2 or more qubits, where one or more qubits act as a control for some operation. For example, the [[controlled NOT gate]] (or CNOT) acts on 2 qubits, and performs the NOT operation on the second qubit only when the first qubit is <math>|1\rangle</math>, and otherwise leaves it unchanged. It is represented by the matrix
| |
| | |
| :<math> \mbox{CNOT} = \begin{bmatrix}1&0&0&0\\0&1&0&0\\0&0&0&1\\0&0&1&0\end{bmatrix} </math>.
| |
| | |
| More generally if ''U'' is a gate that operates on single qubits with matrix representation
| |
| :<math> U = \begin{bmatrix} x_{00} & x_{01} \\ x_{10} & x_{11} \end{bmatrix} </math>,
| |
| then the ''controlled-U gate'' is a gate that operates on two qubits in such a way that the first qubit serves as a control. It maps the basis states as follows.
| |
| [[Image:Controlled gate.svg|150px|thumb|Circuit representation of controlled-''U'' gate]]
| |
| :<math> | 0 0 \rangle \mapsto | 0 0 \rangle </math>
| |
| :<math> | 0 1 \rangle \mapsto | 0 1 \rangle </math>
| |
| :<math> | 1 0 \rangle \mapsto | 1 \rangle U |0 \rangle = | 1 \rangle \left(x_{00} |0 \rangle + x_{10} |1 \rangle\right) </math>
| |
| :<math> | 1 1 \rangle \mapsto | 1 \rangle U |1 \rangle = | 1 \rangle \left(x_{01} |0 \rangle + x_{11} |1 \rangle\right) </math>
| |
| | |
| The matrix representing the controlled ''U'' is
| |
| | |
| :<math> \mbox{C}(U) = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & x_{00} & x_{01} \\ 0 & 0 & x_{10} & x_{11} \end{bmatrix}</math>.
| |
| | |
| When ''U'' is one of the [[Pauli matrices]], σ<sub>x</sub>, σ<sub>y</sub>, or σ<sub>z</sub>, the respective terms "controlled-''X''", "controlled-''Y''", or "controlled-''Z''" are sometimes used.<ref>M. Nielsen and I. Chuang, ''Quantum Computation and Quantum Information'', Cambridge University Press, 2000</ref>
| |
| | |
| === Toffoli gate ===
| |
| {{Main|Toffoli gate}}
| |
| [[Image:Toffoli gate.svg|150px|thumb|Circuit representation of Toffoli gate]]
| |
| The Toffoli gate, also CCNOT gate, is a 3-bit gate, which is [[Functional completeness|universal]] for classical computation. The quantum Toffoli gate is the same gate, defined for 3 qubits. If the first two bits are in the state <math>|1\rangle</math>, it applies a Pauli-X on the third bit, else it does nothing. It is an example of a controlled gate. Since it is the quantum analog of a classical gate, it is completely specified by its truth table.
| |
| | |
| {|
| |
| ! Truth table !! 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 the gate which maps <math>|a, b, c\rangle</math> to <math>|a, b, c\oplus ab\rangle</math>.
| |
| | |
| === Fredkin gate ===
| |
| {{Main|Fredkin gate}}
| |
| [[Image:Fredkin gate.svg|150px|thumb|Circuit representation of Fredkin gate]]
| |
| The Fredkin gate (also CSWAP gate) is a 3-bit gate that performs a [[Quantum_gate#Controlled_gates|controlled]] [[Quantum_gate#Swap_gate|swap]]. It is [[Functional completeness|universal]] for classical computation. It has the useful property that the numbers of 0s and 1s are conserved throughout, which in the [[billiard-ball computer|billiard ball model]] means the same number of balls are output as input.
| |
| | |
| {|
| |
| ! Truth table !! Matrix form
| |
| |-
| |
| |
| |
| {| class="wikitable"
| |
| |-
| |
| ! colspan="3" | INPUT
| |
| ! colspan="3" | OUTPUT
| |
| |- align="center"
| |
| ! ''C'' !! ''I''<sub>1</sub> !! ''I''<sub>2</sub>
| |
| ! ''C'' !! ''O''<sub>1</sub> !! ''O''<sub>2</sub>
| |
| |- 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 || 1 || 0
| |
| |- align="center"
| |
| | 1 || 1 || 0 || 1 || 0 || 1
| |
| |- align="center"
| |
| | 1 || 1 || 1 || 1 || 1 || 1
| |
| |}
| |
| |
| |
| <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 & 0 & 1 & 0 \\
| |
| 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\
| |
| 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\
| |
| \end{bmatrix}
| |
| </math> | |
| |}
| |
| | |
| == Universal quantum gates ==
| |
| | |
| Informally, a set of '''universal quantum gates''' is any set of gates to which any operation possible on a quantum computer can be reduced, that is, any other unitary operation can be expressed as a finite sequence of gates from the set. Technically, this is impossible since the number of possible quantum gates is [[uncountable]], whereas the number of finite sequences from a finite set is [[countable]]. To solve this problem, we only require that any quantum operation can be approximated by a sequence of gates from this finite set. Moreover, for the specific case of single qubit unitaries the [[Solovay–Kitaev theorem]] guarantees that this can be done efficiently.
| |
| | |
| One simple set of two-qubit universal quantum gates is the Hadamard gate (<math>H</math>), the <math>\pi/8</math> gate <math>R(\pi / 4)</math>, and the controlled NOT gate.
| |
| | |
| A single-gate set of universal quantum gates can also be formulated using the three-qubit Deutsch gate <math>D(\theta)</math>, which performs the transformation<ref>{{Citation | last=Deutsch | first=David | author-link=David Deutsch | title=Quantum computational networks | journal=Proc. R. Soc. Lond. A | volume=425 | issue=1968 | pages=73–90 | date=September 8, 1989 | url=http://www.physics.princeton.edu/~mcdonald/examples/QM/deutsch_prsl_a425_73_89.pdf | doi=10.1098/rspa.1989.0099|bibcode = 1989RSPSA.425...73D }}</ref>
| |
| | |
| :<math> |a,b,c\rangle \mapsto \begin{cases} i \cos(\theta) |a,b,c\rangle + \sin(\theta) |a,b,1-c\rangle & \mbox{for }a=b=1 \\ |a,b,c\rangle & \mbox{otherwise.}\end{cases}</math>
| |
| | |
| The universal classical logic gate, the [[Toffoli gate]], is reducible to the Deutsch gate, <math>D(\begin{matrix} \frac{\pi}{2} \end{matrix})</math>, thus showing that all classical logic operations can be performed on a universal quantum computer.
| |
| | |
| == Realistic realization of NAND quantum gate with two controlled spins — Example ==
| |
| {{Disputed-section|NAND is not unitary|date=February 2013}}
| |
| | |
| The quantum gate of the negation of the conjunction or [[NAND gate|NAND]] can be built for example with
| |
| two electron [[Electron magnetic dipole moment|spins]] interacting together with the simplest [[Exchange interaction|exchange]]-like interaction and
| |
| both put in the magnetic field with the controlled time dependent direction used for its operation.
| |
| The Hamiltonian is given by
| |
| :<math>H=-\boldsymbol{\sigma_1} \cdot \bold B-\boldsymbol{\sigma_2} \cdot \bold B-\boldsymbol{\sigma_1} \cdot \boldsymbol{\sigma_2}</math>,
| |
| where <math>\boldsymbol{\sigma_1}</math>, <math>\boldsymbol{\sigma_2}</math> are vector-operators
| |
| of the electron spins consisting of three [[Pauli matrices]].
| |
| The [[Bloch equation]]s without damping obtained from the Schrödinger equation are:
| |
| :<math>\dot \boldsymbol{\sigma_1}=\boldsymbol{\sigma_1} \times \bold B + \boldsymbol{\sigma_1} \times \boldsymbol{\sigma_2}</math>
| |
| :<math>\dot \boldsymbol{\sigma_2}=\boldsymbol{\sigma_2} \times \bold B + \boldsymbol{\sigma_2} \times \boldsymbol{\sigma_1}</math>
| |
| Those equations can be solved in the adiabatic following approximation when the spin vectors with the infinitesimal
| |
| [[Larmor precession]] follow the vector of the magnetic field only assuming that
| |
| <math>|\bold B| = |\boldsymbol {\sigma_i}|</math>.
| |
| Depending on whether the vectors are both parallel or anti-parallel to the magnetic field or anti-parallel to each other
| |
| they either both adiabatically follow the magnetic field and change the direction by the 180° or the left side
| |
| of one of the equations identically vanishes and only the direction of one of the spins changes which follows adiabatically
| |
| the superposition of the field and the second added frozen spin acting as the effective field.
| |
| The function of the change of the magnetic field in time is obviously unconditional and not dependent on the
| |
| initial state of both spins which guarantees proper gate operation.
| |
| Intuitively this operation can be understood that the magnetic field aligns the [[Antiferromagnet|antyferromagnetic]] ordering
| |
| of two spins into the privileged [[Ferromagnetism|ferromagnetic]] one while reversing the existing ferromagnetic ordering.
| |
| After the time of the adiabatic change of the field direction <math>\bold B</math> by 180 degrees we have therefore
| |
| :<math>e^{-i\int H(t) dt_{op}}\begin{bmatrix} 1 \\ 0 \end{bmatrix} \otimes \begin{bmatrix} 1 \\ 0 \end{bmatrix}=\begin{bmatrix} 0 \\ -1 \end{bmatrix} \otimes \begin{bmatrix} 0 \\ -1 \end{bmatrix}</math>
| |
| :<math>e^{-i\int H(t) dt_{op}}\begin{bmatrix} 0 \\ -1 \end{bmatrix} \otimes \begin{bmatrix} 0 \\ -1 \end{bmatrix}=\begin{bmatrix} 1 \\ 0 \end{bmatrix} \otimes \begin{bmatrix} 1 \\ 0 \end{bmatrix}</math>
| |
| :<math>e^{-i\int H(t) dt_{op}}\begin{bmatrix} 1 \\ 0 \end{bmatrix} \otimes \begin{bmatrix} 0 \\ -1 \end{bmatrix}=\begin{bmatrix} 1 \\ 0 \end{bmatrix} \otimes \begin{bmatrix} 1 \\ 0 \end{bmatrix}</math>
| |
| :<math>e^{-i\int H(t) dt_{op}}\begin{bmatrix} 0 \\ -1 \end{bmatrix} \otimes \begin{bmatrix} 1 \\ 0 \end{bmatrix}=\begin{bmatrix} 1 \\ 0 \end{bmatrix} \otimes \begin{bmatrix} 1 \\ 0 \end{bmatrix}</math>
| |
| While interpreting the spin up as logical 1, down as 0 and the duplicated spin of the final state
| |
| as the result we obtain the gate of conjunction negation or NAND.
| |
| | |
| == History ==
| |
| | |
| The current notation for quantum gates was developed by Barenco ''et al.'',<ref>Phys. Rev. A '''52''' 3457–3467 (1995), DOI:[http://dx.doi.org/10.1103/PhysRevA.52.3457 10.1103/PhysRevA.52.3457]; e-print [http://arxiv.org/abs/quant-ph/9503016 arXiv:quant-ph/9503016]</ref> building on notation introduced by Feynman.<ref>R. P. Feynman, "Quantum mechanical computers", Optics News, February 1985, '''11''', p. 11; reprinted in Foundations of Physics '''16'''(6) 507–531</ref>
| |
| | |
| == See also ==
| |
| *[[Pauli matrices]]
| |
| | |
| == Notes ==
| |
| <references/>
| |
| | |
| == References ==
| |
| * M. Nielsen and I. Chuang, ''Quantum Computation and Quantum Information'', Cambridge University Press, 2000
| |
| | |
| {{Quantum computing}}
| |
| | |
| {{DEFAULTSORT:Quantum Gate}}
| |
| [[Category:Quantum gates| ]]
| |
| [[Category:Quantum information science]]
| |
| [[Category:Logic gates]]
| |