The quantum fourier transform on a linear nearest neighbor architecture

Quantum Information and Computation

Volumn 7, Issue 4, 2007, Pages 383-391

  Takahashi, Yasuhiro ^a,b   Kunihiro, Noboru ^b   Ohta, Kazuo ^b  

^a Nippon Telegraph and Telephone Corporation   (Japan)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Linear nearest neighbor architectures; Quantum circuits; Quantum fourier transforms; Shor's factoring algorithm

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION SYSTEMS;

LINEAR NEAREST NEIGHBORS; QUANTUM CIRCUIT; QUANTUM FOURIER TRANSFORMS; SHOR'S FACTORING ALGORITHM;

FOURIER TRANSFORMS;

EID: 34247273636     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. P. W. Shor (1994), Algorithms for quantum computation: discrete logarithms and factoring, Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 124-134.
2. D. Coppersmith (1996), An approximate Fourier transform useful in quantum factoring, quant-ph/0201067.
3. L. Hales and S. Hallgren (2000), An improved quantum Fourier transform algorithm and applications, Proc. 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 515-525.
4. R. Cleve and J. Watrous (2000), Fast parallel circuits for the quantum Fourier transform, Proc. 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 526-536.
5. M. Mosca and C. Zalka (2003), Exact quantum Fourier transforms and discrete logarithm algorithms, quant-ph/0301093.
6. G. Ahokas, R. Cleve, and L. Hales (2003), The complexity of quantum Fourier transforms and integer multiplication, Proc. ERATO conference on Quantum Information Science 2003, pp. 39-40.
7. A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg (2004), Implementation of Shor's algorithm on a linear nearest neighbour qubit array, Quantum Information and Computation, Vol. 4 No. 4, pp. 237-251.
8. A. Blais (2001), Quantum network optimization, Physical Review A, Vol. 64, 022312.
9. M. A. Nielsen and I. L. Chuang (2000), Quantum Computation and Quantum Information, Cambridge University Press.
10. R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca (1998), Quantum algorithm revisited, Proc. the Royal Society of London A, Vol. 454 No. 1969, pp. 339-354.
11. T. G. Draper (2000), Addition on a quantum computer, quant-ph/0008033.
12. S. Beauregard (2003), Circuit for Shor's algorithm using 2n + 3 qubits, Quantum Information and Computation, Vol. 3 No. 2, pp. 175-185.
13. Y. Takahashi and N. Kunihiro (2006), A quantum circuit for Shor's factoring algorithm using 2n + 2 qubits, Quantum Information and Computation, Vol. 6 No. 2, pp. 184-192.
14. C. Moore and M. Nilsson (2002), Parallel quantum computation and quantum codes, SIAM Journal on Computing, Vol. 31 No. 3, pp. 799-815.