Differentiable quantum architecture search
Open accessThe DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
Quantum architecture search (QAS) is the process of automating architecture engineering of quantum circuits. It has been desired to construct a powerful and general QAS platform which can significantly accelerate current efforts to identify quantum advantages of error-prone and depth-limited quantum circuits in the NISQ era. Hereby, we propose a general framework of differentiable quantum architecture search (DQAS), which enables automated designs of quantum circuits in an end-to-end differentiable fashion. We present several examples of circuit design problems to demonstrate the power of DQAS. For instance, unitary operations are decomposed into quantum gates, noisy circuits are re-designed to improve accuracy, and circuit layouts for quantum approximation optimization algorithm are automatically discovered and upgraded for combinatorial optimization problems. These results not only manifest the vast potential of DQAS being an essential tool for the NISQ application developments, but also present an interesting research topic from the theoretical perspective as it draws inspirations from the newly emerging interdisciplinary paradigms of differentiable programming, probabilistic programming, and quantum programming.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
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 · cited 1×
“Several prototypical examples in this category include finding the ground state of complex quantum systems by variational quantum eigensolver (VQE) [2–4], exploring better approximation for NP hard combinatorial optimization problems by quantum approximation optimization algorithms (QAOA) [5–7], and…”
Neural Architecture Search with Reinforcement Learning
Zoph, B., & Le, Q. V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.01578 · Cited by 3,974
DARTS: Differentiable architecture search
Liu, H., Simonyan, K., & Yang, Y. (2018) · arXiv · doi:10.48550/arxiv.1806.09055 · Cited by 3,248
A Practical Guide to Training Restricted Boltzmann Machines
Hinton, G. E. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_32 · Cited by 2,852 · cited 1×
“We stress that more complicated models such as the energy based models [9, 75, 76] and autoregressive models [77–80] may yield better performances under certain settings where explicit correlation between circuit layers is important.”
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
Longformer: The Long-Document Transformer
Beltagy, I., Peters, M. E., & Cohan, A. (2020) · arXiv · doi:10.48550/arxiv.2004.05150 · Cited by 2,281
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Solving the quantum many-body problem with artificial neural networks
Carleo, G., & Troyer, M. (2017) · Science · doi:10.1126/science.aag2302 · Cited by 2,215 · cited 1×
“We stress that more complicated models such as the energy based models [9, 75, 76] and autoregressive models [77–80] may yield better performances under certain settings where explicit correlation between circuit layers is important.”
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621 · cited 1×
“Several prototypical examples in this category include finding the ground state of complex quantum systems by variational quantum eigensolver (VQE) [2–4], exploring better approximation for NP hard combinatorial optimization problems by quantum approximation optimization algorithms (QAOA) [5–7], and…”
Research works printed but not linked: 25
- Benedetti, 2019, Parameterized quantum circuits as machine learning models, Quantum Sci. Technol., 4, 10.1088/2058-9565/ab4eb5 · DOI · Paper page
- Li, 2017, Approximate quantum adders with genetic algorithms: an IBM quantum experience, Quantum Meas. Quantum Metrol., 4, 1, 10.1515/qmetro-2017-0001 · DOI · Paper page
- Fösel, 2018, Reinforcement learning with neural networks for quantum feedback, Phys. Rev. X, 8, 31084, 10.1103/physrevx.8.031084 · DOI · Paper page
- Lin, 2019, Application of Pontryagin’s minimum principle to Grover’s quantum search problem, Phys. Rev. A, 100, 10.1103/physreva.100.022327 · DOI
- Cincio, 2021, Machine learning of noise-resilient quantum circuits, PRX Quantum, 2, 10.1103/prxquantum.2.010324 · DOI
- Huang, 2018, GNAS, 2049, 10.1145/3240508.3240588 · DOI
- Stanley, 2019, Designing neural networks through neuroevolution, Nat. Mach. Intell., 1, 24, 10.1038/s42256-018-0006-z · DOI · Paper page
- Xie, 2017, Genetic CNN, 1388, 10.1109/iccv.2017.154 · DOI · Paper page
- Cai, 2018, Efficient architecture search by network transformation, 2787, 10.1609/aaai.v32i1.11709 · DOI · Paper page
- Zoph, 2018, Learning transferable architectures for scalable image recognition, 8697, 10.1109/cvpr.2018.00907 · DOI · Paper page
- Las Heras, 2016, Genetic algorithms for digital quantum simulations, Phys. Rev. Lett., 116, 10.1103/physrevlett.116.230504 · DOI
- Niu, 2019, Universal quantum control through deep reinforcement learning, npj Quantum Inf., 5, 33, 10.1038/s41534-019-0141-3 · DOI · Paper page
- Chen, 2019, Progressive differentiable architecture search: bridging the depth gap between search and evaluation, 1294, 10.1109/iccv.2019.00138 · DOI · Paper page
- Dong, 2019, Searching for a robust neural architecture in four GPU hours, 1761, 10.1109/cvpr.2019.00186 · DOI · Paper page
- Hu, 2020, DSNAS: direct neural architecture search without parameter retraining, 10.1109/CVPR42600.2020.01210 · DOI
- Mohamed, 2020, Monte Carlo gradient estimation in machine learning, J. Mach. Learn. Res., 21, 1
- Albash, 2019, Role of nonstoquastic catalysts in quantum adiabatic optimization, Phys. Rev. A, 99, 10.1103/physreva.99.042334 · DOI
- Sels, 2017, Minimizing irreversible losses in quantum systems by local counterdiabatic driving, Proc. Natl Acad. Sci. USA, 114, E3909, 10.1073/pnas.1619826114 · DOI · Paper page
- Hartmann, 2019, Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing, New J. Phys., 21, 10.1088/1367-2630/ab14a0 · DOI
- Nakata, 2017, Unitary two-designs from random X- and Z-diagonal unitaries, J. Math. Phys., 58, 10.1063/1.4983266 · DOI
- Kleijnen, 1996, Optimization and sensitivity analysis of computer simulation models by the score function method, Eur. J. Oper. Res., 88, 413, 10.1016/0377-2217(95)00107-7 · DOI
- Williams, 1992, Simple statistical gradient-following algorithms for connectionist reinforcement learning, Mach. Learn., 8, 229, 10.1007/bf00992696 · DOI · Paper page
- Wu, 2019, Solving statistical mechanics using variational autoregressive networks, Phys. Rev. Lett., 122, 10.1103/physrevlett.122.080602 · DOI · Paper page
- Sharir, 2020, Deep autoregressive models for the efficient variational simulation of many-body quantum systems, Phys. Rev. Lett., 124, 10.1103/physrevlett.124.020503 · DOI · Paper page
- Wallman, 2016, Noise tailoring for scalable quantum computation via randomized compiling, Phys. Rev. A, 94, 10.1103/physreva.94.052325 · DOI · Paper page
Cited by
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Barren plateaus in variational quantum computing
Larocca, M., Thanasilp, S., Wang, S., Sharma, K., Biamonte, J., Coles, P. J., Cincio, L., McClean, J. R., Holmes, Z., & Cerezo, M. (2025) · Nature Reviews Physics · doi:10.1038/s42254-025-00813-9 · Cited by 257
Solving nonlinear differential equations with differentiable quantum circuits
Kyriienko, O., Paine, A. E., & Elfving, V. E. (2021) · Physical Review A · doi:10.1103/physreva.103.052416 · Cited by 185
Solving nonlinear differential equations with differentiable quantum circuits
Kyriienko, O., Paine, A. E., & Elfving, V. E. (2020) · arXiv · doi:10.48550/arxiv.2011.10395 · Cited by 185
Neural predictor based quantum architecture search
Zhang, S.-X., Hsieh, C.-Y., Zhang, S., & Yao, H. (2021) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/ac28dd · Cited by 88
“Therefore, a systematic approach to search for optimal circuit ansatz is desired, and we denote such workflow as “quantum architecture search” [39].”
MethodInfluentialSelf-citation
Metadata
- Authors
- Zhang, S.-X., Hsieh, C.-Y., Zhang, S., & Yao, H.
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2022-08-24
- Volume
- 7
- Issue
- 4
- Pages
- 045023
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W3092829287
- Cited by
- 158
- References
- 31
- FWCI
- 9.77
- Type
- journal article
- Language
- en
- Open access
- bronze
- Licence
- publishingsupport.iopscience.iop.org/iop-standard/v1 (vor)
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- Funders
- NSFC (11825404)
- Strategic Priority Research Program of Chinese Academy of Sciences (XDB28000000)
- MOSTC (2016YFA0301001)
- Beijing Natural Science Foundation (Z180010)
- Beijing Municipal Science and Technology Commission (Z181100004218001)
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Differentiable quantum architecture search. https://app.cochat.ai/papers/10.1088/2058-9565/ac87cd
- The paper
- Zhang, S.-X., Hsieh, C.-Y., Zhang, S., & Yao, H. (2022). Differentiable quantum architecture search. Quantum Science and Technology. https://doi.org/10.1088/2058-9565/ac87cd
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.