Optimal quantum circuits for nearest-neighbor architectures

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 22, Issue , 2013, Pages 294-307

  Rosenbaum, David J ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

2D; Nearest neighbor; Quantum architecture; Quantum complexity; Quantum computation

Indexed keywords

QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY; TIMING CIRCUITS;

ABSTRACT MODELING; CLASSICAL CONTROLLERS; LOCAL INTERACTIONS; NEAREST NEIGHBORS; QUANTUM ARCHITECTURE; QUANTUM COMPLEXITY; STANDARD ASSUMPTIONS; THE STANDARD MODEL;

QUANTUM COMMUNICATION;

EID: 84908229564     PISSN: 18688969     EISSN: None     Source Type: Book    
DOI: 10.4230/LIPIcs.TQC.2013.294     Document Type: Conference Paper

References (19)

1. D. Aharonov, M. Ben-Or, R. Impagliazzo, and N Nisan. Limitations of Noisy Reversible Computation. arXiv e-prints, 1996.
2. Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K. Wootters. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters, 70, 1993.
3. Dan E. Browne, Elham Kashefi, and Simon Perdrix. Computational depth complexity of measurement-based quantum computation. In In Proceedings of the Fifth Conference on the Theory of Quantum Computation, Communication and Cryptography, 2010.
4. Donny Cheung, Dmitri Maslov, and Simone Severini. Translation techniques between quantum circuit architectures. In Workshop on Quantum Information Processing, 2007.
5. B.-S. Choi and R. Van Meter. An Θ (√n)-depth quantum adder on a 2D NTC quantum computer architecture. arXiv:1008.5093, 2010.
6. Byung-Soo Choi and Rodney Van Meter. On the effect of quantum interaction distance on quantum addition circuits. ACM Journal on Emerging Technologies in Computing Systems, 7:11:1-11:17, 2011.
7. A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg. Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array. arXiv e-prints, 2004.
8. Peter Høyer and Robert Špalek. Quantum fan-out is powerful. Theory of Computing, 1:81-103, 2005.
9. S. A. Kutin. Shor's algorithm on a nearest-neighbor machine. arXiv e-prints, 2006.
10. D. Maslov. Linear depth stabilizer and quantum Fourier transformation circuits with no auxiliary qubits in finite-neighbor quantum architectures. arXiv e-prints, 2007.
11. C. Moore. Quantum Circuits: Fanout, Parity, and Counting. arXiv e-prints, 1999.
12. P. Pham and K. M. Svore. A 2D Nearest-Neighbor Quantum Architecture for Factoring. arXiv e-prints, 2012.
13. R. Raussendorf, D. E. Browne, and H. J. Briegel. The one-way quantum computer-a non-network model of quantum computation. arXiv e-prints, 2002.
14. Robert Raussendorf and Hans J Briegel. A one-way quantum computer. Physical Review Letters, 86:5188-5191, 2001.
15. D. Rosenbaum. Optimal Quantum Circuits for Nearest-Neighbor Architectures. arXiv:1205:0036, 2012.
16. Peter W. Shor. Algorithms for quantum computation: Discrete logarithms and factoring. In Annual Symposium on Foundations of Computer Science, 1994.
17. Y. Takahashi and S. Tani. Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions. arXiv e-prints, 2011.
18. B. M. Terhal and D. P. DiVincenzo. Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games. arXiv e-prints, 2002.
19. Rodney Van Meter and Kohei M. Itoh. Fast quantum modular exponentiation. Phys. Rev. A, 71:052320, 2005.