Entanglement in the Grover search algorithm
Authors:
- Yiyuan FangYFYiyuan Fang
- Dagomir KaszlikowskiDKDagomir Kaszlikowski
- Chunming ChinCCChunming Chin
- Ken TayKTKen Tay
- L.C. KwekL.C. Kwek
- C.H. OhCOC.H. Oh
- 1 October 2005
- journal article
- research article
- Published by Elsevier in Physics Letters A
- Vol. 345 (4-6) , 265-272
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Geometric measure of entanglement and applications to bipartite and multipartite quantum statesPhysical Review A, 2003
- Grover’s quantum search algorithm for an arbitrary initial mixed statePhysical Review A, 2002
- Schmidt measure as a tool for quantifying multiparticle entanglementPhysical Review A, 2001
- Grover’s quantum searching algorithm is optimalPhysical Review A, 1999
- Tight Bounds on Quantum SearchingFortschritte der Physik, 1998
- Quantum Computers Can Search Rapidly by Using Almost Any TransformationPhysical Review Letters, 1998
- Quantum Computers Can Search Arbitrarily Large Databases by a Single QueryPhysical Review Letters, 1997
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997