Faster ground state energy estimation on early fault-tolerant quantum
computers via rejection sampling
- URL: http://arxiv.org/abs/2304.09827v1
- Date: Wed, 19 Apr 2023 17:27:26 GMT
- Title: Faster ground state energy estimation on early fault-tolerant quantum
computers via rejection sampling
- Authors: Guoming Wang, Daniel Stilck Fran\c{c}a, Gumaro Rendon, Peter D.
Johnson
- Abstract summary: We introduce quantum algorithms for ground state energy estimation (GSEE)
First estimates ground state energies and has a quadratic improvement on the ground state overlap parameter compared to other methods in this regime.
Second certifies that the estimated ground state energy is within a specified error tolerance of the true ground state energy.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A major thrust in quantum algorithm development over the past decade has been
the search for the quantum algorithms that will deliver practical quantum
advantage first. Today's quantum computers and even early fault-tolerant
quantum computers will be limited in the number of operations they can
implement per circuit. We introduce quantum algorithms for ground state energy
estimation (GSEE) that accommodate this design constraint. The first estimates
ground state energies and has a quadratic improvement on the ground state
overlap parameter compared to other methods in this regime. The second
certifies that the estimated ground state energy is within a specified error
tolerance of the true ground state energy, addressing the issue of gap
estimation that beleaguers several ground state preparation and energy
estimation algorithms. We note, however, that the scaling of this certification
technique is, unfortunately, worse than that of the GSEE algorithm. These
algorithms are based on a novel use of the quantum computer to facilitate
rejection sampling. After a classical computer is used to draw samples, the
quantum computer is used to accept or reject the samples. The set of accepted
samples correspond to draws from a target distribution. While we use this
technique for ground state energy estimation, it may find broader application.
Our work pushes the boundaries of what operation-limited quantum computers are
capable of and thus brings the target of quantum advantage closer to the
present.
Related papers
- Preparing low-variance states using a distributed quantum algorithm [2.1587559138197667]
We present a distributed quantum algorithm inspired by iterative phase estimation to prepare low-variance states.
Our method uses a single auxiliary qubit per quantum device, which controls its dynamics, and a postselection strategy for a joint quantum measurement on such auxiliary qubits.
This allows us to demonstrate that our distributed algorithm reduces the energy variance significantly faster compared to single-device implementations.
arXiv Detail & Related papers (2025-01-22T18:55:51Z) - Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Perturbation theory with quantum signal processing [0.0]
We provide a quantum algorithm to obtain perturbative energies on quantum computers.
The proposed algorithm uses quantum signal processing (QSP) to achieve this goal.
This work is a first step towards explainable'' quantum simulation on fault-tolerant quantum computers.
arXiv Detail & Related papers (2022-10-03T05:20:26Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Quantum algorithm for ground state energy estimation using circuit depth
with exponentially improved dependence on precision [1.5831247735039677]
A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods.
We develop a ground state energy estimation algorithm for which this cost grows linearly in the number of bits of precision.
These features make our algorithm a promising candidate for realizing quantum advantage in the era of early fault-tolerant quantum computing.
arXiv Detail & Related papers (2022-09-14T17:58:12Z) - 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) - 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.