Quantum Advantage without Entanglement

Details Quantum Advantage without Entanglement Quantum Advantage without Entanglement

2005-11-30

arxiv.org/abs/quant-ph/0511272v1

Quantum Information and Computation 6(7), 606--615 (2006)

Physics

Quantum Physics

10 pages

Scientific paper

10.1117/12.617175

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.

Affiliated with

Also associated with

No associations

Rating

Quantum Advantage without Entanglement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Advantage without Entanglement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Advantage without Entanglement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-430684