The controlled-NOT gate maps to .
Writing a CNOT gate as gives , where . In the Hadamard basis, flips the sign label and is diagonal. Thus the same gate matrix reverses its control and target roles under the two local basis changes.
A CNOT gate can correlate either the original control's computational label with a computational pointer, or the original target's sign-basis label with a sign-basis pointer. For the second interpretation prepare the original control in and read it in the Hadamard basis. Its two pointer states become and , measuring on the original target. An apparatus role therefore depends on the ready state and readout as well as the measurement interaction.
The SWAP gate maps to .
The SWAP gate and local unitary operators preserve product states. The displayed identity moves every exchange past a pair of local gates, reducing any such two-qubit quantum circuit to a local operation, optionally followed by SWAP gate. On more wires the same argument leaves a permutation of the tensor factors. By induction, a fully factored input remains factored. Since universal quantum computation includes operations that create quantum entanglement from a product state, these gates cannot form a universal quantum gate set.
For two spin-one-half qubits, the SWAP gate acts as one on the triplet sector and minus one on the singlet sector. The displayed unitary squares to SWAP. An isotropic exchange interaction with integrated angle implements it up to a common phase. There are other square-root branches; a pulse decomposition must use the declared branch consistently.
Let project onto and let project onto the symmetric sector. An isotropic exchange interaction, with a chosen common energy offset, gives the continuous family displayed above. A full exchange has and equals SWAP gate; the conventional half exchange has and equals . Reversing the sign of the exchange gives the same full exchange at but the inverse half exchange at . Thus even continuous time-independent Hamiltonian evolution and unchanged do not let the full-time truth table determine a unique half-time gate. A chosen generator or spectral branch is necessary. The half-exchange eigenvalues are the conventional principal scalar square-root choices for ; no analytic matrix-function branch across the negative real axis is being assumed.
Two square roots of the SWAP gate, separated and followed by local rotations, implement a controlled phase gate. Local rotations of its target convert it into a CNOT gate. The construction assumes isotropic exchange and independent one-qubit control; pulse errors and extra Hamiltonian terms change the implemented operation.
With the conventional square root of the SWAP gate, the S gate, and operators acting rightmost first, . Therefore . Appending changes the zero-controlled flip into a one-controlled flip, and removes the control-dependent phase. This proves the displayed exact CNOT gate identity. Both the exchange branch and the phase gate square-root convention matter; changing either requires recalculating the correction.
Applying controlled-NOT gates with directions , , and maps
and therefore implements the SWAP gate.
The three-qubit GHZ state is
A postselection scheme in which two polarization-entangled photon pairs pass through polarizing beam splitters, a half-wave plate and a nonpolarizing beam splitter. One photon at each of a trigger and three output detectors selects a GHZ state in the three output polarizations, provided optical mode matching removes distinguishable pair labels. All four detections are needed for the selected event; the trigger alone does not guarantee the three other output occupations.
The 1999 experiment used an approximately , pump pulse and a beta barium borate crystal. Two polarization-entangled photon pairs supplied four photons. A trigger and three other photodetectors selected a GHZ state through fourfold coincidence counting. Narrow interference filters lengthened the photon coherence time to approximately , exceeding the pump duration and suppressing timing information about which pair supplied which photon. The optical mode matching was essential to coherence, not merely to routing photons.[ref]
The observed state was selected by all four detections, which also measured the photons. A trigger alone did not demonstrate a guaranteed surviving three-photon output. This distinction connects postselection to what an apparatus actually supplies, rather than identifying a fourfold coincidence with an unconditional source.[ref]
For a source with exactly two photons in each input arm, let be the probability of one horizontal and one vertical photon in the trigger arm. This sector alone supplies exactly one trigger photon. Splitting the other arm across its two output ports has probability ; the final polarizing beam splitter selects equal polarizations with probability . The fourfold success probability is therefore . The two-pair component of polarization-entangled down-conversion has , giving ; independent pair bookkeeping has , giving . Pair-label distinguishability can also destroy the conditional GHZ state coherence and must be checked separately.
Charlie measures his qubit of a GHZ state in the basis. The two equally likely outcomes leave Alice and Bob in the Bell states or , respectively. Charlie sends the outcome bit to Bob, who applies the Pauli operator , giving in either case. This is deterministic LOCC entanglement localization. If Charlie's record is ignored, Alice and Bob instead have the separable mixture . The classical outcome is necessary to turn the conditional entanglement into a known usable Bell pair.
For , apply a Hadamard gate to one qubit, then controlled-NOTs from it to all others. Replacing each controlled-NOT gate by a target Hadamard, a Controlled-Z gate, and another target Hadamard uses allowed gates. Each one-qubit reduced state is , proving entanglement across each qubit-versus-rest bipartition.
For , a Bell measurement on and the first leg of a GHZ state leaves the other two legs in , after applying to both legs for the two outcomes.
Starting from , apply a Hadamard gate to the first qubit and then controlled-NOT gates from the first qubit to each of the other two qubits.
If two senders share a GHZ state with a receiver, one sender can encode two bits with and the other one bit with . Sending both qubits to the receiver produces one of eight orthogonal GHZ-basis states, so a joint measurement recovers all three bits.
The GHZ theorem uses perfect multipartite quantum correlations to contradict local predetermined values without a statistical inequality. For the three-qubit GHZ state, three certain Pauli-product relations force a fourth product to have the opposite sign from its quantum-mechanical value.
A three-party nonlocal game with binary questions of even Hamming weight. Its winning output parity is half the question weight modulo two. For the four possible input triples, a hypothetical deterministic classical response would give four parity equations whose left sides cancel under exclusive or, while their right sides have odd total parity. Thus no classical strategy succeeds on every allowed triple, even with pre-shared randomness.
On the GHZ state, measure the Pauli X gate as an observable for question zero and the Pauli Y gate for question one, and encode the measured eigenvalue as . The joint observables XXX, XYY, YXY and YYX have respective GHZ eigenvalues . Their products of local outcomes enforce the required parity with certainty. The strategy uses pre-shared quantum entanglement and local measurements during the game, without communication. It realizes the GHZ theorem as an operational task. If the four questions are uniform, the best classical success is : the parity contradiction bounds it above, and the deterministic rule , wins three triples and loses only 011. The uniformity assumption is necessary for that numerical score, not for the impossibility of worst-case certainty.
If each of , and has product except with probability , predetermined local X/Y values imply that a positive YYY product requires at least one of those constraints to fail. The union bound gives the displayed result without assuming independent errors. For the mixture of and its phase-flipped partner with weights , quantum mechanics instead gives . The violation survives for . A noisy local outcome histogram is not uniquely determined by these parity statistics alone.
For , let have one Pauli X gate at site and Pauli Y gates elsewhere, and let . The relations , show that is proportional to exactly when is odd. In that case its eigenvalue is , while always has eigenvalue .
Under the EPR criterion of reality and locality, each site's and outcomes have predetermined values . Multiplying the certain equations gives when is odd, since every appears an even number of times. This contradicts the certain quantum value precisely when . Thus the displayed GHZ state gives an infinite family of perfect-correlation contradictions with local hidden-variable theory, without an inequality.

Ancestors (5)

  1. Controlled unitary gate
  2. Quantum theory
  3. Branches of physics
  4. Physics
  5. Home

Synonyms (1)

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

A Controlled NOT gate, commonly referred to as a CNOT gate or CX gate, is an essential component in quantum computing. It is a two-qubit gate that performs a NOT operation (also known as a bit-flip) on a target qubit only when a control qubit is in the state \(|1\rangle\).