Efficient Toffoli gates using qudits
Creators
- 1. Centre for Quantum Computer Technology, University of Queensland, Brisbane 4072, QLD (Australia)
- 2. Institute for Quantum Computing and Department of Physics and Astronomy, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1 (Canada)
- 3. Department of Physics, University of Queensland, Brisbane 4072, QLD (Australia)
Description
The simplest decomposition of a Toffoli gate acting on 3 qubits requires five 2-qubit gates. If we restrict ourselves to controlled-sign (or controlled-NOT) gates this number climbs to 6. We show that the number of controlled-sign gates required to implement a Toffoli gate can be reduced to just 3 if one of the three quantum systems has a third state that is accessible during the computation--i.e., is actually a qutrit. Such a requirement is not unreasonable or even atypical since we often artificially enforce a qubit structure on multilevel quantums systems (e.g., atoms, photonic polarization plus spatial modes). We explore the implementation of these techniques in optical quantum processing and show that linear optical circuits could operate with much higher probabilities of success
Additional details
Identifiers
- DOI
- 10.1103/PhysRevA.75.022313;
- arXiv
- arXiv:0806.0654v1;
Publishing Information
- Journal Title
- Physical Review. A
- Journal Volume
- 75
- Journal Issue
- 2
- Journal Page Range
- p. 022313-022313.5
- ISSN
- 1050-2947
- CODEN
- PLRAAN
INIS
- Country of Publication
- United States
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 39010831
- Subject category
- S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS;
- Descriptors DEI
- COMPUTER CALCULATIONS; DATA PROCESSING; PHOTON-ATOM COLLISIONS; POLARIZATION; PROBABILITY; QUANTUM COMPUTERS; QUANTUM MECHANICS; QUBITS
- Descriptors DEC
- ATOM COLLISIONS; COLLISIONS; COMPUTERS; INFORMATION; MECHANICS; PHOTON COLLISIONS; PROCESSING; QUANTUM INFORMATION
Optional Information
- Notes
- (c) 2007 The American Physical Society