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:1305.2253 · Physical Review A

Experimental performance of a quantum simulator: Optimizing adiabatic evolution and identifying many-body ground states

Philip Richerme, Crystal Senko, J. Smith, A. Lee, S. É. Korenblit, Christopher R. Monroe

Published Jul 31, 2013• 70 citations
arXivHTMLPDF

Abstract

We use local adiabatic evolution to experimentally create and determine the ground-state spin ordering of a fully connected Ising model with up to 14 spins. Local adiabatic evolution---in which the system evolution rate is a function of the instantaneous energy gap---is found to maximize the ground-state probability compared with other adiabatic methods while requiring knowledge only of the lowest $\ensuremath{\sim}$$N$ of the ${2}^{N}$ Hamiltonian eigenvalues. We also demonstrate that the ground-state ordering can be experimentally identified as the most probable of all possible spin configurations, even when the evolution is highly nonadiabatic.

DOI
10.1103/physreva.88.012334

Related papers

Simulating adiabatic evolution of gapped spin systems

Tobias J. Osborne

We show that adiabatic evolution of a low-dimensional lattice of quantum spins with a spectral gap can be simulated efficiently. In particular, we show that as long as the spectral gap $\ensuremath{\Delta}E$ between the ground state and the first excited state is any constant independent of $n$, the total number of spins, then the ground-state expectation values of local operators, such as correlation functions, can be computed using polynomial space and time resources. Our results also imply that the local ground-state properties of any two spin models in the same quantum phase can be efficiently obtained from each other. A consequence of these results is that adiabatic quantum algorithms can be simulated efficiently if the spectral gap does not scale with $n$. The simulation method we describe takes place in the Heisenberg picture and does not make use of the finitely correlated state--matrix product state formalism.

arXiv:quant-ph/0601019•Physical Review A•Mar 14, 2007•99 citations

Martingale Strategy for Modeling Quantum Adiabatic Evolution

Elnaz Darsheshdar, Seyed Mostafa Moniri, Patrick Navez +1 more

We propose a strategy for modeling the behavior of an adiabatic quantum computer described by an Ising Hamiltonian with $N$ sites and the coordination number $Z$. The method is based on the $1/Z$ expansion for the density matrix of the system. In each order, the ground state energy is found neglecting the higher-order correlations between the sites, as long as the set of equations remains non-singular. The conditions of the appearance of a singularity, equivalent to the disappearance of energy gap in the given approximation, can be directly obtained from the equations. Then the next order in the expansion must be used, at the price of an $N$-fold increase in computational resources. This "martingale" strategy allows reducing the computational costs to a power of $N$ rather than $2^N$, with a finite probability of success. The strategy is illustrated by the case of a two-spin system and extended to a large number of qubits. Comparing the predictions to the experimental results obtained by using an adiabatic quantum computer would help quantify the importance of multi-site correlations, and the influence of decoherence, on its operation.

arXiv:1804.02670•Apr 8, 2018•0 citations

Estimating the ground-state probability of a quantum simulation with product-state measurements

Bryce Yoshimura, James K. Freericks

.One of the goals in quantum simulation is to adiabatically generate the ground state of a complicated Hamiltonian by starting with the ground state of a simple Hamiltonian and slowly evolving the system to the complicated one. If the evolution is adiabatic and the initial and final ground states are connected due to having the same symmetry, then the simulation will be successful. But in most experiments, adiabatic simulation is not possible because it would take too long, and the system has some level of diabatic excitation. In this work, we quantify the extent of the diabatic excitation even if we do not know {\it a priori} what the complicated ground state is. Since many quantum simulator platforms, like trapped ions, can measure the probabilities to be in a product state, we describe techniques that can employ these simple measurements to estimate the probability of being in the ground state of the system after the diabatic evolution. These techniques do not require one to know any properties about the Hamiltonian itself, nor to calculate its eigenstate properties. All the information is derived by analyzing the product-state measurements as functions of time.

arXiv:1508.05356•Frontiers in Physics•Oct 29, 2015•3 citations

Exploring adiabatic quantum trajectories via optimal control

