Amplitude Amplification for Operator Identification and Randomized Classes
July 2018
Pages 579 - 591
Abstract
Amplitude amplification (AA) is tool of choice for quantum algorithm designers to increase the success probability of query algorithms that reads its input in the form of oracle gates. Geometrically speaking, the technique can be understood as rotation in a specific two-dimensional space. We study and use a generalized form of this rotation operator to design algorithms in a geometric manner. Specifically, we apply AA to algorithms that take their input in the form of input states and in which rotations with different angles and directions are used in a unified manner. We show that AA can be used to sequentially discriminate between two unitary operators, both without error and with bounded-error, in an asymptotically optimal manner. We also show how to reduce error probability in one and two-sided bounded error algorithms more efficiently than the usual parallel repetitions technique; in particular, errors can be completely eliminated from the exact error algorithms.
References
[1]
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th STOC (1996)
[2]
Magniez F, Santha M, and Szegedy M Quantum algorithms for the triangle problem SIAM J. Comput. 2007 37 2 413-424
[3]
Ozols M, Roetteler M, and Roland J Quantum rejection sampling ACM Trans. Comput. Theory 2013 5 3 1-33
[4]
Kobayashi, H., Matsumoto, K., Tani, S.: Simpler exact leader election via quantum reduction. Chic. J. Theor. Comput. Sci. 2014(10) (2014)
[5]
Berry, D.W., Childs, A.M., Cleve, R., Kothari, R., Somma, R.D.: Exponential improvement in precision for simulating sparse Hamiltonians. In: Proceedings of the 46th STOC (2014)
[6]
Brassard G, Høyer P, Mosca M, and Tapp A Quantum amplitude amplication and estimation Contemp. Math. 2002 305 53-74
[7]
Yoder TJ, Low GH, and Chuang ILFixed-point quantum search with an optimal number of queriesPhys. Rev. Lett.2014113210501https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.113.210501
[8]
Lipton RJ and Regan KW Quantum Algorithms via Linear Algebra: A Primer 2014 Cambridge The MIT Press
[9]
Kawachi A, Kawano K, Le Gall F, and Tamaki S Cao Y and Chen J Quantum query complexity of unitary operator discrimination Computing and Combinatorics 2017 Cham Springer 309-320
[10]
Bera Debajyoti Detection and Diagnosis of Single Faults in Quantum Circuits IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2018 37 3 587-600
[11]
Acin A Statistical distinguishability between unitary operations Phys. Rev. Lett. 2001 87 17 177901
[12]
Bennett CH, Bernstein E, Brassard G, and Vazirani U Strengths and weaknesses of quantum computing SIAM J. Comput. 1997 26 5 1510-1523
[13]
Biham E, Biham O, Biron D, Grassl M, and Lidar DA Grover’s quantum search algorithm for an arbitrary initial amplitude distribution Phys. Rev. A 1999 60 4 2742
[14]
Biham E and Kenigsberg D Grover’s quantum search algorithm for an arbitrary initial mixed state Phys. Rev. A 2002 66 6 062301
[15]
Høyer P Arbitrary phases in quantum amplitude amplification Phys. Rev. A 2000 62 5 052304
[16]
D’Ariano GM, Presti PL, and Paris MG Using entanglement improves the precision of quantum measurements Phys. Rev. Lett. 2001 87 27 270404
[17]
Duan R, Feng Y, and Ying M Entanglement is not necessary for perfect discrimination between unitary operations Phys. Rev. Lett. 2007 98 10 100503
[18]
Bera, D.: Amplitude amplification for operator identification and randomized classes. Technical report TR14-151. Electronic Colloquium on Computational Complexity (2018)
[19]
Bera D, Green F, and Homer S Small depth quantum circuits ACM SIGACT News 2007 38 2 35-50
[20]
Høyer P and de Wolf R Alt H and Ferreira A Improved quantum communication complexity bounds for disjointness and equality STACS 2002 2002 Heidelberg Springer 299-310
[21]
Buhrman, H., de Wolf, R.: Communication complexity lower bounds by polynomials. In: Proceedings of the 16th CCC (2001)
Recommendations
Quantum discord amplification of fermionic systems in an accelerated frame
Quantum discord of fermionic systems in the relativistic regime, that is, beyond the single-mode approximation (SMA) is investigated. It is shown that quantum discord is amplified for the fermionic system in non-inertial frames irrespective of the ...
Heralded noiseless amplification for single-photon entangled state with polarization feature
Heralded noiseless amplification is a promising method to overcome the transmission photon loss in practical noisy quantum channel and can effectively lengthen the quantum communication distance. Single-photon entanglement is an important resource in ...
Spectral Gap Amplification
Many problems can be solved by preparing a specific eigenstate of some Hamiltonian $H$. The generic cost of quantum algorithms for these problems is determined by the inverse spectral gap of $H$ for that eigenstate and the cost of evolving with $H$ for some ...
Comments
Information & Contributors
Information
Published In
Jul 2018
783 pages
© Springer International Publishing AG, part of Springer Nature 2018.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 02 July 2018
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in