Quantum advantage without entanglement

Dan Kenigsberg; Tal Mor; Gil Ratsaby

doi:10.1117/12.617175

14 September 2005 Quantum advantage without entanglement

Dan Kenigsberg, Tal Mor, Gil Ratsaby

Proceedings Volume 5893, Quantum Communications and Quantum Imaging III; 58930N (2005) https://doi.org/10.1117/12.617175
Event: Optics and Photonics 2005, 2005, San Diego, California, United States

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.

Citation Download Citation

Dan Kenigsberg, Tal Mor, and Gil Ratsaby "Quantum advantage without entanglement", Proc. SPIE 5893, Quantum Communications and Quantum Imaging III, 58930N (14 September 2005); https://doi.org/10.1117/12.617175

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available