An efficient conversion of quantum circuits to a linear nearest neighbor architecture

Quantum Information and Computation

Volumn 11, Issue 1-2, 2011, Pages 142-166

  Hirata, Yuichi ^a,b   Nakanishi, Masaki ^a,c   Yamashita, Shigeru ^a,d   Nakashima, Yasuhiko ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b NISSAN MOTOR CO   (Japan)

^c YAMAGATA UNIVERSITY   (Japan)

^d RITSUMEIKAN UNIVERSITY   (Japan)

Author keywords

Linear nearest neighbor (LNN); Quantum circuit

Indexed keywords

QUANTUM EFFICIENCY; TIMING CIRCUITS;

CIRCUITRY COMPLEXITY; CONVERSION METHODS; LINEAR NEAR NEIGHBOR; LINEAR NEAREST NEIGHBORS; QUANTUM CIRCUIT; TIME COMPLEXITY;

QUANTUM COMPUTERS;

EID: 78650980304     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic11.1-2-10     Document Type: Article

References (13)

1. P. W. Shor (1994), Algorithm for quantum computation: discrete logarithm and factoring, Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 124-134.
2. M. A. Nielsen and I. L. Chuang (2000), Quantum Computation and Quantum Information, Cambridge University Press.
3. S. A. Cuccaro, T. G. Draper, S. A. Kutin and D. P. Moulton (2004), A new quantum ripplecarry addition circuit, quantph/0410184.
4. A. G. Fowler, S. J. Devitt and L. C. L. Hollenberg (2004), Implementation of Shor's Algorithm on a Linear Nearest Neighbor Qubit Array, Quantum Information and Computation, Vol.4 No.4, pp. 237-251.
5. D. Coppersmith (1996), An approximate Fourier transform useful in quantum factoring, quantph/0201067.
6. Y. Takahashi, N. Kunihiro and K.Ohta (2007), The quantum Fourier transform on a linear nearest neighbor architecture, Quantum Information and Quantum Computation, Vol.7, No.4, pp. 383-391.
7. D. Chueng, D. Maslov and S. Severini, Translation Techniques Between Quantum Circuit Architecture, available online at http://www.iqc.ca/~sseverin/qipabs.pdf.
8. A. Barenco, C. H. Bennet, R. Cleve, D. P. DiVincenzo, N. Nargolus, P. Shor, T. Sleator, J. A. Smolin and H. Weinfurter (1995), Elementary gates for quantum computation, Phys. Rev. A, Vol. 52, pp. 3457-3467.
9. S. A. Kutin, D. P. Moulton and L. M. Smithline (2007), Computation at a Distance, quantph/0701194.
10. S. Beauregard (2003), Circuit for Shor's Algorithm using 2n+3 qubits, Quantum Information and Computation, Vol.3, pp. 175-185, quantph/0205095.
11. D. Maslov, S. Falconer, M. Mosa (2007), Quantum circuit placement, Asian Conference on Quantum Information Science, pp. 14-15, quantph/0703256.
12. S. A. Kutin (2006), Shor's Algorithm on a Nearest-Neeighbor Machine, quantph/0609001.
13. R. Van Meter, K. M. Itoh (2005), Fast quantum modular exponentiation, Phys. Rev. A, Vol. 71, 052320.