State Preparation Boosters for Early Fault-Tolerant Quantum Computation
- URL: http://arxiv.org/abs/2202.06978v3
- Date: Mon, 3 Oct 2022 20:33:25 GMT
- Title: State Preparation Boosters for Early Fault-Tolerant Quantum Computation
- Authors: Guoming Wang, Sukin Sim, Peter D. Johnson
- Abstract summary: We introduce the method of ground state boosting, which uses a limited-depth quantum circuit to reliably increase the overlap with the ground state.
This circuit, which we call a booster, can be used to augment an ansatz from VQE or be used as a stand-alone state preparation method.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum computing is believed to be particularly useful for the simulation of
chemistry and materials, among the various applications. In recent years, there
have been significant advancements in the development of near-term quantum
algorithms for quantum simulation, including VQE and many of its variants.
However, for such algorithms to be useful, they need to overcome several
critical barriers including the inability to prepare high-quality
approximations of the ground state. Current challenges to state preparation,
including barren plateaus and the high-dimensionality of the optimization
landscape, make state preparation through ansatz optimization unreliable. In
this work, we introduce the method of ground state boosting, which uses a
limited-depth quantum circuit to reliably increase the overlap with the ground
state. This circuit, which we call a booster, can be used to augment an ansatz
from VQE or be used as a stand-alone state preparation method. The booster
converts circuit depth into ground state overlap in a controllable manner. We
numerically demonstrate the capabilities of boosters by simulating the
performance of a particular type of booster, namely the Gaussian booster, for
preparing the ground state of $N_2$ molecular system. Beyond ground state
preparation as a direct objective, many quantum algorithms, such as quantum
phase estimation, rely on high-quality state preparation as a subroutine.
Therefore, we foresee ground state boosting and similar methods as becoming
essential algorithmic components as the field transitions into using early
fault-tolerant quantum computers.
Related papers
- Efficient charge-preserving excited state preparation with variational quantum algorithms [33.03471460050495]
We introduce a charge-preserving VQD (CPVQD) algorithm, designed to incorporate symmetry and the corresponding conserved charge into the VQD framework.
Results show applications in high-energy physics, nuclear physics, and quantum chemistry.
arXiv Detail & Related papers (2024-10-18T10:30:14Z) - Double-bracket quantum algorithms for high-fidelity ground state preparation [0.7142083707942719]
We show how to use double-bracket quantum algorithms (DBQAs) to prepare ground states.
For a Heisenberg model, we compile our algorithm using CZ and single-qubit gates into circuits that match capabilities of near-term quantum devices.
arXiv Detail & Related papers (2024-08-07T18:00:00Z) - Compact fermionic quantum state preparation with a natural-orbitalizing variational quantum eigensolving scheme [0.0]
Near-term quantum state preparation is typically realized by means of the variational quantum eigensolver (VQE) algorithm.
We present a refined VQE scheme that consists in topping VQE with state-informed updates of the elementary fermionic modes.
For a fixed circuit structure, the method is shown to enhance the capabilities of the circuit to reach a state close to the target state without incurring too much overhead from shot noise.
arXiv Detail & Related papers (2024-06-20T10:23:28Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods.
An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state.
Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
arXiv Detail & Related papers (2023-11-06T18:53:50Z) - 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) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Reducing the cost of energy estimation in the variational quantum
eigensolver algorithm with robust amplitude estimation [50.591267188664666]
Quantum chemistry and materials is one of the most promising applications of quantum computing.
Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
arXiv Detail & Related papers (2022-03-14T16:51:36Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z) - 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)
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.