Entanglement and its role in Shor's algorithm

Quantum Information and Computation

Volumn 6, Issue 7, 2006, Pages 630-640

  Kendon, Vivien M ^a,b   Munro, William J ^b,c  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c HEWLETT PACKARD LABORATORIES   (United Kingdom)

Author keywords

Entanglement; Quantum computing; Shor's algorithm

Indexed keywords

QUBITS;

CLASSICAL COUNTERPART; CRITICAL RESOURCES; ENTANGLEMENT; QUANTUM COMPUTING; QUANTUM FOURIER TRANSFORMS; QUANTUM-INFORMATION PROCESSING; SHOR'S ALGORITHMS; SHOR'S FACTORING ALGORITHM;

QUANTUM ENTANGLEMENT;

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

References (35)

1. S. Braunstein, H.-K. Lo (Eds.), Scalable Quantum Computers: Paving the Way to Realization, Vol. 48, Fortschr. Phys., 2000.
2. R. Jozsa, Entanglement and quantum computation, in: S. A. Huggett, L. J. Mason, K. P. Tod, S. Tsou, N. M. J. Woodhouse (Eds.), The Geometric Universe, Geometry, and the Work of Roger Penrose, Oxford University Press, 1998, pp. 369-379.
3. R. Jozsa, N. Linden, On the role of entanglement in quantum computational speed-up, Proc. Roy. Soc. Lond. A Mat. 459 459 (2036) (2003) 2011-2032, quant-ph/0201143.
4. M. A. Nielsen, I. J. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambs. UK, 2000.
5. D. Gottesman, A theory of fault-tolerant quantum computation, Phys. Rev. A 57 (1998) 127, quant-ph/9702029.
6. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Sci Statist. Comput. 26 (1997) 1484, quant-ph/9508027.
7. M. Agrawal, N. Kayal, N. Saxena, Primes is in p, Annals of Mathematics 160 (2) (2004) 781-793.
8. A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, D. A. Spielman, Exponential algorithmic speedup by a quantum walk, in: Proc. 35th Annual ACM STOC, ACM, NY, 2003, pp. 59-68, quant-ph/0209131.
9. M. Nielsen, I. Chuang, talk at ITP Workshop (1995).
10. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, W. K. Wootters, Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels, Phys. Rev. Lett. 70 (1993) 1895-1899.
11. C. H. Bennett, S. J. Wiesner, Communication via one- and two-particle operators on einstein-podolsky-rosen states, Phys. Rev. Lett. 69 (20) (1992) 2881-2884.
12. G. Vidal, Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett. 91 (2003) 147902, quant-ph/0301063.
13. R. Orus, J. I. Latorre, Universality of entanglement and quantum computation complexity, Phys. Rev. A 69 (2004) 052308, quant-ph/0311017.
14. A. Ukena, A. Shimizu, Macroscopic entanglement in quantum computation, quant-ph/0505057 (2005).
15. Y. Shimoni, D. Shapira, O. Biham, Entangled quantum states generated by Shor's factoring algorithm, quant-ph/0510042 (2005).
16. S. Parker, M. B. Plenio, Entanglement simulations of Shor's algorithm, J. Mod. Optic 49 (8) (2001) 1325-1353, quant-ph/0102136.
17. V. Vedral, A. Barenco, A. Ekert, Quantum networks for elementary arithmetic operations, Phys. Rev. A 54 (1996) 147-153.
18. P. Gossett, Carry-save arithmetic, quant-ph/9808061 (1998).
19. R. V. Meter, K. M. Itoh, Fast quantum modular exponentiation, Phys. Rev. A 71 (2005) 052320, quant-ph/0408006.
20. C. Zalka, Fast versions of Shor's quantum factoring algorithm, quant-ph/9806084 (1998).
21. S. Beauregard, Circuit for Shor's algorithm using 2n+3 qubits, Quantum Information and Computation 3 (2) (2003) 175-185, quant-ph/0205095.
22. A. G. Fowler, L. C. L. Hollenberg, Scalability of Shor's algorithm with a limited set of rotation gates, Phys. Rev. A 70 (2004) 032329, quant-ph/0306018.
23. D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison Wesley, 1981.
24. A. Peres, Separability criterion for density matrices, Phys. Rev. Lett. 77 (1996) 1413-1415, quant-ph/9604005.
25. K. Życzkowski, P. Horodecki, A. Sanpera, M. Lewenstein, On the volume of the set of mixed entangled states, Phys. Rev. A 58 (1998) 883-892.
26. M. Horodecki, P. Horodecki, R. Horodecki, Mixed-state entanglement and distillation: is there a "bound" entanglement in nature?, Phys. Rev. Lett. 80 (1998) 5239-5242, quant-ph/9801069.
27. P. Horodecki, M. Horodecki, R. Horodecki, Bound entanglement can be activated, Phys. Rev. Lett. 82 (1999) 1056-1059, quant-ph/9801069.
28. W. K. Wootters, Entanglement of formation of an arbitrary state of two qubits, Phys. Rev. Lett. 80 (1998) 2245-2248, quant-ph/9709029.
29. V. Coffman, J. Kundu, W. K. Wootters, Distributed entanglement, Phys. Rev. A 61 (2000) 052306, quant-ph/9907047.
30. V. M. Kendon, K. Życzkowski, W. J. Munro, Bounds on entanglement in qudit systems, Phys. Rev. A 66 (2002) 062310, quant-ph/0203037.
31. D. M. Greenberger, M. Home, A. Zeilinger, Going beyond bell's theorem, in: M. Kafatos (Ed.), Bell's Theorem, Quantum Theory, and Conceptions of the Universe, Kluwer, 1989, pp. 73-76.
32. m is allowable is precisely the set of numbers for which a regular N-gon is constructible with straight-edge and compass. (2005).
33. A. D. Greentree, S. G. Schirmer, F. Green, L. C. L. Hollenberg, A. R. Hamilton, R. G. Clark, Maximizing the hilbert space for a finite number of distinguishable quantum states, Phys. Rev. Lett. 92 (2004) 097901, quant-ph/0304050.
34. R. Blume-Kohout, C. M. Caves, I. H. Deutsch, Climbing mount scalable: Physical resource requirements for a scalable quantum computer, Found. Phys. 32 (11) (2002) 1641, quant-ph/0204157.
35. P. Hayden, D. W. Leung, A. Winter, Aspects of generic entanglement, Comm. Math. Phys. March 2006 (2006) in pressQuant-ph/0407049.