Related papers: Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation

Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation

URL: http://arxiv.org/abs/2211.11973v2
Date: Sun, 10 Mar 2024 21:53:59 GMT
Title: Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
Authors: Zhiyan Ding and Lin Lin
Abstract summary: We develop a phase estimation method with a distinct feature. The total cost of the algorithm satisfies the Heisenberg-limited scaling $widetildemathcalO(epsilon-1)$. Our algorithm may significantly reduce the circuit depth for performing phase estimation tasks on early fault-tolerant quantum computers.
Score: 5.746732081406236
License: http://creativecommons.org/licenses/by/4.0/
Abstract: We develop a phase estimation method with a distinct feature: its maximal runtime (which determines the circuit depth) is $\delta/\epsilon$, where $\epsilon$ is the target precision, and the preconstant $\delta$ can be arbitrarily close to $0$ as the initial state approaches the target eigenstate. The total cost of the algorithm satisfies the Heisenberg-limited scaling $\widetilde{\mathcal{O}}(\epsilon^{-1})$. As a result, our algorithm may significantly reduce the circuit depth for performing phase estimation tasks on early fault-tolerant quantum computers. The key technique is a simple subroutine called quantum complex exponential least squares (QCELS). Our algorithm can be readily applied to reduce the circuit depth for estimating the ground-state energy of a quantum Hamiltonian, when the overlap between the initial state and the ground state is large. If this initial overlap is small, we can combine our method with the Fourier filtering method developed in [Lin, Tong, PRX Quantum 3, 010318, 2022], and the resulting algorithm provably reduces the circuit depth in the presence of a large relative overlap compared to $\epsilon$. The relative overlap condition is similar to a spectral gap assumption, but it is aware of the information in the initial state and is therefore applicable to certain Hamiltonians with small spectral gaps. We observe that the circuit depth can be reduced by around two orders of magnitude in numerical experiments under various settings.

Related papers

High-precision and low-depth eigenstate property estimation: theory and resource estimation [2.6811507121199325]
Estimating the eigenstate properties of quantum many-body systems is a long-standing, challenging problem for both classical and quantum computing. Here, we present a full-stack design of a random sampling algorithm for estimating the eigenenergy and the observable expectations on the eigenstates.
arXiv Detail & Related papers (2024-06-06T17:54:26Z)
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)
Hybrid Quantum-Classical Scheduling for Accelerating Neural Network Training with Newton's Gradient Descent [37.59299233291882]
We propose Q-Newton, a hybrid quantum-classical scheduler for accelerating neural network training with Newton's GD. Q-Newton utilizes a streamlined scheduling module that coordinates between quantum and classical linear solvers. Our evaluation showcases the potential for Q-Newton to significantly reduce the total training time compared to commonly used quantum machines.
arXiv Detail & Related papers (2024-04-30T23:55:03Z)
The Cost of Entanglement Renormalization on a Fault-Tolerant Quantum Computer [0.042855555838080824]
We perform a detailed estimate for the prospect of using deep entanglement renormalization ansatz on a fault-tolerant quantum computer. For probing a relatively large system size, we observe up to an order of magnitude reduction in the number of qubits. For estimating the energy per site of $epsilon$, $mathcalOleft(fraclog Nepsilon right)$ $T$ gates and $mathcalOleft(log Nright)$ qubits suffice.
arXiv Detail & Related papers (2024-04-15T18:00:17Z)
Low-depth Gaussian State Energy Estimation [0.0]
Ground state energy estimation (GSEE) is an important subroutine in quantum chemistry and materials. We detail a new GSEE algorithm which uses a number of operations scaling as $O(logDelta)$. We adapt this algorithm to interpolate between the low-depth and full-depth regime by replacing $Delta$ with anything between $Delta$ and $epsilon$.
arXiv Detail & Related papers (2023-09-28T18:29:14Z)
Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer [27.84599956781646]
We study the operation of a quantum-classical time-series algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a $16$-site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies.
arXiv Detail & Related papers (2023-09-19T11:59:36Z)
Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
arXiv Detail & Related papers (2023-08-06T10:24:23Z)
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)
Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications [10.436969366019015]
We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits. We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
arXiv Detail & Related papers (2022-01-27T13:16:30Z)
Random quantum circuits transform local noise into global white noise [118.18170052022323]
We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
arXiv Detail & Related papers (2021-11-29T19:26:28Z)
Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.