Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
Open accessThe DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
The quantum alternating operator ansatz (QAOA) is a prominent example of variational quantum algorithms.We propose a generalized QAOA called CD-QAOA, which is inspired by the counterdiabatic driving procedure, designed for quantum many-body systems and optimized using a reinforcement learning (RL) approach.The resulting hybrid control algorithm proves versatile in preparing the ground state of quantum-chaotic many-body spin chains by minimizing the energy.We show that using terms occurring in the adiabatic gauge potential as generators of additional control unitaries, it is possible to achieve fast highfidelity many-body control away from the adiabatic regime.While each unitary retains the conventional QAOA-intrinsic continuous control degree of freedom such as the time duration, we consider the order of the multiple available unitaries appearing in the control sequence as an additional discrete optimization problem.Endowing the policy gradient algorithm with an autoregressive deep learning architecture to capture causality, we train the RL agent to construct optimal sequences of unitaries.The algorithm has no access to the quantum state, and we find that the protocol learned on small systems may generalize to larger systems.By scanning a range of protocol durations, we present numerical evidence for a finite quantum speed limit in the nonintegrable mixed-field spin-1=2 Ising and Lipkin-Meshkov-Glick models, and for the suitability to prepare ground states of the spin-1 Heisenberg chain in the long-range and topologically ordered parameter regimes.This work paves the way to incorporate recent success from deep learning for the purpose of quantum many-body control.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Many-body physics with ultracold gases
Bloch, I., Dalibard, J., & Zwerger, W. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.885 · Cited by 8,114
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Soft actor-critic Off-policy maximum entropy deep reinforcement learning with a stochastic actor
Haarnoja, T., Zhou, A., Abbeel, P., & Levine, S. (2018) · arXiv · doi:10.48550/arxiv.1801.01290 · Cited by 5,594
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
The nitrogen-vacancy colour centre in diamond
Doherty, M. W., Manson, N. B., Delaney, P., Jelezko, F., Wrachtrup, J., & Hollenberg, L. C. L. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.02.001 · Cited by 2,866
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
Lewenstein, M., Sanpera, A., Ahufinger, V., Damski, B., Sen(De), A., & Sen, U. (2007) · Advances in Physics · doi:10.1080/00018730701223200 · Cited by 2,104
Khaneja, N., Reiss, T., Kehlet, C., Schulte-Herbrüggen, T., & Glaser, S. J. (2005) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2004.11.004 · Cited by 1,854
Quantum simulations with trapped ions
Blatt, R., & Roos, C. F. (2012) · Nature Physics · doi:10.1038/nphys2252 · Cited by 1,629
Entanglement spectrum of a topological phase in one dimension
Pollmann, F., Turner, A. M., Berg, E., & Oshikawa, M. (2010) · Physical Review B · doi:10.1103/physrevb.81.064439 · Cited by 1,341
Quantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154
Cost function dependent barren plateaus in shallow parametrized quantum circuits
Cerezo, M., Sone, A., Volkoff, T., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-21728-w · Cited by 1,047
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
Scaling the Ion Trap Quantum Processor
Monroe, C., & Kim, J. (2013) · Science · doi:10.1126/science.1231298 · Cited by 786
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
An initialization strategy for addressing barren plateaus in parametrized quantum circuits
Grant, E., Wossnig, L., Ostaszewski, M., & Benedetti, M. (2019) · Quantum · doi:10.22331/q-2019-12-09-214 · Cited by 406
Quantum optimization with a novel Gibbs objective function and ansatz architecture search
Li, L., Fan, M., Coram, M., Riley, P., & Leichenauer, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023074 · Cited by 98
Reinforcement-learning-assisted quantum optimization
Wauters, M. M., Panizon, E., Mbeng, G. B., & Santoro, G. E. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033446 · Cited by 80
Characterizing the loss landscape of variational quantum circuits
Huembeli, P., & Dauphin, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abdbc9 · Cited by 71
Reinforcement-Learning-Based Variational Quantum Circuits Optimization for Combinatorial Problems
Khairy, S., Shaydulin, R., Cincio, L., Alexeev, Y., & Balaprakash, P. (2019) · arXiv · doi:10.48550/arxiv.1911.04574 · Cited by 21
Garcia-Saez, A., & Riu, J. (2019) · arXiv · doi:10.48550/arxiv.1911.09682 · Cited by 13
Cited by
Artificial intelligence and machine learning for quantum technologies
Krenn, M., Landgraf, J., Foesel, T., & Marquardt, F. (2023) · Physical Review A · doi:10.1103/physreva.107.010101 · Cited by 162
Quantum Optimization via Four-Body Rydberg Gates
Dlaska, C., Ender, K., Mbeng, G. B., Kruckenhauser, A., Lechner, W., & van Bijnen, R. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.120503 · Cited by 51
Parameter Setting in Quantum Approximate Optimization of Weighted Problems
Sureshbabu, S. H., Herman, D., Shaydulin, R., Basso, J., Chakrabarti, S., Sun, Y., & Pistoia, M. (2024) · Quantum · doi:10.22331/q-2024-01-18-1231 · Cited by 41
Metadata
- Authors
- Yao, J., Lin, L., & Bukov, M.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2021-09-30
- Volume
- 11
- Issue
- 3
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W3092321087
- Cited by
- 76
- References
- 22
- FWCI
- 4.59
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.