Deconstructing dense coding

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 66, Issue 3, 2002, Pages 323081-323083

  Mermin, N David ^a  

^a Laboratory of Atomic and Solid State Physics and Sibley School of Mechanical and Aerospace Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ENCODING (SYMBOLS); FOURIER TRANSFORMS; INFORMATION THEORY; MATHEMATICAL OPERATORS;

QUANTUM DENSE CODING;

QUANTUM THEORY;

EID: 0036756852     PISSN: 10502947     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. Charles H. Bennett, and Stephen J. Wiesner, Phys. Rev. Lett. 69, 2881 (1992).
2. N. David Mermin, Phys. Rev. A 65, 012320 (2001); e-print quant-ph/0105117.
3. I call a circuit classical if every gate transforms classical states into other classical states, i.e., if every gate acts as a permutation on states of the computational basis.
4. z, and H= 1√2(X+Z) is the Hadamard gate. The two-qubit controlled gates 1/√cX and 1/√cZ act with X or Z on their target qubits if their control qubits (black dot) are in the state |1〉 and as the identity if their control qubits are in the state |0〉.
5. Bei Zeng, Xiao-Shu Liu, Yan-Song Li, and Gui Lu Long, e-print quant-ph/0104102, (unpublished).
6. Note the deplorable but pervasive convention that the operator on the left acts first in a circuit diagram even though the operator on the right acts first in an equation.