A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SIAM Journal on Computing
On the Power of Quantum Computation
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum computation and quantum information
Quantum computation and quantum information
Multilinear formulas and skepticism of quantum computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum computing without entanglement
Theoretical Computer Science
Quantum Information & Computation
Speed-up and entanglement in quantum searching
Quantum Information & Computation
A study of quantum correlations in open quantum systems
Quantum Information & Computation
Different dynamics of classical and quantum correlations under decoherence
Quantum Information Processing
The monogamy relation and quantum phase transition in one-dimensional anisotropic XXZ model
Quantum Information Processing
| Hi-index | 0.00 |
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.