Maximum-Entropy Inference with a Programmable Annealer
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Optimisation problems typically involve finding the ground state (i.e. the minimum energy configuration) of a cost function with respect to many variables. If the variables are corrupted by noise then this maximises the likelihood that the solution is correct. The maximum entropy solution on the other hand takes the form of a Boltzmann distribution over the ground and excited states of the cost function to correct for noise. Here we use a programmable annealer for the information decoding problem which we simulate as a random Ising model in a field. We show experimentally that finite temperature maximum entropy decoding can give slightly better bit-error-rates than the maximum likelihood approach, confirming that useful information can be extracted from the excited states of the annealer. Furthermore we introduce a bit-by-bit analytical method which is agnostic to the specific application and use it to show that the annealer samples from a highly Boltzmann-like distribution. Machines of this kind are therefore candidates for use in a variety of machine learning applications which exploit maximum entropy inference, including language processing and image recognition.
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 1×
“The facts that the D-Wave chip operates at finite temperature and that the dynamics at the end of the annealing process are fully classical have led to a debate about the extent to which quantum mechanics plays any role in its computational output [36, 37, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52].”
A 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
The order parameter for spin glasses: a function on the interval 0-1
Parisi, G. (1980) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/13/3/042 · Cited by 846
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 3×
“In the case where minimum energy ( i.e. maximum likelihood) solutions are retained, its use in machine learning [31, 32] and a number of other applications [33, 34, 35, 36, 37, 38] has been proposed and/or demonstrated.”
Defining 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×
“The facts that the D-Wave chip operates at finite temperature and that the dynamics at the end of the annealing process are fully classical have led to a debate about the extent to which quantum mechanics plays any role in its computational output [36, 37, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52].”
Quantum Annealing of a Disordered Magnet
Brooke, J., Bitko, D., F., T., Rosenbaum, & Aeppli, G. (1999) · Science · doi:10.1126/science.284.5415.779 · Cited by 518
Self-citationFinding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012) · Scientific Reports · doi:10.1038/srep00571 · Cited by 366 · cited 1×
“In the case where minimum energy ( i.e. maximum likelihood) solutions are retained, its use in machine learning [31, 32] and a number of other applications [33, 34, 35, 36, 37, 38] has been proposed and/or demonstrated.”
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 · cited 2×
“In the case where minimum energy ( i.e. maximum likelihood) solutions are retained, its use in machine learning [31, 32] and a number of other applications [33, 34, 35, 36, 37, 38] has been proposed and/or demonstrated.”
From Laplace to Supernova SN 1987A: Bayesian Inference in Astrophysics
Loredo, T. J. (1990) · Maximum Entropy and Bayesian Methods · doi:10.1007/978-94-009-0683-9_6 · Cited by 168
Cited by
What 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
Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
Perdomo-Ortiz, A., Benedetti, M., Realpe-Gómez, J., & Biswas, R. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab859 · Cited by 274
Benedetti, M., Realpe-Gómez, J., Biswas, R., & Perdomo-Ortiz, A. (2016) · Physical Review A · doi:10.1103/physreva.94.022308 · Cited by 215
Polymer physics by quantum computing
Micheletti, C., Hauke, P., & Faccioli, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.080501 · Cited by 48
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
Self-citation
Metadata
- Authors
- Chancellor, N., Szoke, S., Vinci, W., Aeppli, G., & Warburton, P. A.
- Venue
- Scientific Reports
- Published
- 2016-03-03
- Volume
- 6
- Issue
- 1
- Pages
- 22318-22318
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W1488590474
- Cited by
- 46
- References
- 10
- FWCI
- 6.09
- Type
- journal article
- Language
- en
- Open access
- gold
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: Maximum-Entropy Inference with a Programmable Annealer. https://app.cochat.ai/papers/10.1038/srep22318
- The paper
- Chancellor, N., Szoke, S., Vinci, W., Aeppli, G., & Warburton, P. A. (2016). Maximum-Entropy Inference with a Programmable Annealer. Scientific Reports. https://doi.org/10.1038/srep22318
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.