Quantum Annealing with Longitudinal Bias Fields
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Quantum annealing aims at solving hard computational problems through adiabatic state preparation. Here, I propose to use inhomogeneous longitudinal magnetic fields to enhance the efficiency of the annealing. Such fields are able to bias the annealing dynamics into the desired solution, and in many cases, suitable field configurations can be found iteratively. Alternatively, the longitudinal fields can also be applied as an antibias which filters out unwanted contributions from the final state. This strategy is particularly well suited for instances which are difficult to solve within the standard quantum annealing approach. By numerically simulating the dynamics for small instances of the exact cover problem, the performance of these different strategies is investigated.
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 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 2×
“[4] Tadashi Kadowaki and Hidetoshi Nishimori, “Quantum annealing in the transverse Ising model,” Phys.”
BackgroundA Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
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
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Colloquium : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700
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
Reverse quantum annealing approach to portfolio optimization problems
Venturelli, D., & Kondratyev, A. (2019) · Quantum Machine Intelligence · doi:10.1007/s42484-019-00001-w · Cited by 233
A study of heuristic guesses for adiabatic quantum computation
Perdomo-Ortiz, A., Venegas-Andraca, S. E., & Aspuru-Guzik, A. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0168-z · Cited by 111 · cited 1×
“[16] Alejandro Perdomo-Ortiz, Salvador E.”
A coherent quantum annealer with Rydberg atoms
Glaetzle, A. W., van Bijnen, R. M. W., Zoller, P., & Lechner, W. (2017) · Nature Communications · doi:10.1038/ncomms15813 · Cited by 91 · cited 1×
“In the future, various atomic platforms may also become available for quantum annealing purposes, such as trapped ions [28, 29], Rydberg atoms [30], or atoms in optical cavities [31].”
Background
Cited by
A review on Quantum Approximate Optimization Algorithm and its variants
Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.03.002 · Cited by 408
Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization
Romero, S. V., Visuri, A.-M., Cadavid, A. G., Simen, A., Solano, E., & Hegade, N. N. (2025) · Communications Physics · doi:10.1038/s42005-025-02270-3 · Cited by 18
“In BF-DCQO, the standard DCQO is performed iteratively, so that the solution from each step serves as the input bias for the next iteration [50, 51, 69].”
Bias-field digitized counterdiabatic quantum optimization
Cadavid, A. G., Dalal, A., Simen, A., Solano, E., & Hegade, N. N. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.l022010 · Cited by 10
“Instead of starting with a random initial state, beginning with a good one that encodes some information about the final solution is beneficial [25, 26].”
BackgroundUnconventional quantum annealing methods for difficult trial problems
Tang, Z., & Kapit, E. (2021) · Physical Review A · doi:10.1103/physreva.103.032612 · Cited by 8
Metadata
- Authors
- Graß, T.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2019-09-18
- Volume
- 123
- Issue
- 12
- Pages
- 120501-120501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2948801716
- Cited by
- 46
- References
- 9
- FWCI
- 2.99
- Type
- journal article
- Language
- en
- Open access
- green
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: Quantum Annealing with Longitudinal Bias Fields. https://app.cochat.ai/papers/10.1103/physrevlett.123.120501
- The paper
- Graß, T. (2019). Quantum Annealing with Longitudinal Bias Fields. Physical Review Letters. https://doi.org/10.1103/physrevlett.123.120501
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.