Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1307.1114 · Scientific Reports

Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer

Walter Vinci, Klas Markström, Sergio Boixo, Aidan Roy, Federico M. Spedalieri, Paul A. Warburton, Simone Severini B

Published Jul 16, 2014• 29 citations
arXivHTMLPDF

Abstract

Two objects can be distinguished if they have different measurable properties. Thus, distinguishability depends on the Physics of the objects. In considering graphs, we revisit the Ising model as a framework to define physically meaningful spectral invariants. In this context, we introduce a family of refinements of the classical spectrum and consider the quantum partition function. We demonstrate that the energy spectrum of the quantum Ising Hamiltonian is a stronger invariant than the classical one without refinements. For the purpose of implementing the related physical systems, we perform experiments on a programmable annealer with superconducting flux technology. Departing from the paradigm of adiabatic computation, we take advantage of a noisy evolution of the device to generate statistics of low energy states. The graphs considered in the experiments have the same classical partition functions, but different quantum spectra. The data obtained from the annealer distinguish non-isomorphic graphs via information contained in the classical refinements of the functions but not via the differences in the quantum spectra.

DOI
10.1038/srep05703

Related papers

Partition Function Estimation Using Analog Quantum Processors

Thinh Le, Elijah Pelofske

We evaluate using programmable superconducting flux qubit D-Wave quantum annealers to approximate the partition function of Ising models. We propose the use of two distinct quantum annealer sampling methods: chains of Monte Carlo-like reverse quantum anneals, and standard linear-ramp quantum annealing. The control parameters used to attenuate the quality of the simulations are the effective analog energy scale of the J coupling, the total annealing time, and for the case of reverse annealing the anneal-pause. The core estimation technique is to sample across the energy spectrum of the classical Hamiltonian of interest, and therefore obtain a density of states estimate for each energy level, which in turn can be used to compute an estimate of the partition function with some sampling error. This estimation technique is powerful because once the distribution is sampled it allows thermodynamic quantity computation at arbitrary temperatures. On a $25$ spin $\pm J$ hardware graph native Ising model we find parameter regimes of the D-Wave processors that provide comparable result quality to two standard classical Monte Carlo methods, Multiple Histogram Reweighting and Wang-Landau. Remarkably, we find that fast quench-like anneals can quickly generate ensemble distributions that are very good estimates of the true partition function of the classical Ising model; on a Pegasus graph-structured QPU we report a logarithmic relative error of $7.6 \times 10^{-6}$, from $171,000$ samples generated using $0.2$ seconds of QPU time with an anneal time of $8$ nanoseconds per sample which is interestingly within the closed system dynamics timescale of the superconducting qubits.

quant-pharXiv:2512.19685•Dec 23, 2025•0 citations

Discriminating nonisomorphic graphs with an experimental quantum annealer

Zoe Gonzalez Izquierdo, Ruilin Zhou, Klas Markström +1 more

We demonstrate experimentally the ability of a quantum annealer to distinguish between sets of nonisomorphic graphs that share the same classical Ising spectrum. Utilizing the pause-and-quench features recently introduced into D-Wave quantum annealing processors, which allow the user to probe the quantum Hamiltonian realized in the middle of an anneal, we show that obtaining thermal averages of diagonal observables of ``classically indistinguishable'' nonisomorphic graphs encoded into transverse-field Ising Hamiltonians enable their discrimination. We discuss the significance of our results in the context of the graph isomorphism problem.

arXiv:2005.01241•Physical Review A•Sep 21, 2020•4 citations

Completeness of classical spin models and universal quantum computation

Gemma De las Cuevas, Wolfgang Dür, Maarten Van den Nest +1 more

We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence of an inhomogeneous magnetic field, can specialize to the partition function of any Ising system on an arbitrary graph. In this sense the 2D Ising model is said to be "complete". However, in order to obtain the above result, the coupling strengths on the 2D lattice must assume complex values, and thus do not allow for a physical interpretation. Here we show how a complete model with real -and, hence, "physical"- couplings can be obtained if the 3D Ising model is considered. We furthermore show how to map general q-state systems with possibly many-body interactions to the 2D Ising model with complex parameters, and give completeness results for these models with real parameters. We also demonstrate that the computational overhead in these constructions is in all relevant cases polynomial. These results are proved by invoking a recently found cross-connection between statistical mechanics and quantum information theory, where partition functions are expressed as quantum mechanical amplitudes. Within this framework, there exists a natural correspondence between many-body quantum states that allow universal quantum computation via local measurements only, and complete classical spin systems.

