Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
- URL: http://arxiv.org/abs/2402.01013v2
- Date: Thu, 26 Sep 2024 15:28:08 GMT
- Title: Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
- Authors: Zhiyan Ding, Haoya Li, Lin Lin, HongKang Ni, Lexing Ying, Ruizhe Zhang,
- Abstract summary: This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS)
QMEGS is the first algorithm to simultaneously satisfy the Heisenberg-limited scaling without relying on any spectral gap assumption.
Numerical results validate the efficiency of our proposed algorithm in various regimes.
- Score: 13.34671442890838
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum phase estimation is one of the most powerful quantum primitives. This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS). QMEGS leverages the Hadamard test circuit structure and only requires simple classical postprocessing. QMEGS is the first algorithm to simultaneously satisfy the following two properties: (1) It can achieve the Heisenberg-limited scaling without relying on any spectral gap assumption. (2) With a positive energy gap and additional assumptions on the initial state, QMEGS can estimate all dominant eigenvalues to $\epsilon$ accuracy utilizing a significantly reduced circuit depth compared to the standard quantum phase estimation algorithm. In the most favorable scenario, the maximal runtime can be reduced to as low as $\log(1/\epsilon)$. This implies that QMEGS serves as an efficient and versatile approach, achieving the best-known results for both gapped and gapless systems. Numerical results validate the efficiency of our proposed algorithm in various regimes.
Related papers
- Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.
Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.
We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
arXiv Detail & Related papers (2024-05-14T15:28:37Z) - Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries.
One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system.
We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2023-10-11T15:59:54Z) - Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver [17.975555487972166]
Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages.
The roadblock to developing quantum algorithms with the measurement-based quantum computation scheme is resource cost.
We propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA)
arXiv Detail & Related papers (2023-07-19T08:07:53Z) - On adaptive low-depth quantum algorithms for robust multiple-phase
estimation [11.678822620192438]
We present robust multiple-phase estimation (RMPE) algorithms with Heisenberg-limited scaling.
These algorithms are particularly suitable for early fault-tolerant quantum computers.
arXiv Detail & Related papers (2023-03-14T17:38:01Z) - Error Mitigation-Aided Optimization of Parameterized Quantum Circuits:
Convergence Analysis [42.275148861039895]
Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors.
gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias.
Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits.
QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
arXiv Detail & Related papers (2022-09-23T10:48:04Z) - Variational determination of arbitrarily many eigenpairs in one quantum
circuit [8.118991737495524]
A variational quantum eigensolver (VQE) was first introduced for computing ground states.
We propose a new algorithm to determine many low energy eigenstates simultaneously.
Our algorithm reduces significantly the complexity of circuits and the readout errors.
arXiv Detail & Related papers (2022-06-22T13:01:37Z) - Quantum Speedup for Higher-Order Unconstrained Binary Optimization and
MIMO Maximum Likelihood Detection [2.5272389610447856]
We propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization problem.
The proposed algorithm is capable of reducing the query complexity in the classical domain and providing a quadratic speedup in the quantum domain.
arXiv Detail & Related papers (2022-05-31T00:14:49Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit.
The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$.
We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
arXiv Detail & Related papers (2021-12-29T12:33:41Z) - Quantum mean value approximator for hard integer value problems [19.4417702222583]
We show that an optimization can be improved substantially by using an approximation rather than the exact expectation.
Together with efficient classical sampling algorithms, a quantum algorithm with minimal gate count can thus improve the efficiency of general integer-value problems.
arXiv Detail & Related papers (2021-05-27T13:03:52Z)
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.