Single-ancilla ground state preparation via Lindbladians
- URL: http://arxiv.org/abs/2308.15676v3
- Date: Sat, 14 Oct 2023 04:48:48 GMT
- Title: Single-ancilla ground state preparation via Lindbladians
- Authors: Zhiyan Ding and Chi-Fang Chen and Lin Lin
- Abstract summary: We design a quantum algorithm for ground state preparation in the early fault tolerant regime.
As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary.
Our algorithm can prepare the ground state even when the initial state has zero overlap with the ground state.
- Score: 4.864474385178252
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We design a quantum algorithm for ground state preparation in the early fault
tolerant regime. As a Monte Carlo-style quantum algorithm, our method features
a Lindbladian where the target state is stationary, and its evolution can be
efficiently implemented using just one ancilla qubit. Our algorithm can prepare
the ground state even when the initial state has zero overlap with the ground
state, bypassing the most significant limitation of methods like quantum phase
estimation. As a variant, we also propose a discrete-time algorithm,
demonstrating even better efficiency and providing a near-optimal simulation
cost depending on the desired evolution time and precision. Numerical
simulation using Ising models and Hubbard models demonstrates the efficacy and
applicability of our method.
Related papers
- Efficient state preparation for the quantum simulation of molecules in first quantization [0.027042267806481293]
We show how to efficiently map states defined in a Gaussian type orbital basis to a plane wave basis with a scaling that is logarithmic in the number of plane waves.
Our work allows for the first quantum simulation of molecular systems whose end-to-end complexity is truly sublinear in the basis set size.
arXiv Detail & Related papers (2024-06-28T22:46:01Z) - Efficient preparation of the AKLT State with Measurement-based Imaginary Time Evolution [2.5938976557097715]
We propose a method to prepare the ground state of the Affleck-Lieb-Kennedy-Tasaki model deterministically.
We show that it can be prepared efficiently using the MITE approach.
We show that the procedure is compatible with qubit-based simulators.
arXiv Detail & Related papers (2023-10-09T18:00:03Z) - Hybrid algorithm simulating non-equilibrium steady states of an open
quantum system [10.752869788647802]
Non-equilibrium steady states are a focal point of research in the study of open quantum systems.
Previous variational algorithms for searching these steady states have suffered from resource-intensive implementations.
We present a novel variational quantum algorithm that efficiently searches for non-equilibrium steady states by simulating the operator-sum form of the Lindblad equation.
arXiv Detail & Related papers (2023-09-13T01:57:27Z) - Guaranteed Conservation of Momentum for Learning Particle-based Fluid
Dynamics [96.9177297872723]
We present a novel method for guaranteeing linear momentum in learned physics simulations.
We enforce conservation of momentum with a hard constraint, which we realize via antisymmetrical continuous convolutional layers.
In combination, the proposed method allows us to increase the physical accuracy of the learned simulator substantially.
arXiv Detail & Related papers (2022-10-12T09:12:59Z) - Exact and efficient Lanczos method on a quantum computer [0.0]
We present an algorithm that uses block encoding on a quantum computer to exactly construct a Krylov space.
The construction is exact in the sense that the Krylov space is identical to that of the Lanczos method.
arXiv Detail & Related papers (2022-08-01T01:57:23Z) - Probing finite-temperature observables in quantum simulators of spin
systems with short-time dynamics [62.997667081978825]
We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality.
We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
arXiv Detail & Related papers (2022-06-03T18:00:02Z) - Quadratic Unconstrained Binary Optimisation via Quantum-Inspired
Annealing [58.720142291102135]
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation.
We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
arXiv Detail & Related papers (2021-08-18T09:26:17Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - FedPD: A Federated Learning Framework with Optimal Rates and Adaptivity
to Non-IID Data [59.50904660420082]
Federated Learning (FL) has become a popular paradigm for learning from distributed data.
To effectively utilize data at different devices without moving them to the cloud, algorithms such as the Federated Averaging (FedAvg) have adopted a "computation then aggregation" (CTA) model.
arXiv Detail & Related papers (2020-05-22T23:07:42Z) - Efficient State Preparation for Quantum Amplitude Estimation [0.951828574518325]
Quantum Amplitude Estimation can achieve a quadratic speed-up for applications classically solved by Monte Carlo simulation.
Currently known efficient techniques require problems based on log-concave probability distributions, involve learning an unknown distribution from empirical data, or fully rely on quantum arithmetic.
We introduce an approach to simplify state preparation, together with a circuit optimization technique, both of which can help reduce the circuit complexity for QAE state preparation significantly.
arXiv Detail & Related papers (2020-05-15T18:00:01Z) - Active Model Estimation in Markov Decision Processes [108.46146218973189]
We study the problem of efficient exploration in order to learn an accurate model of an environment, modeled as a Markov decision process (MDP)
We show that our Markov-based algorithm outperforms both our original algorithm and the maximum entropy algorithm in the small sample regime.
arXiv Detail & Related papers (2020-03-06T16:17:24Z)
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.