Tutorial: calibration refinement in quantum annealing
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
Quantum annealing has emerged as a powerful platform for simulating and optimizing classical and quantum Ising models. Quantum annealers, like other quantum and/or analog computing devices, are susceptible to non-idealities including crosstalk, device variation, and environmental noise. Compensating for these effects through calibration refinement or “shimming” can significantly improve performance but often relies on ad-hoc methods that exploit symmetries in both the problem being solved and the quantum annealer itself. In this tutorial, we attempt to demystify these methods. We introduce methods for finding exploitable symmetries in Ising models and discuss how to use these symmetries to suppress unwanted bias. We work through several examples of increasing complexity and provide complete Python code. We include automated methods for two important tasks: finding copies of small subgraphs in the qubit connectivity graph and automatically finding symmetries of an Ising model via generalized graph automorphism. We conclude the tutorial by surveying additional methods, providing practical implementation tips, and discussing limitations and remedies of the calibration procedure. Code is available at: https://github.com/dwavesystems/shimming-tutorial.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“We calibrate flux offsets to achieve approximately zero magnetization on every qubit by an iterative method for each experiment (ensemble, ta , κ) 69 .”
From Beyond-classical computation in quantum simulation (2025) · cites this paper as [69]
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 annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339 · cited 1×
“Quantum annealing (QA) [1, 2] is a computing approach that physically realizes a system of Ising spins in a transverse magnetic field.”
BackgroundQuantum 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×
“Quantum annealing (QA) [1, 2] is a computing approach that physically realizes a system of Ising spins in a transverse magnetic field.”
BackgroundPractical graph isomorphism, II
McKay, B. D., & Piperno, A. (2014) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2013.09.003 · Cited by 1,597
On 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 · cited 1×
“Minimizing H P is intractable, i.e., NP-hard [3].”
BackgroundIsing models of quantum frustration
Moessner, R., & Sondhi, S. L. (2001) · Physical Review B · doi:10.1103/physrevb.63.224401 · Cited by 397 · cited 1×
“Moreover, the addition of a transverse field to a TAFM leads to order-by-disorder at low temperature [19, 20].”
BackgroundObservation 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 · cited 6×
“Specific visual demonstrations of the benefit of these methods “in the wild” include: • Frustrated 2D lattice, [4] Extended Data Fig.”
BackgroundMethodInfluentialSelf-citationQuantum critical dynamics in a 5,000-qubit programmable spin glass
King, A. D., Raymond, J., Lanting, T., Harris, R., Zucca, A., Altomare, F., Berkley, A. J., Boothby, K., Ejtemaee, S., Enderud, C., et al. (2023) · Nature · doi:10.1038/s41586-023-05867-2 · Cited by 242
Self-citationCoherent quantum annealing in a programmable 2,000 qubit Ising chain
King, A. D., Suzuki, S., Raymond, J., Zucca, A., Lanting, T., Altomare, F., Berkley, A. J., Ejtemaee, S., Hoskinson, E., Huang, S., et al. (2022) · Nature Physics · doi:10.1038/s41567-022-01741-6 · Cited by 213
Self-citationKing, A. D., Raymond, J., Lanting, T., Isakov, S. V., Mohseni, M., Poulin-Lamarre, G., Ejtemaee, S., Bernoudy, W., Ozfidan, I., Smirnov, A. Y., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-20901-5 · Cited by 141
Self-citationInterplay of quantum and thermal fluctuations in a frustrated magnet
Isakov, S. V., & Moessner, R. (2003) · Physical Review B · doi:10.1103/physrevb.68.104409 · Cited by 131 · cited 1×
“Moreover, the addition of a transverse field to a TAFM leads to order-by-disorder at low temperature [19, 20].”
Background
Research works printed but not linked: 1
- Godsil, 2001, Algebraic Graph Theory, Vol 207 of Graduate Texts in Mathematics
Cited by
Beyond-classical computation in quantum simulation
King, A. D., Nocera, A., Rams, M. M., Dziarmaga, J., Wiersema, R., Bernoudy, W., Raymond, J., Kaushal, N., Heinsdorf, N., Harris, R., et al. (2025) · Science · doi:10.1126/science.ado6285 · Cited by 138
Self-citationUsing quantum annealing to design lattice proteins
Irbäck, A., Knuthson, L., Mohanty, S., & Peterson, C. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013162 · Cited by 35
Quantum error mitigation in quantum annealing
Raymond, J., Amin, M. H. S., King, A. D., Harris, R., Bernoudy, W., Berkley, A. J., Boothby, K., Smirnov, A. Y., Altomare, F., Babcock, M. C., et al. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00977-3 · Cited by 36
“…by tuning, respectively, individual couplings, flux-bias offsets, and anneal offsets as previously detailed in the supplementary materials of [29] and as described in [40] (the latter does not employ or describe anneal offset tuning, as it is only impactful for anneals faster than 100 ns).”
Self-citationQuantum quench dynamics of geometrically frustrated Ising models
Ali, A., Xu, H., Bernoudy, W., Nocera, A., King, A. D., & Banerjee, A. (2024) · Nature Communications · doi:10.1038/s41467-024-54701-4 · Cited by 20
“For this reason, following [18], [30] we perform three hardware calibration measures: which we now explain.”
MethodSelf-citation4-Clique network minor embedding for quantum annealers
Pelofske, E. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.034023 · Cited by 19
“For each problem size N that is tested, a new problem instance is generated with new random coefficients.”
MethodNarasimhan, P., Humeniuk, S., Roy, A., & Drouin-Touchette, V. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.054432 · Cited by 25
“This observation points towards some form of topological metamagnetic transition [78, 79], which requires further investigation.”
BackgroundClassical criticality via quantum annealing
Sathe, P., King, A. D., Mniszewski, S. M., Coffrin, C., Nisoli, C., & Caravelli, F. (2026) · Nature Communications · doi:10.1038/s41467-025-67568-w · Cited by 14
“While computing the order parameters for a fi nite-sized system does provide a qualitative understanding of the location of critical lines, a more robust method involves the computation of Binder cumulants, which we describe below.”
Self-citationFinite-temperature criticality through quantum annealing
Teza, G., Campaioli, F., Avesani, M., & Raz, O. (2026) · Nature Communications · doi:10.1038/s41467-026-75348-3 · Cited by 11
Charging a quantum spin network with superextensive precision
Donelli, B., Gherardini, S., Marino, R., Campaioli, F., & Buffoni, L. (2025) · Physical review. E · doi:10.1103/lffq-ylgz · Cited by 7
Embedding-aware noise modeling of quantum annealing
Jeong, S.-G., Mai, D. C., Noh, D.-I., Pham, Q., & Hwang, W. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05293-z · Cited by 5
Barrows, F. P., Pelofske, E., Sathe, P., Caravelli, F., & Nisoli, C. (2026) · Communications Physics · doi:10.1038/s42005-026-02847-6 · Cited by 6
Benchmarking Quantum Annealers with Near-Optimal Minor-Embedded Instances
Gilbert, V., Rodriguez, J., & Louise, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00068 · Cited by 8
“We did not want to include other complex parameter optimization such as the advanced tuning of the chain strength [29]–[31], annealing schedules [32], [33] or advanced calibration methods called shimming [34].”
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2311.01657 · Cited by 6
“…not perform low level calibrations such as correcting the anneal offsets, flux bias offsets, or quadratic coefficients to ensure that the simulation is performed as intended on the hardware (e.g. to calibrate for the effective coefficients and anneal schedules which are used) [44, 45, 65, 78–80].”
BackgroundMethodQuantum dynamics in frustrated Ising fullerenes
López‐Bezanilla, A., Bernoudy, W., Boothby, K., Raymond, J., Nocera, A., & King, A. D. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00536-5 · Cited by 3
Self-citationBoltzmann sampling of frustrated J 1 − J 2 Ising models with programmable quantum annealers
Anonymous (2026) · Physical Review Research · doi:10.1103/2xc3-815x · Cited by 1
“This is accomplished specifically using the Glasgow subgraph isomorphism finder [71], part of the minorminer package [72, 73].”
Magnetic devil's staircaselike behavior in quasiperiodic qubit lattices
López‐Bezanilla, A. (2025) · Physical review. B./Physical review. B · doi:10.1103/c4pw-j4lk
“This feature is exploited to selectively adjust subsets of nodes during the QA shimming procedure [35], refining the parameters defining the Hamiltonian to counteract potential biases or inaccuracies stemming from qubit and couplers asymmetries.”
Probing antiferromagnetic hysteresis on programmable quantum annealers
Pelofske, E., Sathe, P., Nisoli, C., & Barrows, F. (2026) · Physical review. B./Physical review. B · doi:10.1103/mcz4-xh6z
“In future studies we will apply statistics-balancing calibration refinement [55] on the local fields and on the couplers to reduce the noise.”
InfluentialPartition Function Estimation Using Analog Quantum ProcessorsPreprint
Le, T., & Pelofske, E. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2512.19685
“To this end, we use the Glasgow subgraph isomorphism solver [60], which is part of the minorminer package [61, 62], in order to iteratively find many disjoint native embeddings of the fixed Ising model – the counts for these disjoint embeddings are reported in Table I.”
Performance evaluation and control improvements for solving optimization problems on NISQ platforms
Gilbert, V. (2024) · theses.fr (ABES) · doi:10.70675/81f9c638z5867z40e4zaed8ze9824ff5a163 · Cited by 1
Topology-controlled magnetic domain-wall transport
López‐Bezanilla, A. (2026) · APS Open Science · doi:10.1103/dr4p-rrpq
Generalized Mean-Field Ising Model as a Benchmark Family with Exact SolutionsPreprint
Willsch, M., Santra, G. C., Willsch, D., Morales, S., Mauth, L., Mehta, V., Jin, F., & Michielsen, K. F. L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.38803
“We use several different embeddings (also in parallel) as well as spin-reversal transformations to reduce the influence of the particular choice of embeddings and biases on the success rate as much as possible without the need for shimming procedures [73].”
Metadata
- Authors
- Chern, K., Boothby, K., Raymond, J., Farré, P., & King, A. D.
- Affiliations
- D-Wave Systems (Canada) (CA)
- Corresponding author
- King, Andrew D.
- Venue
- Frontiers in Computer Science
- Publisher
- Frontiers Media SA
- Published
- 2023-09-15
- Volume
- 5
- ISSN
- 2624-9898 (ISSN-L)
- OpenAlex
- W4386836710
- Cited by
- 11
- References
- 16
- Citations by year
- 2026: 3 · 2025: 4 · 2024: 4
- FWCI
- 0.97
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Frontiers in Computer Science (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- quantum annealing, shimming, Ising model, symmetry exploitation, graph automorphisms, subgraph isomorphism, crosstalk reduction, device variability, environmental noise, bias suppression
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.