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
- URL: http://arxiv.org/abs/2111.12471v3
- Date: Fri, 12 Aug 2022 10:53:34 GMT
- Title: 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
- Authors: Taichi Kosugi, Yusuke Nishiya, Hirofumi Nishi, and Yu-ichiro
Matsushita
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Imaginary-time evolution (ITE) on a quantum computer is a promising formalism
for obtaining the ground state of a quantum system. As a kind of it, the
probabilistic ITE (PITE) takes advantage of measurements to implement the
nonunitary operations. We propose a new approach of PITE which requires only a
single ancillary qubit. Under a practical approximation, the circuit is
constructed from the forward and backward real-time evolution (RTE) gates as
black boxes, generated by the original many-qubit Hamiltonian. All the
efficient unitary quantum algorithms for RTE proposed so far and those in the
future can thus be transferred to ITE exactly as they are. Our approach can
also be used for obtaining the Gibbs state at a finite temperature and the
partition function. We apply the approach to several systems as illustrative
examples to see its validity. We also discuss the application of our approach
to quantum chemistry by focusing on the scaling of computational cost, leading
to a novel framework denoted by first-quantized quantum eigensolver.
Related papers
- Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.
We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.
We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
arXiv Detail & Related papers (2024-10-10T16:10:10Z) - Quantum Equilibrium Propagation for efficient training of quantum systems based on Onsager reciprocity [0.0]
Equilibrium propagation (EP) is a procedure that has been introduced and applied to classical energy-based models which relax to an equilibrium.
Here, we show a direct connection between EP and Onsager reciprocity and exploit this to derive a quantum version of EP.
This can be used to optimize loss functions that depend on the expectation values of observables of an arbitrary quantum system.
arXiv Detail & Related papers (2024-06-10T17:22:09Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - 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) - Simulating non-unitary dynamics using quantum signal processing with
unitary block encoding [0.0]
We adapt a recent advance in resource-frugal quantum signal processing to explore non-unitary imaginary time evolution on quantum computers.
We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states.
We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.
arXiv Detail & Related papers (2023-03-10T19:00:33Z) - Universality of critical dynamics with finite entanglement [68.8204255655161]
We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement.
Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
arXiv Detail & Related papers (2023-01-23T19:23:54Z) - Variational Approach to Quantum State Tomography based on Maximal
Entropy Formalism [3.6344381605841187]
We employ the maximal entropy formalism to construct the least biased mixed quantum state that is consistent with the given set of expectation values.
We employ a parameterized quantum circuit and a hybrid quantum-classical variational algorithm to obtain such a target state making our recipe easily implementable on a near-term quantum device.
arXiv Detail & Related papers (2022-06-06T01:16:22Z) - 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) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - Real- and imaginary-time evolution with compressed quantum circuits [0.5089078998562184]
We show that quantum circuits can provide a dramatically more efficient representation than current classical numerics.
For quantum circuits, we perform both real- and imaginary-time evolution using an optimization algorithm that is feasible on near-term quantum computers.
arXiv Detail & Related papers (2020-08-24T11:16:43Z)
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.