- Letter
- Open Access
Efficient quantum algorithm for solving structured problems via multistep quantum computation
Phys. Rev. Research 5, L012004 – Published 17 January, 2023
DOI: https://doi.org/10.1103/PhysRevResearch.5.L012004
Abstract
In classical computation, a problem can be solved in multiple steps where the calculated results of each step can be copied and used repeatedly. However, in quantum computation, it is difficult to realize a similar multistep computation process because the no-cloning theorem forbids making copies of an unknown quantum state perfectly. We find a method based on a quantum resonant transition to protect and reuse an unknown quantum state that encodes the calculated results of an intermediate step without copying it, and present a quantum algorithm that solves a problem via multistep quantum computation. We demonstrate that this algorithm can solve a type of structured search problems efficiently.
Physics Subject Headings (PhySH)
Article Text
Supplemental Material
References (22)
- A. Y. Kitaev, Quantum measurements and the Abelian stabilizer problem, arXiv:quant-ph/9511026.
- D. S. Abrams and S. Lloyd, Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors, Phys. Rev. Lett. 83, 5162 (1999).
- D. Poulin and P. Wocjan, Preparing Ground States of Quantum Many-Body Systems on a Quantum Computer, Phys. Rev. Lett. 102, 130503 (2009).
- E. Farhi, J. Goldstone, and S. Gutmann, A numerical study of the performance of a quantum adiabatic evolution algorithm for satisfiability, arXiv:quant-ph/0007071.
- A. M. Childs, E. Deotto, E. Farhi, J. Goldstone, S. Gutmann, and A. J. Landahl, Quantum search by measurement, Phys. Rev. A 66, 032314 (2002).
- D. Poulin, A. Y. Kitaev, D. S. Steiger, M. B. Hastings, and M. Troyer, Quantum Algorithm for Spectral Measurement with a Lower Gate Count, Phys. Rev. Lett. 121, 010501 (2018).
- N. J. Cerf, L. K. Grover, and C. P. Williams, Nested quantum search and structured problems, Phys. Rev. A 61, 032303 (2000).
- J. Roland and N. J. Cerf, Adiabatic quantum search algorithm for structured problems, Phys. Rev. A 68, 062312 (2003).
- W. K. Wootters and W. H. Zurek, A single quantum cannot be cloned, Nature (London) 299, 802 (1982).
- D. Dieks, Communication by EPR devices, Phys. Lett. A 92, 271 (1982).
- H. Wang, Quantum algorithm for obtaining the eigenstates of a physical system, Phys. Rev. A 93, 052334 (2016).
- Z. Li, X. Liu, H. Wang, S. Ashhab, J. Cui, H. Chen, X. Peng, and J. Du, Quantum Simulation of Resonant Transitions for Solving the Eigenproblem of an Effective Water Hamiltonian, Phys. Rev. Lett. 122, 090504 (2019).
- D. Aharanov and A. Ta-Shma, Adiabatic quantum state generation and statistical zero knowledge, arXiv:quant-ph/0301023; Adiabatic quantum state generation, SIAM J. Comput. 37, 47 (2007).
- See Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevResearch.5.L012004 for The information of error analysis of the algorithm, application of the algorithm for solving the Deutsch-Jozsa problem and the unstructured search problem, application of Grover's algorithm and the quantum adiabatic algorithm for solving the search problem with a special structure, and a summary of the performance of different algorithms for solving the search problem with a special structure.
- G. H. Low and I. L. Chuang, Optimal Hamiltonian Simulation by Quantum Signal Processing, Phys. Rev. Lett. 118, 010501 (2017).
- G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, Quantum 3, 163 (2019).
- T. Monz, D. Nigg, E. A. Martinez, M. F. Brandl, P. Schindler, R. Rines, S. X. Wang, I. L. Chuang, and R. Blatt, Realization of a scalable Shor algorithm, Science 351, 1068 (2016).
- H. Wang, Quantum algorithm for solving the hidden subgroup problems, arXiv:2204.03295.
- L. K. Grover, Quantum Mechanics Helps in Searching for a Needle in a Haystack, Phys. Rev. Lett. 79, 325 (1997).
- J. Roland and N. J. Cerf, Quantum search by local adiabatic evolution, Phys. Rev. A 65, 042308 (2002).
- T. Albash and D. A. Lidar, Adiabatic quantum computation, Rev. Mod. Phys. 90, 015002 (2018).
- M. B. Hastings, The power of adiabatic quantum computation with no sign problem, Quantum 5, 597 (2021), and references therein.