Constantin Brif, Matthew D Grace, Mohan Sarovar +1 more

Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the evolution time is finite, the degree of adiabaticity (quantified in this work as the average ground-state population during evolution) depends on the particulars of a dynamic trajectory associated with a given set of control functions. We use quantum optimal control theory with a composite objective functional to numerically search for controls that achieve the target final state with a high fidelity while simultaneously maximizing the degree of adiabaticity. Exploring the properties of optimal adiabatic trajectories in model systems elucidates the dynamic mechanisms that suppress unwanted excitations from the ground state. Specifically, we discover that the use of multiple control functions makes it possible to access a rich set of dynamic trajectories, some of which attain a significantly improved performance (in terms of both fidelity and adiabaticity) through the increase of the energy gap during most of the evolution time.

arXiv:1310.3443•New Journal of Physics•Jun 24, 2014•38 citations

Adiabatic quantum computation with spin ensembles

Naeimeh Mohseni, Marek Narożniak, Alexey N. Pyrkov +3 more

In the standard approach to adiabatic quantum computing (AQC), quantum information stored on qubits are adia- batically evolved to find the lowest energy state of a problem Hamiltonian. Here we investigate a variation of AQC where spin ensembles are used in place of qubits. The use of ensembles duplicates the quantum information, and allows errors to be suppressed during the adiabatic evolution. We show that there are two distinct types of problem Hamiltonians under this mapping, where the first excited state is a single particle perturbation on the ground state (Type I); or a macroscopically distinct fully polarized state (Type II). For Type I problems, we find that the minimum gap for large ensembles is well predicted by mean-field theory and the AQC performance improves with ensemble size, realizing error-suppression. For Type II problems, the performance of the AQC is mixed, and the gap can increase or decrease with ensemble size depending on the problem instance. The incidences of the Type II problems are greatly suppressed with ensemble size, and consequently for randomly chosen problem instances the success probability of the scheme improves with the ensemble size. Our approach shows that it is possible to perform AQC without the necessity of controlling individual qubits, which allows for an alternative route towards implementing AQC.

AIP conference proceedings•Jan 1, 2020•0 citations

Bang-bang shortcut to adiabaticity in trapped-ion quantum simulators

S. Balasubramanian, Shuyang Han, Bryce Yoshimura +1 more

We model the bang-bang optimization protocol as a shortcut to adiabaticity in the ground-state preparation of a trapped-ion quantum simulator. Compared to a locally adiabatic evolution, the bang-bang protocol typically produces a lower ground-state probability, but its implementation is so much simpler than the locally adiabatic approach, that it can become a competitive choice to use for maximizing ground-state preparation in systems that cannot be solved with conventional computers. We describe how one can optimize the shortcut and provide specific details for how it can be implemented with current trapped-ion quantum simulators. However, when frustration is strong enough, no method appears to work well for adiabatic state preparation within the experimental time frames, and one must confront the issue of dealing with diabatic excitations within the simulation.

