Related papers: Nearly-frustration-free ground state preparation
The local Hamiltonian problem consists of estimating the ground-state energy (given by the minimum eigenvalue) of a local quantum Hamiltonian. First, we show the existence of a good product-state approximation for the ground-state energy of…
We propose quantum algorithms for projective ground-state preparation and calculations of the many-body Green's functions directly in frequency domain. The algorithms are based on the linear combination of unitary (LCU) operations and…
A method is presented in which the ground-state subspace is projected out of a Hamiltonian representation. As a result of this projection, an effective Hamiltonian is constructed where its ground-state coincides with an excited-state of the…
Ground states of local Hamiltonians are of key interest in many-body physics and also in quantum information processing. Efficient verification of these states are crucial to many applications, but very challenging. Here we propose a…
We study the problems of state preparation, ground state preparation and quantum state preparation. We propose an analytic approach to a stochastic quantum algorithm which prepares the ground state for $n$-qubit Hamiltonian that is…
For any local Hamiltonian H, I construct a local CPT map and stopping condition which converges to the ground state subspace of H. Like any ground state preparation algorithm, this algorithm necessarily has exponential run-time in general…
The existence of definite orders in frustrated quantum systems is related rigorously to the occurrence of fully factorized ground states below a threshold value of the frustration. Ground-state separability thus provides a natural measure…
Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which…
We propose a framework to design concurrently a frustration-free quantum many-body Hamiltonian and its numerically exact ground states on a sufficiently large finite-size cluster in one and two dimensions using an elementary matrix product…
Quantum computing offers potential solutions for finding ground states in condensed-matter physics and chemistry. However, achieving effective ground state preparation is also computationally hard for arbitrary Hamiltonians. It is necessary…
The task of estimating the ground state of Hamiltonians is an important problem in physics with numerous applications ranging from solid-state physics to combinatorial optimization. We provide a hybrid quantum-classical algorithm for…
The stabilizer ground state is defined is the lowest energy stabilizer state with respect to a given Hamiltonian. In many cases it is highly degenerate and does not give a unique stabilizer state. We define the optimal stabilizer ground…
We prove stability of the spectral gap for gapped, frustration-free Hamiltonians under general, quasi-local perturbations. We present a necessary and sufficient condition for stability, which we call "Local Topological Quantum Order" and…
Utilizing quantum computer to investigate quantum chemistry is an important research field nowadays. In addition to the ground-state problems that have been widely studied, the determination of excited-states plays a crucial role in the…
We show that semi-classical states adapted to the symmetry of the Hamiltonian are an excellent approximation to the exact quantum solution of the ground and first excited states of the Dicke model. Their overlap to the exact quantum states…
Solving the ground state and the ground-state properties of quantum many-body systems is generically a hard task for classical algorithms. For a family of Hamiltonians defined on an $m$-dimensional space of physical parameters, the ground…
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a…
Describing matter at near absolute zero temperature requires understanding a system's quantum ground state and the low energy excitations around it, the quasiparticles, which are thermally populated by the system's contact to a heat bath.…
Quantum computing has the potential to transform simulations of quantum many-body problems at the heart of electronic structure theory. Efficient quantum algorithms to compute the eigenstates of fermionic Hamiltonians, such as quantum phase…