Projection algorithm for state preparation on quantum computers
- URL: http://arxiv.org/abs/2211.10545v3
- Date: Mon, 2 Oct 2023 03:08:01 GMT
- Title: Projection algorithm for state preparation on quantum computers
- Authors: I. Stetcu, A. Baroni, and J. Carlson
- Abstract summary: We present an efficient method to prepare states of a many-body system on quantum hardware.
We first isolate individual quantum numbers and then using time evolution to isolate the energy.
The total time evolved for an accurate solution is proportional to the ratio of the spectrum range of the trial state to the gap to the lowest excited state.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We present an efficient method to prepare states of a many-body system on
quantum hardware, first isolating individual quantum numbers and then using
time evolution to isolate the energy. Our method in its simplest form requires
only one additional auxiliary qubit. The total time evolved for an accurate
solution is proportional to the ratio of the spectrum range of the trial state
to the gap to the lowest excited state, and the accuracy increases
exponentially with the time evolved. Isolating the quantum numbers is efficient
because of the known eigenvalues, and increases the gap thus shortening the
propagation time required. The success rate of the algorithm, or the
probability of producing the desired state, is a simple function of measurement
times and phases and is dominated by the square overlap of the original state
to the desired state. We present examples from the nuclear shell model and the
Heisenberg model. We compare this algorithm to previous algorithms for short
evolution times and discuss potential further improvements.
Related papers
- Adiabatic quantum imaginary time evolution [0.0]
We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system.
Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time evolution does not require quantum state tomography during its runtime.
arXiv Detail & Related papers (2023-08-07T04:27:30Z) - Quantum Thermal State Preparation [39.91303506884272]
We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations.
We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states.
Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
arXiv Detail & Related papers (2023-03-31T17:29:56Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Initial-state-dependent quantum speed limit for dissipative state
preparation: Framework and optimization [6.211723927647019]
We focus on a Markovian dissipative state preparation scheme where the prepared state is one of the energy eigenstates.
We derive an initial-state-dependent quantum speed limit (QSL) that offers a more refined measure of the actual evolution time.
We demonstrate the effectiveness of our strategy in a dissipative Rydberg atom system for preparing the Bell state.
arXiv Detail & Related papers (2023-03-23T00:19:32Z) - Improved iterative quantum algorithm for ground-state preparation [4.921552273745794]
We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian system.
Our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.
arXiv Detail & Related papers (2022-10-16T05:57:43Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - Improved algorithms of quantum imaginary time evolution for ground and
excited states of molecular systems [0.0]
Quantum imaginary time evolution (QITE) is a recently proposed quantum-classical hybrid algorithm that is guaranteed to reach the lowest state of system.
We analyze the derivation of the underlying QITE equation order-by-order, and suggest a modification that is theoretically well founded.
We also discuss how to accurately estimate the norm of an imaginary-time-evolved state, and applied it to excited state calculations.
arXiv Detail & Related papers (2022-05-04T10:32:16Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Probabilistic imaginary-time evolution by using forward and backward
real-time evolution with a single ancilla: first-quantized eigensolver of
quantum chemistry for ground states [0.0]
Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system.
We propose a new approach of PITE which requires only a single ancillary qubit.
We discuss the application of our approach to quantum chemistry by focusing on the scaling of computational cost.
arXiv Detail & Related papers (2021-11-24T12:54:27Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Bridging the Gap Between the Transient and the Steady State of a
Nonequilibrium Quantum System [58.720142291102135]
Many-body quantum systems in nonequilibrium remain one of the frontiers of many-body physics.
Recent work on strongly correlated electrons in DC electric fields illustrated that the system may evolve through successive quasi-thermal states.
We demonstrate an extrapolation scheme that uses the short-time transient calculation to obtain the retarded quantities.
arXiv Detail & Related papers (2021-01-04T06:23:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.