arXiv:0812.2368•Journal of Statistical Mechanics Theory and Experiment•Jul 1, 2009•23 citations

Predicting Ising Model Performance on Quantum Annealers

Salvatore Certo, Georgios Korpas, Andrew Vlasic +1 more

By analyzing the characteristics of hardware-native Ising Models and their performance on current and next generation quantum annealers, we provide a framework for determining the prospect of advantage utilizing adiabatic evolution compared to classical heuristics like simulated annealing. We conduct Ising Model experiments with coefficients drawn from a variety of different distributions and provide a range for the necessary moments of the distributions that lead to frustration in classical heuristics. By identifying the relationships between the linear and quadratic terms of the models, analysis can be done a priori to determine problem instance suitability on annealers. We then extend these experiments to a prototype of D-Wave's next generation device, showing further performance improvements compared to the current Advantage annealers.

arXiv:2311.07388•Nov 13, 2023•0 citations

A Quantum-Inspired Algorithm for Graph Isomorphism

Innes L. Maxwell, Stefan N. van den Hoven, Jelmer J. Renema

The Noisy Intermediate-Scale Quantum (NISQ) era of technology in which we currently find ourselves is defined by non-universality, susceptibility to errors and noise, and a search for useful applications. While demonstrations of practical quantum advantage remain elusive in this era, it provides space to develop and analyze the advantages and limitations of systems and their ability to solve problems. In this work, we critically assess a proposed quantum algorithm for the graph isomorphism problem, implemented on a photonic quantum device. Inspired by the nature of this quantum algorithm, we formulate a necessary condition for the isomorphism of graphs encoded in Gaussian boson samplers and a classical algorithm to test for it. Our classical algorithm makes use of efficiently computable statistical properties of a quantum sampling system to show a pair of graphs fail to meet our necessary condition and thus cannot be isomorphic. We analyze our algorithm in the context of the inspiring, sampler-based quantum algorithm of Bràdler et. al., the classical color refinement algorithm, and the state-of-the-art quasi-polynomial Babai algorithm.

quant-pharXiv:2512.24423•Jan 1, 2026•0 citations

Statistical Spectroscopy of Quantum Many-Body Systems

Andrea Stampiggi

