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

Progress of Theoretical and Experimental Physics

Quantum Entanglement to Extract a True Ground State from an Approximate Ground State

Kazuto Oshima

Published Nov 1, 2024• 1 citation
Publisher

Abstract

Abstract We propose a procedure to extract a true ground state from an approximate ground state by using quantum entanglement. We use plural ancilla qubits with hierarchical structure, intending to gradually improve the precision of the approximation. We demonstrate the procedure for quantum systems with a few qubits that derive from the (1+1)-dimensional Schwinger model by classically emulated digital quantum simulation. Although we use for simplicity an approximate ground state prepared by adiabatic quantum computation, our procedure is applicable to any approximate ground state that is a superposition of a true ground state and excited states. Our procedure is applicable for an $N$-qubits Hamiltonian with a nondegenerate ground state.

DOI
10.1093/ptep/ptae164

Related papers

Quantum algorithm for preparing the ground state of a system via resonance transition

Hefeng Wang

Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary qubit, by introducing a resonance mechanism between the ancilla qubit and the system, and combined with measurements performed on the ancilla qubit, the system can be evolved to monotonically converge to its ground state through an iterative procedure. We have simulated the application of this algorithm for the Afflect-Kennedy-Lieb-Tasaki model, whose ground state can be used as resource state in one-way quantum computation.

arXiv:1706.08644•Scientific Reports•Nov 21, 2017•13 citations

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

Faster ground state preparation and high-precision ground energy estimation with fewer qubits

Yimin Ge, Jordi Tura, J. I. Cirac

We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear system problem. We show that, compared to algorithms based on phase estimation, the runtime of our algorithm is exponentially better as a function of the allowed error, and at least quadratically better as a function of the overlap with the trial state. We also show that our algorithm requires fewer ancilla qubits than existing algorithms, making it attractive for early applications of small quantum computers. Additionally, it can be used to determine an unknown ground energy faster than with phase estimation if a very high precision is required.

arXiv:1712.03193•Journal of Mathematical Physics•Feb 1, 2019•187 citations

Ground States via Spectral Combing on a Quantum Computer

David B. Kaplan, Natalie Klco, Alessandro Roggero

A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of Spectral Combing involves entangling an arbitrary initial wave function with a set of auxiliary qubits governed by a time dependent Hamiltonian, resonantly transferring energy out of the initial state through a plethora of avoided level crossings into the auxiliary system. The number of avoided level crossings grows exponentially with the number of qubits required to represent the Hamiltonian, so that the efficiency of the algorithm does not rely on any particular energy gap being large. We give an explicit construction of the quantum gates required for the realization of this procedure and explore the results of classical simulations of the algorithm on a small quantum computer with up to 8 qubits. We show that for certain systems and comparable results, Spectral Combing requires fewer quantum gates to realize than the Quantum Adiabatic Algorithm.

arXiv:1709.08250•Sep 24, 2017•43 citations

Adiabatic quantum evolution for preparation of quantum entanglement states

Wen Jiayan, Qiu Daowen

Preparation of quantum entanglement states is crucial yet challenging to quantum communication and quantum computation. Recent studies have shown that the intermediate states of adiabatic Grover‘s algorithm are entanglement, although its initial and final states are product states. In light of this result, this paper presents a novel approach of preparing entanglement states based on adiabatic quantum evolution. Firstly, the desired entanglement states are encoded as the ground states of a final Hamiltonian, and the quantum system is started with an easily constructed ground state of an initial Hamiltonian. Secondly, the initial Hamiltonian adiabatically evolved to the final Hamiltonian. At the end of the evolution, the entangled states can be obtained with reasonably high probability. As a result, the whole preparation process of entanglement states looks like typical adiabatic quantum computation. The validation of the proposed approach has been made in the context of EPR and three-particle GHZ states, which show that the relevant entanglement states can be successfully prepared by adiabatic quantum evolution.

Chinese Control Conference (CCC)•Jul 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
Abstract We propose a procedure to extract a true ground state from an approximate ground state by using quantum entanglement. We use plural ancilla qubits with hierarchical structure, intending to gradually improve the precision of the approximation. We demonstrate the procedure for quantum systems with a few qubits that derive from the (1+1)-dimensional Schwinger model by classically emulated digital quantum simulation. Although we use for simplicity an approximate ground state prepared by adiabatic quantum computation, our procedure is applicable to any approximate ground state that is a superposition of a true ground state and excited states. Our procedure is applicable for an NNN-qubits Hamiltonian with a nondegenerate ground state.
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary qubit, by introducing a resonance mechanism between the ancilla qubit and the system, and combined with measurements performed on the ancilla qubit, the system can be evolved to monotonically converge to its ground state through an iterative procedure. We have simulated the application of this algorithm for the Afflect-Kennedy-Lieb-Tasaki model, whose ground state can be used as resource state in one-way quantum computation.
We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear system problem. We show that, compared to algorithms based on phase estimation, the runtime of our algorithm is exponentially better as a function of the allowed error, and at least quadratically better as a function of the overlap with the trial state. We also show that our algorithm requires fewer ancilla qubits than existing algorithms, making it attractive for early applications of small quantum computers. Additionally, it can be used to determine an unknown ground energy faster than with phase estimation if a very high precision is required.
A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of Spectral Combing involves entangling an arbitrary initial wave function with a set of auxiliary qubits governed by a time dependent Hamiltonian, resonantly transferring energy out of the initial state through a plethora of avoided level crossings into the auxiliary system. The number of avoided level crossings grows exponentially with the number of qubits required to represent the Hamiltonian, so that the efficiency of the algorithm does not rely on any particular energy gap being large. We give an explicit construction of the quantum gates required for the realization of this procedure and explore the results of classical simulations of the algorithm on a small quantum computer with up to 8 qubits. We show that for certain systems and comparable results, Spectral Combing requires fewer quantum gates to realize than the Quantum Adiabatic Algorithm.
Preparation of quantum entanglement states is crucial yet challenging to quantum communication and quantum computation. Recent studies have shown that the intermediate states of adiabatic Grover‘s algorithm are entanglement, although its initial and final states are product states. In light of this result, this paper presents a novel approach of preparing entanglement states based on adiabatic quantum evolution. Firstly, the desired entanglement states are encoded as the ground states of a final Hamiltonian, and the quantum system is started with an easily constructed ground state of an initial Hamiltonian. Secondly, the initial Hamiltonian adiabatically evolved to the final Hamiltonian. At the end of the evolution, the entangled states can be obtained with reasonably high probability. As a result, the whole preparation process of entanglement states looks like typical adiabatic quantum computation. The validation of the proposed approach has been made in the context of EPR and three-particle GHZ states, which show that the relevant entanglement states can be successfully prepared by adiabatic quantum evolution.