publication . Article . Preprint . Other literature type . 2017

Quantum arithmetic with the quantum Fourier transform

Ruiz-Perez, Lidia; Garcia-Escartin, Juan Carlos;
Open Access
  • Published: 28 Apr 2017 Journal: Quantum Information Processing, volume 16 (issn: 1570-0755, eissn: 1573-1332, Copyright policy)
  • Publisher: Springer Nature
Comment: 14 pages, 5 figures. Revised version with corrected and expanded results. Comments are welcome
ACM Computing Classification System: ComputerSystemsOrganization_MISCELLANEOUSHardware_ARITHMETICANDLOGICSTRUCTURES
free text keywords: Quantum computer, Fractional Fourier transform, Quantum algorithm, Physics, Discrete Fourier transform (general), Quantum operation, Arithmetic, Quantum error correction, Quantum phase estimation algorithm, Quantum Fourier transform, Quantum Physics

1. P. W. Shor (1997) Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer . SIAM Journal on Computing, 26(5), 1484.

2. V. Vedral, A. Barenco, and A. Ekert (1996) Quantum networks for elementary arithmetic operations. Physical Review A, 54(1), 147-153. [OpenAIRE]

3. D. Beckman, A. N. Chari, S. Devabhaktuni, and J. Preskill (1996) Efficient networks for quantum factoring. Physical Review A, 54, 1034-1063. [OpenAIRE]

4. S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. P. Moulton (2004) A new quantum ripple-carry addition circuit. arXiv preprint quant-ph/0410184. [OpenAIRE]

5. R. Van Meter and K. M. Itoh (2005) Fast quantum modular exponentiation. Physical Review A, 71, 052320. [OpenAIRE]

6. T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore (2006) A Logarithmic-depth Quantum Carry-lookahead Adder . Quantum Information & Computation, 6(4), 351-369.

7. J. J. A´lvarez-S´anchez, J. V. A´lvarez-Bravo, and L. M. Nieto (2008) A quantum architecture for multiplying signed integers. Journal of Physics: Conference Series, 128(1), 012013.

8. R. V. Meter, W. J. Munro, K. Nemoto, and K. M. Itoh (2008) Arithmetic on a Distributed-memory Quantum Multicomputer . Journal of Emerging Technologies in Computing Systems, 3(4), 2:1- 2:23.

9. N. Wiebe and M. Roetteler (2014) Quantum arithmetic and numerical analysis using RepeatUntil-Success circuits. Techical Report MSR-TR-2014-103, Microsoft Research. [OpenAIRE]

10. B.-S. Choi and R. Van Meter (2012) A Θ(√n)-depth Quantum Adder on the 2D NTC Quantum Computer Architecture. Journal of Emerging Technologies in Computing Systems, 8(3), 24:1- 24:22.

11. T. G. Draper (2000) Addition on a quantum computer . arXiv preprint quant-ph/0008033.

12. S. Beauregard (2003) Circuit for Shor's Algorithm Using 2n+3 Qubits. Quantum Information & Computation, 3(2), 175-185.

13. A. Pavlidis and D. Gizopoulos (2014) Fast Quantum Modular Exponentiation Architecture for Shor's Factoring Algorithm. Quantum Information & Computation, 14(7& 8), 649-682.

14. C. Maynard and E. Pius (2014) Quantum Information Processing, 13(5).

15. C. Du¨rr and P. Hoyer (1996) A Quantum Algorithm for Finding the Minimum. eprint arXiv:quant-ph/9607014.

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue