CoChat

Differentiable quantum architecture search

Open access
Zhang, Shi-Xin, Hsieh, Chang-Yu, Zhang, Shengyu, Yao, Hong · 2022 · Quantum Science and Technology
Cited by 158

The DOI matches its Crossref record; 34 of the 34 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/2058-9565/ac87cd

Cites

34 of 34 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 23

  1. Benedetti, 2019, Parameterized quantum circuits as machine learning models, Quantum Sci. Technol., 4, 10.1088/2058-9565/ab4eb5 · DOI · Paper page
  2. 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
  3. Fösel, 2018, Reinforcement learning with neural networks for quantum feedback, Phys. Rev. X, 8, 31084, 10.1103/physrevx.8.031084 · DOI · Paper page
  4. Lin, 2019, Application of Pontryagin’s minimum principle to Grover’s quantum search problem, Phys. Rev. A, 100, 10.1103/physreva.100.022327 · DOI
  5. Cincio, 2021, Machine learning of noise-resilient quantum circuits, PRX Quantum, 2, 10.1103/prxquantum.2.010324 · DOI · Paper page
  6. Huang, 2018, GNAS, 2049, 10.1145/3240508.3240588 · DOI
  7. Stanley, 2019, Designing neural networks through neuroevolution, Nat. Mach. Intell., 1, 24, 10.1038/s42256-018-0006-z · DOI · Paper page
  8. Xie, 2017, Genetic CNN, 1388, 10.1109/iccv.2017.154 · DOI · Paper page
  9. Cai, 2018, Efficient architecture search by network transformation, 2787, 10.1609/aaai.v32i1.11709 · DOI · Paper page
  10. Las Heras, 2016, Genetic algorithms for digital quantum simulations, Phys. Rev. Lett., 116, 10.1103/physrevlett.116.230504 · DOI · Paper page
  11. Niu, 2019, Universal quantum control through deep reinforcement learning, npj Quantum Inf., 5, 33, 10.1038/s41534-019-0141-3 · DOI · Paper page
  12. Chen, 2019, Progressive differentiable architecture search: bridging the depth gap between search and evaluation, 1294, 10.1109/iccv.2019.00138 · DOI · Paper page
  13. Dong, 2019, Searching for a robust neural architecture in four GPU hours, 1761, 10.1109/cvpr.2019.00186 · DOI · Paper page
  14. Hu, 2020, DSNAS: direct neural architecture search without parameter retraining, 10.1109/CVPR42600.2020.01210 · DOI · Paper page
  15. Mohamed, 2020, Monte Carlo gradient estimation in machine learning, J. Mach. Learn. Res., 21, 1
  16. Albash, 2019, Role of nonstoquastic catalysts in quantum adiabatic optimization, Phys. Rev. A, 99, 10.1103/physreva.99.042334 · DOI
  17. 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
  18. Hartmann, 2019, Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing, New J. Phys., 21, 10.1088/1367-2630/ab14a0 · DOI
  19. Nakata, 2017, Unitary two-designs from random X- and Z-diagonal unitaries, J. Math. Phys., 58, 10.1063/1.4983266 · DOI
  20. 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
  21. Wu, 2019, Solving statistical mechanics using variational autoregressive networks, Phys. Rev. Lett., 122, 10.1103/physrevlett.122.080602 · DOI · Paper page
  22. 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
  23. 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

See all 158

Metadata

Authors
Zhang, S.-X., Hsieh, C.-Y., Zhang, S., & Yao, H.
Venue
Quantum Science and Technology
Published
2022-08-24
Volume
7
Issue
4
Pages
045023
ISSN
2058-9565 (ISSN-L)
OpenAlex
W3092829287
Cited by
158
References
34
FWCI
9.77
Type
journal article
Language
en
Open access
bronze
Licence
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

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.