Solving Sharp Bounded-error Quantum Polynomial Time Problem by Evolution methods
- URL: http://arxiv.org/abs/2406.03222v2
- Date: Tue, 23 Jul 2024 06:41:11 GMT
- Title: Solving Sharp Bounded-error Quantum Polynomial Time Problem by Evolution methods
- Authors: Zhen Guo, Li You,
- Abstract summary: Counting ground state degeneracy of a $k$-local Hamiltonian is important in many fields of physics.
Finding ground states of a $k$-local Hamiltonian is an easier problem of Quantum Merlin Arthur.
- Score: 10.891099517614037
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Counting ground state degeneracy of a $k$-local Hamiltonian is important in many fields of physics. Its complexity belongs to the problem of sharp bounded-error quantum polynomial time (#BQP) class and few methods are known for its solution. Finding ground states of a $k$-local Hamiltonian, on the other hand, is an easier problem of Quantum Merlin Arthur (QMA) class, for which many efficient methods exist. In this work, we propose an algorithm of mapping a #BQP problem into one of finding a special ground state of a $k$-local Hamiltonian. We prove that all traditional methods, which solve the QMA problem by evolution under a function of a Hamiltonian, can be used to find the special ground state from a well-designed initial state, thus can solve the #BQP problem. We combine our algorithm with power method, Lanczos method, and quantum imaginary time evolution method for different systems to illustrate the detection of phase boundaries, competition between frustration and quantum fluctuation, and potential implementations with quantum circuits.
Related papers
- Quantum State Transfer in Interacting, Multiple-Excitation Systems [41.94295877935867]
Quantum state transfer (QST) describes the coherent passage of quantum information from one node to another.
We describe Monte Carlo techniques which enable the discovery of a Hamiltonian that gives high-fidelity QST.
The resulting Jaynes-Cummings-Hubbard and periodic Anderson models can, in principle, be engineered in appropriate hardware to give efficient QST.
arXiv Detail & Related papers (2024-05-10T23:46:35Z) - Hamiltonian-reconstruction distance as a success metric for the Variational Quantum Eigensolver [1.0916270449935084]
Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm for quantum simulation that can run on near-term quantum hardware.
A challenge in VQE is to know how close the algorithm's output solution is to the true ground state, when the true ground state and ground-state energy are unknown.
Recent developments in Hamiltonian reconstruction give a metric can be used to assess the quality of a variational solution to a Hamiltonian-eigensolving problem.
arXiv Detail & Related papers (2024-03-18T17:28:06Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks.
Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture.
We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
arXiv Detail & Related papers (2023-04-14T08:03:20Z) - Optimizing local Hamiltonians for the best metrological performance [0.0]
We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system.
We present the quantum Fisher information in a bilinear form and maximize it by iterating a see-saw.
We consider a number of other problems in quantum information theory that can be solved in a similar manner.
arXiv Detail & Related papers (2022-06-06T18:01:03Z) - 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) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - 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) - Theoretical survey of unconventional quantum annealing methods applied
to adifficult trial problem [2.2209333405427585]
We consider a range of unconventional modifications to Quantum Annealing (QA)
In this problem, inspired by "transverse field chaos" in larger systems, classical and quantum methods are steered toward a false local minimum.
We numerically study this problem by using a variety of new methods from the literature.
arXiv Detail & Related papers (2020-11-12T05:54:57Z) - Iterative Quantum Assisted Eigensolver [0.0]
We provide a hybrid quantum-classical algorithm for approximating the ground state of a Hamiltonian.
Our algorithm builds on the powerful Krylov subspace method in a way that is suitable for current quantum computers.
arXiv Detail & Related papers (2020-10-12T12:25:16Z) - Sparse-Hamiltonian approach to the time evolution of molecules on
quantum computers [0.0]
We explore the possibility of mapping the molecular problem onto a sparse Hubbard-like Hamiltonian.
This allows a Green's-function-based approach to electronic structure via a hybrid quantum-classical algorithm.
arXiv Detail & Related papers (2020-09-26T20:32:06Z)
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.