Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/spie/quantum-advantage-without-entanglement-ium3xM0W0t
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- SPIE
- Copyright
- Copyright © 2005 COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
- ISSN
- 0277-786X
- eISSN
- 1996-756X
- DOI
- 10.1117/12.617175
- Publisher site
- See Article on Publisher Site
Abstract
We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm still has an advantage over the classical ones. We further show that this subproblem is of greater significance, by proving that it contains all the Boolean functions whose quantum phase-oracle is non-entangling. For Simon's and Grover's algorithms we provide simple proofs that no non-trivial subproblems can be solved by these algorithms without entanglement.
Journal
Proceedings of SPIE – SPIE
Published: Aug 18, 2005