Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/optimality-proofs-of-quantum-weight-decision-algorithms-qMvYWcDgDk
References (22)
-
L.K. Grover (2005)
Fixed-point quantum searchPhys. Rev. Lett., 95
-
J.-Z. Dua, S.-J. Qin, Q.-Y. Wen, F.-C. Zhu (2007)
Threshold quantum cryptograph based on Grover’s algorithmPhys. Lett. A, 363
-
R. Špalek, M. Szegedy (2006)
All quantum adversary methods are equivalentTheory Comput., 2
-
D. Deutsch, R. Jozsa (1992)
Rapid solution of problems by quantum computationProc. R. Soc. A, 439
-
P.W. Shor (1997)
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computerSIAM J. Comput., 26
-
L.K. Grover (1997)
Quantum mechanics helps in searching for a needle in a HaystackPhys. Rev. Lett., 79
-
D. Li, X. Li, H. Huang, X. Li (2007)
Fixed-point quantum search for different phase shiftsPhys. Lett. A, 362
-
A. Ambainis (2002)
Quantum lower bounds by quantum argumentsJ .Comput. Syst. Sci., 64
-
G.-L. Long, X. Lia, Y. Sune (2002)
Phase matching condition for quantum search with a generalized initial statePhys. Lett. A, 294
-
Y. Shimoni, O. Biham (2007)
Groverian entanglement measure of pure quantum states with arbitrary partitionsPhys. Rev. A, 75
-
G.-L. Long (2001)
Grover algorithm with zero theoretical failure ratePhys. Rev. A, 64
-
O. Biham, D. Shapira, Y. Shimoni (2003)
Analysis of Grovers quantum search algorithm as a dynamical systemPhys. Rev. A, 68
-
W.P. Baritompa, D.W. Bulger, G.R. Wood (2005)
Quantum algorithm applied to global optimizationSIAM J. Optim., 15
-
V. Protopopescu, J. Barhen (2002)
Solving a class of continuous global optimization problems using quantum algorithmsPhys. Lett. A, 296
-
C. Zalka (1999)
Grovers quantum searching algorithm is optimalPhys. Rev. A, 60
-
V.E. Korepin (2005)
Optimization of partial searchJ. Phys. A Math. General, 38
-
D.E. Deutsch (1985)
Quantum theory, the Church. Turing principle and the universal quantum computerProc. R. Soc. A, 400
-
P. Høyer (2000)
Arbitary phases in quantum amplitude amplificationPhys. Rev. A, 62
-
B.-S. Choi, V.E. Korepin (2007)
Quantum partial search of a database with several target itemsQuantum Inf. Process., 6
-
Y. Fang, D. Kaszlikowski, C. Chin, K. Tay, L.C. Kwek, C.H. Oh (2005)
Entanglement in the Grover search algorithmPhys. Lett. A, 345
-
V.E. Korepin, L.K. Grover (2006)
Simple algorithm for partial quantum searchQuantum Inf. Process., 5
-
S.L. Braunstein, B.-S. Choi, S. Ghosh, S. Maitra (2007)
Exact quantum algorithm to distinguish Boolean functions of different weightsJ. Phys. A Math. Theory, 40
- Publisher
- Springer Journals
- Copyright
- Copyright © 2011 by Springer Science+Business Media, LLC
- Subject
- Physics; Computer Science, general; Theoretical, Mathematical and Computational Physics; Quantum Physics; Mathematics, general; Physics, general
- ISSN
- 1570-0755
- eISSN
- 1573-1332
- DOI
- 10.1007/s11128-011-0233-2
- Publisher site
- See Article on Publisher Site
Abstract
Recently two quantum algorithms have been proposed for the symmetric and asymmetric weight decision problems. Although they show the quadratic speedup over the classical approaches, their optimality has not been proven formally. In this article, we prove their optimality in a formal fashion.
Journal
Quantum Information Processing – Springer Journals
Published: Mar 11, 2011