arXiv:1511.04602•Physical Review A•Feb 12, 2018•15 citations
We use local adiabatic evolution to experimentally create and determine the ground-state spin ordering of a fully connected Ising model with up to 14 spins. Local adiabatic evolution---in which the system evolution rate is a function of the instantaneous energy gap---is found to maximize the ground-state probability compared with other adiabatic methods while requiring knowledge only of the lowest \ensuremath{\sim}$$N of the 2N{2}^{N}2N Hamiltonian eigenvalues. We also demonstrate that the ground-state ordering can be experimentally identified as the most probable of all possible spin configurations, even when the evolution is highly nonadiabatic.
We show that adiabatic evolution of a low-dimensional lattice of quantum spins with a spectral gap can be simulated efficiently. In particular, we show that as long as the spectral gap $\ensuremath{\Delta}E$ between the ground state and the first excited state is any constant independent of nnn, the total number of spins, then the ground-state expectation values of local operators, such as correlation functions, can be computed using polynomial space and time resources. Our results also imply that the local ground-state properties of any two spin models in the same quantum phase can be efficiently obtained from each other. A consequence of these results is that adiabatic quantum algorithms can be simulated efficiently if the spectral gap does not scale with nnn. The simulation method we describe takes place in the Heisenberg picture and does not make use of the finitely correlated state--matrix product state formalism.
We propose a strategy for modeling the behavior of an adiabatic quantum computer described by an Ising Hamiltonian with NNN sites and the coordination number ZZZ. The method is based on the 1/Z1/Z1/Z expansion for the density matrix of the system. In each order, the ground state energy is found neglecting the higher-order correlations between the sites, as long as the set of equations remains non-singular. The conditions of the appearance of a singularity, equivalent to the disappearance of energy gap in the given approximation, can be directly obtained from the equations. Then the next order in the expansion must be used, at the price of an NNN-fold increase in computational resources. This "martingale" strategy allows reducing the computational costs to a power of NNN rather than 2N2^N2N, with a finite probability of success. The strategy is illustrated by the case of a two-spin system and extended to a large number of qubits. Comparing the predictions to the experimental results obtained by using an adiabatic quantum computer would help quantify the importance of multi-site correlations, and the influence of decoherence, on its operation.
.One of the goals in quantum simulation is to adiabatically generate the ground state of a complicated Hamiltonian by starting with the ground state of a simple Hamiltonian and slowly evolving the system to the complicated one. If the evolution is adiabatic and the initial and final ground states are connected due to having the same symmetry, then the simulation will be successful. But in most experiments, adiabatic simulation is not possible because it would take too long, and the system has some level of diabatic excitation. In this work, we quantify the extent of the diabatic excitation even if we do not know {\it a priori} what the complicated ground state is. Since many quantum simulator platforms, like trapped ions, can measure the probabilities to be in a product state, we describe techniques that can employ these simple measurements to estimate the probability of being in the ground state of the system after the diabatic evolution. These techniques do not require one to know any properties about the Hamiltonian itself, nor to calculate its eigenstate properties. All the information is derived by analyzing the product-state measurements as functions of time.
Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the evolution time is finite, the degree of adiabaticity (quantified in this work as the average ground-state population during evolution) depends on the particulars of a dynamic trajectory associated with a given set of control functions. We use quantum optimal control theory with a composite objective functional to numerically search for controls that achieve the target final state with a high fidelity while simultaneously maximizing the degree of adiabaticity. Exploring the properties of optimal adiabatic trajectories in model systems elucidates the dynamic mechanisms that suppress unwanted excitations from the ground state. Specifically, we discover that the use of multiple control functions makes it possible to access a rich set of dynamic trajectories, some of which attain a significantly improved performance (in terms of both fidelity and adiabaticity) through the increase of the energy gap during most of the evolution time.
In the standard approach to adiabatic quantum computing (AQC), quantum information stored on qubits are adia- batically evolved to find the lowest energy state of a problem Hamiltonian. Here we investigate a variation of AQC where spin ensembles are used in place of qubits. The use of ensembles duplicates the quantum information, and allows errors to be suppressed during the adiabatic evolution. We show that there are two distinct types of problem Hamiltonians under this mapping, where the first excited state is a single particle perturbation on the ground state (Type I); or a macroscopically distinct fully polarized state (Type II). For Type I problems, we find that the minimum gap for large ensembles is well predicted by mean-field theory and the AQC performance improves with ensemble size, realizing error-suppression. For Type II problems, the performance of the AQC is mixed, and the gap can increase or decrease with ensemble size depending on the problem instance. The incidences of the Type II problems are greatly suppressed with ensemble size, and consequently for randomly chosen problem instances the success probability of the scheme improves with the ensemble size. Our approach shows that it is possible to perform AQC without the necessity of controlling individual qubits, which allows for an alternative route towards implementing AQC.
We model the bang-bang optimization protocol as a shortcut to adiabaticity in the ground-state preparation of a trapped-ion quantum simulator. Compared to a locally adiabatic evolution, the bang-bang protocol typically produces a lower ground-state probability, but its implementation is so much simpler than the locally adiabatic approach, that it can become a competitive choice to use for maximizing ground-state preparation in systems that cannot be solved with conventional computers. We describe how one can optimize the shortcut and provide specific details for how it can be implemented with current trapped-ion quantum simulators. However, when frustration is strong enough, no method appears to work well for adiabatic state preparation within the experimental time frames, and one must confront the issue of dealing with diabatic excitations within the simulation.