Bounds on a Wavefunction Overlap with Hamiltonian Eigen-states: Performance Guarantees for the Quantum Phase Estimation Algorithm
- URL: http://arxiv.org/abs/2503.12224v1
- Date: Sat, 15 Mar 2025 18:24:12 GMT
- Title: Bounds on a Wavefunction Overlap with Hamiltonian Eigen-states: Performance Guarantees for the Quantum Phase Estimation Algorithm
- Authors: Junan Lin, Artur F. Izmaylov,
- Abstract summary: Estimating the overlap between an approximate wavefunction and a target eigenstate of the system Hamiltonian is essential for the efficiency of quantum phase estimation.<n>We derive upper and lower bounds on this overlap using expectation values of Hamiltonian powers and bounds on target eigenenergies.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Estimating the overlap between an approximate wavefunction and a target eigenstate of the system Hamiltonian is essential for the efficiency of quantum phase estimation. In this work, we derive upper and lower bounds on this overlap using expectation values of Hamiltonian powers and bounds on target eigenenergies. The accuracy of these bounds can be systematically improved by computing higher-order Hamiltonian moments and refining eigenenergy estimates. Our method offers a practical approach to assessing initial state quality and can be implemented on both classical and quantum computers.
Related papers
- Clifford-Dressed Variational Principles for Precise Loschmidt Echoes [44.99833362998488]
We extend the recently introduced Clifford dressed Time-Dependent Variational Principle (TDVP) to efficiently compute many-body wavefunction amplitudes in the computational basis.<n>By incorporating Clifford disentangling gates during TDVP evolution, our method effectively controls entanglement growth while keeping the computation of these amplitudes accessible.
arXiv Detail & Related papers (2025-02-03T22:43:32Z) - Bayesian Quantum Amplitude Estimation [49.1574468325115]
We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation.
We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
arXiv Detail & Related papers (2024-12-05T18:09:41Z) - Quantum Boltzmann machine learning of ground-state energies [3.187381965457262]
Esting the ground-state energy of Hamiltonians is a fundamental task for which quantum computers can be helpful.
We analyze the performance of quantum Boltzmann machines for this task.
Our algorithm estimates the gradient of the energy function efficiently by means of a novel quantum circuit construction.
arXiv Detail & Related papers (2024-10-16T18:22:03Z) - Coherence generation with Hamiltonians [44.99833362998488]
We explore methods to generate quantum coherence through unitary evolutions.
This quantity is defined as the maximum derivative of coherence that can be achieved by a Hamiltonian.
We identify the quantum states that lead to the largest coherence derivative induced by the Hamiltonian.
arXiv Detail & Related papers (2024-02-27T15:06:40Z) - Maximum-Likelihood-Estimate Hamiltonian learning via efficient and
robust quantum likelihood gradient [4.490097334898205]
We propose an efficient strategy combining maximum likelihood estimation, gradient descent, and quantum many-body algorithms.
Compared with previous approaches, it also exhibits better accuracy and overall stability toward noises, fluctuations, and temperature ranges.
arXiv Detail & Related papers (2022-12-28T06:54:15Z) - Resource-frugal Hamiltonian eigenstate preparation via repeated quantum
phase estimation measurements [0.0]
Preparation of Hamiltonian eigenstates is essential for many applications in quantum computing.
We adopt ideas from variants of this method to implement a resource-frugal iterative scheme.
We characterise an extension involving a modification of the target Hamiltonian to increase overall efficiency.
arXiv Detail & Related papers (2022-12-01T20:07:36Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - A Quantum Optimal Control Problem with State Constrained Preserving
Coherence [68.8204255655161]
We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels.
We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
arXiv Detail & Related papers (2022-03-24T21:31:34Z) - 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) - High Fidelity Quantum State Transfer by Pontryagin Maximum Principle [68.8204255655161]
We address the problem of maximizing the fidelity in a quantum state transformation process satisfying the Liouville-von Neumann equation.
By introducing fidelity as the performance index, we aim at maximizing the similarity of the final state density operator with the one of the desired target state.
arXiv Detail & Related papers (2022-03-07T13:27:26Z) - Heisenberg-limited ground state energy estimation for early
fault-tolerant quantum computers [3.7747526957907303]
We propose an alternative method to estimate the ground state energy of a Hamiltonian with Heisenberg-limited precision scaling.
Our algorithm also produces an approximate cumulative distribution function of the spectral measure.
arXiv Detail & Related papers (2021-02-22T20:21:56Z)
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.