Real-Time Krylov Theory for Quantum Computing Algorithms
- URL: http://arxiv.org/abs/2208.01063v3
- Date: Sat, 10 Jun 2023 19:44:50 GMT
- Title: Real-Time Krylov Theory for Quantum Computing Algorithms
- Authors: Yizhi Shen, Katherine Klymko, James Sud, David B. Williams-Young, Wibe
A. de Jong, Norm M. Tubman
- Abstract summary: New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information.
We develop the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware.
We discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum computers provide new avenues to access ground and excited state
properties of systems otherwise difficult to simulate on classical hardware.
New approaches using subspaces generated by real-time evolution have shown
efficiency in extracting eigenstate information, but the full capabilities of
such approaches are still not understood. In recent work, we developed the
variational quantum phase estimation (VQPE) method, a compact and efficient
real-time algorithm to extract eigenvalues on quantum hardware. Here we build
on that work by theoretically and numerically exploring a generalized Krylov
scheme where the Krylov subspace is constructed through a parametrized
real-time evolution, which applies to the VQPE algorithm as well as others. We
establish an error bound that justifies the fast convergence of our spectral
approximation. We also derive how the overlap with high energy eigenstates
becomes suppressed from real-time subspace diagonalization and we visualize the
process that shows the signature phase cancellations at specific eigenenergies.
We investigate various algorithm implementations and consider performance when
stochasticity is added to the target Hamiltonian in the form of spectral
statistics. To demonstrate the practicality of such real-time evolution, we
discuss its application to fundamental problems in quantum computation such as
electronic structure predictions for strongly correlated systems.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - 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) - Classical simulation of short-time quantum dynamics [0.0]
We present classical algorithms for approximating the dynamics of local observables and nonlocal quantities.
We establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.
arXiv Detail & Related papers (2022-10-20T18:00:04Z) - 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) - Fast-forwarding quantum simulation with real-time quantum Krylov
subspace algorithms [0.0]
We propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware.
Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics.
arXiv Detail & Related papers (2022-08-01T16:00:20Z) - Improved algorithms of quantum imaginary time evolution for ground and
excited states of molecular systems [0.0]
Quantum imaginary time evolution (QITE) is a recently proposed quantum-classical hybrid algorithm that is guaranteed to reach the lowest state of system.
We analyze the derivation of the underlying QITE equation order-by-order, and suggest a modification that is theoretically well founded.
We also discuss how to accurately estimate the norm of an imaginary-time-evolved state, and applied it to excited state calculations.
arXiv Detail & Related papers (2022-05-04T10:32:16Z) - Quantum Davidson Algorithm for Excited States [42.666709382892265]
We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states.
By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions.
Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
arXiv Detail & Related papers (2022-04-22T15:03:03Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Continuous-time dynamics and error scaling of noisy highly-entangling
quantum circuits [58.720142291102135]
We simulate a noisy quantum Fourier transform processor with up to 21 qubits.
We take into account microscopic dissipative processes rather than relying on digital error models.
We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
arXiv Detail & Related papers (2021-02-08T14:55:44Z)
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.