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:2107.01743

Remark on using quantum states prepared by the adiabatic quantum computation

Kazuto Oshima

Published Jul 4, 2021• 2 citations
arXivHTMLPDF

Abstract

We indicate that there are points to keep in mind in utilizing quantum states prepared by the adiabatic quantum computation. Even if an instantaneous expectation value of a physical quantity for the adiabatically prepared quantum state is close to an expectation value for the true vacuum, this does not assure us that the prepared vacuum is close to the true vacuum. In general time average of the expectation value tend to systematically differ from the true value. Using a simple model we discuss how to diminish this systematic difference.

DOI
10.48550/arxiv.2107.01743

Related papers

Improving approximate vacuum prepared by the adiabatic quantum computation

Kazuto Oshima

Abstract According to the quantum adiabatic theorem, we can in principle obtain a true vacuum of a quantum system starting from a trivial vacuum of a simple Hamiltonian. In actual adiabatic digital quantum simulation with finite time length and non‐infinitesimal time steps, we can only obtain an approximate vacuum that is supposed to be a superposition of a true vacuum and excited states. We propose a procedure to improve the approximate vacuum.

arXiv:2204.03862•IET Quantum Communication•Jul 8, 2022•2 citations

INTRODUCING ADIABATIC QUANTUM COMPUTATION

Huazhong Li

Recent applications of quantum adiabatic approximation to quantum computation are reviewed.We discuss the adiabatic quantum algorithm and the recent discovery of inconsistency of quantum adiabatic theorem giving impact to this application.

Progress in physics•Jan 1, 2008•0 citations

Extracting vacuum expectation values from approximate vacuum prepared by the adiabatic quantum computation

Kazuto Oshima

We propose a procedure to extract vacuum expectation values from approximate vacuum prepared by the adiabatic quantum computation. We use plural ancilla bits with hierarchical structure, intending to gradually put up approximate precision. We exhibit simulation results for a typical one-qubit system and a two-qubits system based on the (1+1)-dimensional Schwinger model using classically emulated digital quantum simulator.

arXiv:2308.15066•Aug 29, 2023•1 citation

Classically emulated digital quantum simulation of the Schwinger model with a topological term via adiabatic state preparation

Bipasha Chakraborty, Masazumi Honda, Taku Izubuchi +2 more

We designed a protocol for digital quantum computation of a gauge theory with a topological term in Minkowski spacetime, which is practically inaccessible by standard lattice Monte Carlo simulations. We focus on $1+1$ dimensional quantum electrodynamics with the $\ensuremath{\theta}$ term known as the Schwinger model and test our protocol for this on an IBM simulator. We construct the true vacuum state of a lattice Schwinger model using adiabatic state preparation which, in turn, allows us to compute an expectation value of the fermion mass operator with respect to the vacuum. Upon taking a continuum limit we find that our result in the massless case agrees with the known exact result. In the massive case, we find an agreement with mass perturbation theory in the small-mass regime and deviations in the large-mass regime. We estimate computational costs required to take a reasonable continuum limit. Our results imply that digital quantum simulation appears a promising tool to explore nonperturbative aspects of gauge theories with real time and topological terms.

arXiv:2001.00485•Physical review. D/Physical review. D.•May 13, 2022•117 citations

Adiabatic Quantum Computation and Simulation

Vlad Goldenberg, Maciek Sakrejda

Adiabatic quantum computation came into the spotlight of quantum information processing researchers several years ago. The idea suggested an alternative approach to quantum computing which can be shown to be equivalent to the

•Jan 1, 2005•0 citations

A note on adiabatic theorem for Markov chains and adiabatic quantum computation

Yevgeniy Kovchegov

We derive an adiabatic theorem for Markov chains using well known facts about mixing and relaxation times. We discuss the results in the context of the recent developments in adiabatic quantum computation.

arXiv:0901.4954•Jan 30, 2009•0 citations
We indicate that there are points to keep in mind in utilizing quantum states prepared by the adiabatic quantum computation. Even if an instantaneous expectation value of a physical quantity for the adiabatically prepared quantum state is close to an expectation value for the true vacuum, this does not assure us that the prepared vacuum is close to the true vacuum. In general time average of the expectation value tend to systematically differ from the true value. Using a simple model we discuss how to diminish this systematic difference.
We designed a protocol for digital quantum computation of a gauge theory with a topological term in Minkowski spacetime, which is practically inaccessible by standard lattice Monte Carlo simulations. We focus on 1+11+11+1 dimensional quantum electrodynamics with the $\ensuremath{\theta}$ term known as the Schwinger model and test our protocol for this on an IBM simulator. We construct the true vacuum state of a lattice Schwinger model using adiabatic state preparation which, in turn, allows us to compute an expectation value of the fermion mass operator with respect to the vacuum. Upon taking a continuum limit we find that our result in the massless case agrees with the known exact result. In the massive case, we find an agreement with mass perturbation theory in the small-mass regime and deviations in the large-mass regime. We estimate computational costs required to take a reasonable continuum limit. Our results imply that digital quantum simulation appears a promising tool to explore nonperturbative aspects of gauge theories with real time and topological terms.