A central theme in the field of quantum many-body physics is the characterization of thermal properties, which can be accessed, for instance, through the analysis of the Hamiltonian spectrum. This thesis approaches the problem from both numerical and analytical viewpoints, treating the spectrum as a statistical object whose correlations encode predictive information about the physics of the underlying system. In the first part of this thesis, we review the relation between thermalization, quantum integrability and chaos in one-dimensional quantum many-body systems. We focus on the statistics of energy levels and establish whether quantum integrability can be assessed from a statistical viewpoint. We then consider the problem of intermediate statistics between purely integrable and non-integrable quantum many-body systems. The first contribution of this thesis is an answer to the problem of discriminating between the spectrum of a genuine integrable system and a statistical mixture of, possibly exponentially many, non-ergodic sectors. We show that the spectral decimation algorithm can capture both qualitative and quantitative features of a `characteristic symmetry sector' from an unbiased analysis of numerically available spectral data. When applied to physically relevant systems, the algorithm is able to identify traces of Hilbert space fragmentation and disorder-induced many-body localization. The second part of this thesis is dedicated to a class of Hamiltonians of particular interest to statistical spectroscopy. Such Hamiltonians involve only the permutation of sites without the presence of external interactions. Nonetheless, they generate a highly tunable and numerically implementable class of models. For instance, it is easy to engineer integrability and its breaking while preserving essential structures such as the block-diagonal decomposition. These Hamiltonians are naturally suited to generating unitary random walks on the permutation group, which can, for instance, be compared with their classical counterparts. After a detailed discussion of the numerical implementation of these Hamiltonians and their spectral properties, we depart from the analysis of the system's static properties to answer a genuine out-of-equilibrium question: do quantum coherences accelerate mixing in the computational basis? We consider an exactly solvable class of quantum stochastic walks which, in the absence of quantum coherences, admit a limit coinciding with a classical continuous-time Markov chain. While the trace distance of the associated density matrices from the maximally mixed state remains identical to that in the classical limit, we show that the probability distance in the presence of quantum coherences, which defines mixing in the computational basis, is upper bounded by the classical limit. An analysis of the slowest mode identifies a necessary condition under which quantum coherences and classical mixing become of the same order, thereby defining a slow-mode time scale. Finally, a numerical analysis of quantum stochastic walks based on random transpositions corroborates the analytical findings, in particular the accelerated mixing. We also identify a closed-form expression for the ratio of quantum to classical mixing times, which yields a collapse over numerically accessible system sizes. Overall, this thesis presents a modern approach to the theory of statistical spectroscopy by proposing analytically grounded and numerically implementable protocols to ascertain the thermal properties of a one-dimensional quantum many-body system from the analysis of the spectrum within numerically accessible volumes. It also shows that the analysis of the statistical properties of Hamiltonians can be of practical aid in the study of out-of-equilibrium properties of quantum many-body systems, such as mixing in quantum stochastic walks.

•Sep 21, 2026•0 citations
Two objects can be distinguished if they have different measurable properties. Thus, distinguishability depends on the Physics of the objects. In considering graphs, we revisit the Ising model as a framework to define physically meaningful spectral invariants. In this context, we introduce a family of refinements of the classical spectrum and consider the quantum partition function. We demonstrate that the energy spectrum of the quantum Ising Hamiltonian is a stronger invariant than the classical one without refinements. For the purpose of implementing the related physical systems, we perform experiments on a programmable annealer with superconducting flux technology. Departing from the paradigm of adiabatic computation, we take advantage of a noisy evolution of the device to generate statistics of low energy states. The graphs considered in the experiments have the same classical partition functions, but different quantum spectra. The data obtained from the annealer distinguish non-isomorphic graphs via information contained in the classical refinements of the functions but not via the differences in the quantum spectra.
We evaluate using programmable superconducting flux qubit D-Wave quantum annealers to approximate the partition function of Ising models. We propose the use of two distinct quantum annealer sampling methods: chains of Monte Carlo-like reverse quantum anneals, and standard linear-ramp quantum annealing. The control parameters used to attenuate the quality of the simulations are the effective analog energy scale of the J coupling, the total annealing time, and for the case of reverse annealing the anneal-pause. The core estimation technique is to sample across the energy spectrum of the classical Hamiltonian of interest, and therefore obtain a density of states estimate for each energy level, which in turn can be used to compute an estimate of the partition function with some sampling error. This estimation technique is powerful because once the distribution is sampled it allows thermodynamic quantity computation at arbitrary temperatures. On a 252525 spin ±J\pm J±J hardware graph native Ising model we find parameter regimes of the D-Wave processors that provide comparable result quality to two standard classical Monte Carlo methods, Multiple Histogram Reweighting and Wang-Landau. Remarkably, we find that fast quench-like anneals can quickly generate ensemble distributions that are very good estimates of the true partition function of the classical Ising model; on a Pegasus graph-structured QPU we report a logarithmic relative error of 7.6×10−67.6 \times 10^{-6}7.6×10−6, from 171,000171,000171,000 samples generated using 0.20.20.2 seconds of QPU time with an anneal time of 888 nanoseconds per sample which is interestingly within the closed system dynamics timescale of the superconducting qubits.
We demonstrate experimentally the ability of a quantum annealer to distinguish between sets of nonisomorphic graphs that share the same classical Ising spectrum. Utilizing the pause-and-quench features recently introduced into D-Wave quantum annealing processors, which allow the user to probe the quantum Hamiltonian realized in the middle of an anneal, we show that obtaining thermal averages of diagonal observables of ``classically indistinguishable'' nonisomorphic graphs encoded into transverse-field Ising Hamiltonians enable their discrimination. We discuss the significance of our results in the context of the graph isomorphism problem.
We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence of an inhomogeneous magnetic field, can specialize to the partition function of any Ising system on an arbitrary graph. In this sense the 2D Ising model is said to be "complete". However, in order to obtain the above result, the coupling strengths on the 2D lattice must assume complex values, and thus do not allow for a physical interpretation. Here we show how a complete model with real -and, hence, "physical"- couplings can be obtained if the 3D Ising model is considered. We furthermore show how to map general q-state systems with possibly many-body interactions to the 2D Ising model with complex parameters, and give completeness results for these models with real parameters. We also demonstrate that the computational overhead in these constructions is in all relevant cases polynomial. These results are proved by invoking a recently found cross-connection between statistical mechanics and quantum information theory, where partition functions are expressed as quantum mechanical amplitudes. Within this framework, there exists a natural correspondence between many-body quantum states that allow universal quantum computation via local measurements only, and complete classical spin systems.
By analyzing the characteristics of hardware-native Ising Models and their performance on current and next generation quantum annealers, we provide a framework for determining the prospect of advantage utilizing adiabatic evolution compared to classical heuristics like simulated annealing. We conduct Ising Model experiments with coefficients drawn from a variety of different distributions and provide a range for the necessary moments of the distributions that lead to frustration in classical heuristics. By identifying the relationships between the linear and quadratic terms of the models, analysis can be done a priori to determine problem instance suitability on annealers. We then extend these experiments to a prototype of D-Wave's next generation device, showing further performance improvements compared to the current Advantage annealers.
The Noisy Intermediate-Scale Quantum (NISQ) era of technology in which we currently find ourselves is defined by non-universality, susceptibility to errors and noise, and a search for useful applications. While demonstrations of practical quantum advantage remain elusive in this era, it provides space to develop and analyze the advantages and limitations of systems and their ability to solve problems. In this work, we critically assess a proposed quantum algorithm for the graph isomorphism problem, implemented on a photonic quantum device. Inspired by the nature of this quantum algorithm, we formulate a necessary condition for the isomorphism of graphs encoded in Gaussian boson samplers and a classical algorithm to test for it. Our classical algorithm makes use of efficiently computable statistical properties of a quantum sampling system to show a pair of graphs fail to meet our necessary condition and thus cannot be isomorphic. We analyze our algorithm in the context of the inspiring, sampler-based quantum algorithm of Bràdler et. al., the classical color refinement algorithm, and the state-of-the-art quasi-polynomial Babai algorithm.
A central theme in the field of quantum many-body physics is the characterization of thermal properties, which can be accessed, for instance, through the analysis of the Hamiltonian spectrum. This thesis approaches the problem from both numerical and analytical viewpoints, treating the spectrum as a statistical object whose correlations encode predictive information about the physics of the underlying system. In the first part of this thesis, we review the relation between thermalization, quantum integrability and chaos in one-dimensional quantum many-body systems. We focus on the statistics of energy levels and establish whether quantum integrability can be assessed from a statistical viewpoint. We then consider the problem of intermediate statistics between purely integrable and non-integrable quantum many-body systems. The first contribution of this thesis is an answer to the problem of discriminating between the spectrum of a genuine integrable system and a statistical mixture of, possibly exponentially many, non-ergodic sectors. We show that the spectral decimation algorithm can capture both qualitative and quantitative features of a `characteristic symmetry sector' from an unbiased analysis of numerically available spectral data. When applied to physically relevant systems, the algorithm is able to identify traces of Hilbert space fragmentation and disorder-induced many-body localization. The second part of this thesis is dedicated to a class of Hamiltonians of particular interest to statistical spectroscopy. Such Hamiltonians involve only the permutation of sites without the presence of external interactions. Nonetheless, they generate a highly tunable and numerically implementable class of models. For instance, it is easy to engineer integrability and its breaking while preserving essential structures such as the block-diagonal decomposition. These Hamiltonians are naturally suited to generating unitary random walks on the permutation group, which can, for instance, be compared with their classical counterparts. After a detailed discussion of the numerical implementation of these Hamiltonians and their spectral properties, we depart from the analysis of the system's static properties to answer a genuine out-of-equilibrium question: do quantum coherences accelerate mixing in the computational basis? We consider an exactly solvable class of quantum stochastic walks which, in the absence of quantum coherences, admit a limit coinciding with a classical continuous-time Markov chain. While the trace distance of the associated density matrices from the maximally mixed state remains identical to that in the classical limit, we show that the probability distance in the presence of quantum coherences, which defines mixing in the computational basis, is upper bounded by the classical limit. An analysis of the slowest mode identifies a necessary condition under which quantum coherences and classical mixing become of the same order, thereby defining a slow-mode time scale. Finally, a numerical analysis of quantum stochastic walks based on random transpositions corroborates the analytical findings, in particular the accelerated mixing. We also identify a closed-form expression for the ratio of quantum to classical mixing times, which yields a collapse over numerically accessible system sizes. Overall, this thesis presents a modern approach to the theory of statistical spectroscopy by proposing analytically grounded and numerically implementable protocols to ascertain the thermal properties of a one-dimensional quantum many-body system from the analysis of the spectrum within numerically accessible volumes. It also shows that the analysis of the statistical properties of Hamiltonians can be of practical aid in the study of out-of-equilibrium properties of quantum many-body systems, such as mixing in quantum stochastic walks.