Boosting quantum annealer performance via sample persistence
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer (or any sampler) to fix the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are usually much easier for the quantum annealer to solve, due to their being smaller and consisting of disconnected components. This approach significantly increases the success rate and number of observations of the best known energy value in samples obtained from the quantum annealer, when compared with calling the quantum annealer without using it, even when using fewer annealing cycles. Use of the method results in a considerable improvement in success metrics even for problems with high-precision couplers and biases, which are more challenging for the quantum annealer to solve. The results are further enhanced by applying the method iteratively and combining it with classical pre-processing. We present results for both Chimera graph-structured problems and embedded problems from a real-world application.
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
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
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×
“For certain problem classes, this might provide a quantum speedup [1,12,17,21,33,39,44].”
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
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×
“There is evidence that quantum effects, namely entanglement and finite-range multiqubit tunnelling, do indeed occur on these quantum annealing chips [2,3,11,26].”
BackgroundDefining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601 · cited 1×
“For this reason, there has been much recent interest in benchmarking quantum annealers against classical solvers, although conclusive evidence of quantum speedup has not been shown to date [13, 6, 14, 15, 16, 7, 17, 18, 19, 20].”
BackgroundWhat is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399 · cited 3×
“There is evidence that quantum effects, namely entanglement and multiqubit tunnelling, do indeed occur on these quantum annealing chips [4, 5, 6, 7].”
BackgroundA quantum annealing architecture with all-to-all connectivity from local interactions
Lechner, W., Hauke, P., & Zoller, P. (2015) · Science Advances · doi:10.1126/sciadv.1500838 · Cited by 256
Cited by
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
Hybrid quantum annealing via molecular dynamics
Irie, H., Liang, H., Doi, T., Gongyo, S., & Hatsuda, T. (2021) · Scientific Reports · doi:10.1038/s41598-021-87676-z · Cited by 32
Combinatorial Optimization on Gate Model Quantum Computers: A Survey
Zahedinejad, E., & Zaribafiyan, A. (2017) · arXiv · doi:10.48550/arxiv.1708.05294 · Cited by 29
“For instance, good samples from the low energy levels of the system can help to quickly identify the backbone of combinatorial optimization problems by reducing the original optimization problem into smaller subproblems [72, 73].”
BackgroundQuantum annealing for jet clustering with thrust
Delgado, A., & Thaler, J. (2022) · Physical Review D · doi:10.1103/physrevd.106.094016 · Cited by 19
“This sample persistence variable reduction (SPVAR) algorithm [39] has been reported to significantly increase the success rate in finding the best-known energy in quantum annealing applications.”
BackgroundOn 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
Metadata
- Authors
- Karimi, H., & Rosenberg, G.
- Venue
- Quantum Information Processing
- Published
- 2017-05-16
- Volume
- 16
- Issue
- 7
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W2466842283
- Cited by
- 28
- References
- 7
- FWCI
- 1.15
- 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: Boosting quantum annealer performance via sample persistence. https://app.cochat.ai/papers/10.1007/s11128-017-1615-x
- The paper
- Karimi, H., & Rosenberg, G. (2017). Boosting quantum annealer performance via sample persistence. Quantum Information Processing. https://doi.org/10.1007/s11128-017-1615-x
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.