A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Stabilization of Quantum Computations by Symmetrization
SIAM Journal on Computing
Introduction to Algorithms
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
An Introduction to Quantum Computing
An Introduction to Quantum Computing
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Logical reversibility of computation
IBM Journal of Research and Development
Quantum Information Processing
Hi-index | 0.02 |
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speed-up to be obtained in search procedures. Classical search procedures for an N element database require at most O(N) time complexity. Grover's algorithm is able to find a solution with high probability in $${O(\sqrt{N})}$$ time through an amplitude amplification scheme. In this work we draw elements from both classical and quantum computation to develop an alternative search proposal based on quantum entanglement detection schemes. In 2002, Horodecki and Ekert proposed an efficient method for direct detection of quantum entanglement. Our proposition to quantum search combines quantum entanglement detection alongside entanglement inducing operators. The quantum search algorithm relies on measuring a quantum superposition after having applied a unitary evolution. We deviate from the standard method by focusing on fine-tuning a unitary operator in order to infer the solution with certainty. Our proposal sacrifices space for speed and depends on the mathematical properties of linear positive maps 驴 which have not been operationally characterized. Whether such a 驴 can be easily determined remains an open question.