Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor
Open accessThe DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
We have developed a quantum annealing processor, based on an array of tunable coupled rf-SQUID flux qubits, fabricated in a superconducting integrated circuit process. Implementing this type of processor at a scale of 512 qubits and 1472 programmable interqubit couplers and operating at ~ 20 mK has required attention to a number of considerations that one may ignore at the smaller scale of a few dozen or so devices. Here, we discuss some of these considerations, and the delicate balance necessary for the construction of a practical processor that respects the demanding physical requirements imposed by a quantum algorithm. In particular, we will review some of the design tradeoffs at play in the floor planning of the physical layout, driven by the desire to have an algorithmically useful set of interqubit couplers, and the simultaneous need to embed programmable control circuitry into the processor fabric. In this context, we have developed a new ultralow-power embedded superconducting digital-to-analog flux converter (DAC) used to program the processor with zero static power dissipation, optimized to achieve maximum flux storage density per unit area. The 512 single-stage, 3520 two-stage, and 512 three-stage flux DACs are controlled with an XYZ addressing scheme requiring 56 wires. Our estimate of on-chip dissipated energy for worst-case reprogramming of the whole processor is ~ 65 fJ. Several chips based on this architecture have been fabricated and operated successfully at our facility, as well as two outside facilities (see, for example, the recent reporting by Jones).
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
Likharev, K. K., & Semenov, V. K. (1991) · IEEE Transactions on Applied Superconductivity · doi:10.1109/77.80745 · Cited by 2,123
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 1×
“The authors have previously presented the architecture, design, and operation of an SFQbased system for controlling [3] and reading out [4] a quantum annealing processor based on flux qubits [1], [5] at the core of D-Wave One system.”
BackgroundSelf-citationOn the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810 · cited 1×
“The authors, as well as a number of other researchers, have gained some experience using this first generation processor [6]–[9].”
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Choi, V. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0082-9 · Cited by 410
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor
Harris, R., Johnson, M. W., Lanting, T., Berkley, A. J., Johansson, J., Bunyk, P., Tolkacheva, E., Ladizinsky, E., Ladizinsky, N., Oh, T., et al. (2010) · Physical Review B · doi:10.1103/physrevb.82.024511 · Cited by 273
Self-citationExperimental demonstration of a robust and scalable flux qubit
Harris, R., Johansson, J., Berkley, A. J., Johnson, M. W., Lanting, T., Han, S., Bunyk, P., Ladizinsky, E., Oh, T., Perminov, I., et al. (2010) · Physical Review B · doi:10.1103/physrevb.81.134510 · Cited by 177
Self-citationA scalable control system for a superconducting adiabatic quantum optimization processor
Johnson, M. W., Bunyk, P., Maibaum, F., Tolkacheva, E., Berkley, A. J., Chapple, E. M., Harris, R., Johansson, J., Lanting, T., Perminov, I., et al. (2010) · Superconductor Science and Technology · doi:10.1088/0953-2048/23/6/065004 · Cited by 162
Self-citationSign- and Magnitude-Tunable Coupler for Superconducting Flux Qubits
Harris, R., Berkley, A. J., Johnson, M. W., Bunyk, P., Govorkov, S., Thom, M. C., Uchaikin, S., Wilson, A. B., Chung, J., Holtham, E., et al. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.177001 · Cited by 128
Self-citationA scalable readout system for a superconducting adiabatic quantum optimization system
Berkley, A. J., Johnson, M. W., Bunyk, P., Harris, R., Johansson, J., Lanting, T., Ladizinsky, E., Tolkacheva, E., Amin, M. H. S., & Rose, G. (2010) · Superconductor Science and Technology · doi:10.1088/0953-2048/23/10/105014 · Cited by 110
Self-citation
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
A fully programmable 100-spin coherent Ising machine with all-to-all connections
McMahon, P. L., Marandi, A., Haribara, Y., Hamerly, R., Langrock, C., Tamate, S., Inagaki, T., Takesue, H., Utsunomiya, S., Aihara, K., et al. (2016) · Science · doi:10.1126/science.aah5178 · Cited by 702
Perspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Observation of topological phenomena in a programmable lattice of 1,800 qubits
King, A. D., Carrasquilla, J., Raymond, J., Ozfidan, I., Andriyash, E., Berkley, A., Reis, M., Lanting, T., Harris, R., Altomare, F., et al. (2018) · Nature · doi:10.1038/s41586-018-0410-x · Cited by 323
Self-citationPhase transitions in a programmable quantum spin glass simulator
Harris, R., Sato, Y., Berkley, A. J., Reis, M., Altomare, F., Amin, M. H., Boothby, K., Bunyk, P., Deng, C., Enderud, C., et al. (2018) · Science · doi:10.1126/science.aat2025 · Cited by 259
Self-citationCoherent Ising machines—optical neural networks operating at the quantum limit
Yamamoto, Y., Aihara, K., Leleu, T., Kawarabayashi, K.-I., Kako, S., Fejer, M., Inoue, K., & Takesue, H. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0048-9 · Cited by 258
Quantum Optimization of Fully Connected Spin Glasses
Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.031040 · Cited by 209
“One very recent development that boosted scientific activity in this field has been the commercialization of D-Wave TwoTM optimizers, which implement the annealing approach by means of a solid-state architecture consisting of hundreds of interlaced superconducting flux qubits [8].”
MethodLi, R. Y., Di Felice, R., Rohs, R., & Lidar, D. A. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0060-8 · Cited by 202
“QA is the only paradigm of quantum computation that currently offers physical implementations of a non-trivial size, namely the D-Wave processors [22–24].”
BackgroundDemonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
Albash, T., & Lidar, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031016 · Cited by 238
“The σi and σi are the Pauli matrices acting on superconducting flux qubits that occupy the vertices V of a Chimera hardware graph G with edge set E [43,44] and the local fields hi and couplings Jij are programmable analog parameters.”
BackgroundMethodBenchmarking the quantum approximate optimization algorithm
Willsch, M., Willsch, D., Jin, F., De Raedt, H., & Michielsen, K. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02692-8 · Cited by 128
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Willsch, D., Willsch, M., Gonzalez Calaza, C. D., Jin, F., De Raedt, H., Svensson, M., & Michielsen, K. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03476-y · Cited by 114
“On a D-Wave 2000Q QPU, the 2000+ physical qubits are connected in a Chimera topology [7].”
MethodBenchmarking Quantum Annealing Controls with Portfolio Optimization
Grant, E., Humble, T. S., & Stump, B. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.014012 · Cited by 90
“[41] P.”
A cross-disciplinary introduction to quantum annealing-based algorithms
Venegas-Andraca, S. E., Cruz-Santos, W., McGeoch, C., & Lanzagorta, M. (2018) · Contemporary Physics · doi:10.1080/00107514.2018.1450720 · Cited by 83
A deceptive step towards quantum speedup detection
Mandrà, S., & Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac8b2 · Cited by 82
“In this workwe introduce a class of benchmark problems designed forDW2000Qquantum annealers whose logical structure is not directly recognizable andwhose typical computational complexity can be tuned via a control parameter that tunes the relative strength of inter- versus intra-cell couplers in theDW2000QChimera [23]…”
BackgroundBenchmarking a quantum annealing processor with the time-to-target metric
King, J., Yarkoni, S., Nevisi, M. M., Hilton, J. P., & McGeoch, C. C. (2015) · arXiv · doi:10.48550/arxiv.1508.05087 · Cited by 77
Self-citationMandrà, S., Zhu, Z., & Katzgraber, H. G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.070502 · Cited by 72
“plers [4, 7, 32] of the underlying Chimera topology of the system [18].”
BackgroundMethodFinding Maximum Cliques on the D-Wave Quantum Annealer
Chapuis, G., Djidjev, H., Hahn, G., & Rizk, G. (2019) · Journal of Signal Processing Systems · doi:10.1007/s11265-018-1357-8 · Cited by 70
“Each loop encodes both a 0 and 1 (or, alternatively, −1 and +1) value at the same time through two superimposed currents in both clockwise and counter-clockwise directions until the annealing process has been completed and the system turns classical [5, 18].”
BackgroundOptimal control of traffic signals using quantum annealing
Hussain, H., Javaid, M. B., Khan, F. S., Dalal, A., & Khalique, A. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02815-1 · Cited by 66
Nested quantum annealing correction
Vinci, W., Albash, T., & Lidar, D. A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.17 · Cited by 57
Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution Instances
Atobe, Y., Tawada, M., & Togawa, N. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3138629 · Cited by 38
“Isingmachinesinclude,forexample,D-Wave Systems’quantumannealingmachines[4],[16],[17],Hitachi’s CMOSannealingmachines[18],[19],andFujitsu’sdigital annealers[5],[6].”
The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
Mandrà, S., Katzgraber, H. G., & Thomas, C. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa7877 · Cited by 35
A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks
Kasi, S., Warburton, P., Kaewell, J., & Jamieson, K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3326469 · Cited by 20
Fair sampling of ground-state configurations of binary optimization problems
Zhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2019) · Physical Review E · doi:10.1103/physreve.99.063314 · Cited by 17
Bass, G., Tomlin, C., Kumar, V., Rihaczek, P., & Dulny, J. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aaadc2 · Cited by 16
On good encodings for quantum annealer and digital optimization solvers
Ceselli, A., & Premoli, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-32232-0 · Cited by 10
Quantum Emulation of Molecular Force Fields: A Blueprint for a Superconducting Architecture
Olivares, D. G., Peropadre, B., Huh, J., & García-Ripoll, J. J. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.064008 · Cited by 6
Metadata
- Authors
- Bunyk, P. I., Hoskinson, E. M., Johnson, M. W., Tolkacheva, E., Altomare, F., Berkley, A. J., Harris, R., Hilton, J. P., Lanting, T., Przybysz, A. J., & Whittaker, J.
- Venue
- IEEE Transactions on Applied Superconductivity
- Published
- 2014-08
- Volume
- 24
- Issue
- 4
- Pages
- 1-10
- ISSN
- 1051-8223 (ISSN-L)
- 1558-2515
- OpenAlex
- W2086962969
- Cited by
- 312
- References
- 15
- FWCI
- 21.79
- Type
- journal article
- Language
- en
- Open access
- bronze
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.