438
Views
13
CrossRef citations to date
0
Altmetric
Original Articles

Quantum computing: beyond the limits of conventional computationFootnote

&
Pages 123-135 | Received 01 Apr 2006, Accepted 01 May 2006, Published online: 22 Dec 2006

References

  • Akl , S.G. 2005 . “ The myth of universal computation ” . In Parallel Numerics, Part 2, Systems and Simulation Edited by: Trobec , R. , Zinterhof , P. , Vajteršic , M. and Uhl , A. 211 – 236 . University of Salzburg, Austria and Jožef Stefan Institute, Ljubljana, Slovenia
  • Bell , J. 1964 . On the Einstein–Podolsky–Rosen paradox . Physics , 1 : 195 – 200 .
  • Benjamin , E. , Huang , K. , Kamil , A. and Kittiyachavalit , J. 2003 . Quantum Computability and Complexity and the Limits of Quantum Computation http://www.cs.berkeley.edu/∼kamil/quantum/qc4.pdf, December
  • Bennett , C.H. and Wiesner , S.J. 1992 . Communication via one- and two-particle operators on Einstein–Podolsky–Rosen states . Physical Review Letters , 69 ( 20 ) : 2881 – 2884 .
  • Bernstein , E. and Vazirani , U. 1997 . Quantum complexity theory . Special issue on Quantum Computation of the SIAM Journal on Computing , 26 ( 5 ) : 1411 – 1473 . October. http://arxiv.org/abs/quant-ph/9701001
  • Berthiaume , A. and Brassard , G. 1994 . Oracle quantum computing . Journal of Modern Optics , 41 ( 12 ) : 2521 – 2535 . December
  • Calude , C.S. and Pavlov , B. 2002 . Coins, quantum measurements, and Turing's barrier . Quantum Information Processing , 1 ( 1/2 ) : 107 – 127 . April
  • Deutsch , D. 1985 . Quantum theory, the Church–Turing principle, and the Universal Quantum Computer . Proceedings of the Royal Society of London A , 400 : 97 – 117 .
  • Deutsch , D. and Jozsa , R. 1992 . Rapid solution of problems by quantum computation . Proceedings of the Royal Society of London A , 439 : 553 – 558 .
  • Feynman , R. 1982 . Simulating physics with computers . International Journal of Theoretical Physics , 21 ( 6/7 ) : 467 – 488 .
  • Kieu , T.D. 2003 . Quantum Adiabatic Algorithm for Hilbert's Tenth Problem: I. The Algorithm http://arxiv.org/abs/quant-ph/0310052, October
  • Lenstra , A.K. and Lenstra , H.W. , eds. 1993 . The Development of the Number Field Sieve , New York, NY : Springer-Verlag .
  • Lloyd , S. 2006 . Programming the Universe: A Quantum Computer Scientist Takes on the Cosmos , New York, NY : Knopf .
  • Mattle , K. , Weinfurter , H. , Kwiat , P.G. and Zeilinger , A. 1996 . Dense coding in experimental quantum communication . Physical Review Letters , 76 ( 25 ) : 4656 – 4659 .
  • Nagy , M. and Akl , S.G. 2006 . Quantum measurements and universal computation . International Journal of Unconventional Computing , 2 ( 1 ) : 73 – 88 .
  • Penrose , R. 1989 . The Emperor's New Mind , New York, NY : Oxford University Press .
  • Penrose , R. 1994 . Shadows of the Mind , New York, NY : Oxford University Press .
  • Robinson , S. 2003 . Emerging insights on limitations of quantum computing shape quest for fast algorithms . SIAM News , 36 ( 1 ) January/February
  • Shor , P.W. 1997 . Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer . Special issue on Quantum Computation of the SIAM Journal on Computing , 26 ( 5 ) : 1484 – 1509 . October

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.