Related papers: A fast algorithm for approximating the ground stat…
The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
We propose a quantum algorithm for solving the following problem: given the Hamiltonian of a physical system and one of its eigenvalues, how to obtain the corresponding eigenstate? The algorithm is based on the resonance phenomena. For a…
Accurately determining ground-state properties of quantum many-body systems remains one of the major challenges of quantum simulation. In this work, we present a protocol for estimating the ground-state energy using only global time…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…
We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a super-quadratic speedup over the state-of-the-art quantum algorithm for…
The simulation of the dynamics of a system coupled to a low-temperature environment is a promising application of quantum computers to determine ground-state properties of physical systems. However, this approach requires not only the…
We perform a detailed resource estimate for the prospect of using deep entanglement renormalization ansatz (DMERA) on a fault-tolerant quantum computer, focusing on the regime in which the target system is large. For probing a relatively…
Ground state energy estimation in physical, chemical, and materials sciences is one of the most promising applications of quantum computing. In this work, we introduce a new hybrid approach that finds the eigenenergies by collecting…
The determination of ground state properties of quantum systems is a fundamental problem in physics and chemistry, and is considered a key application of quantum computers. A common approach is to prepare a trial ground state on the quantum…
This paper discusses a classical simulation to compute the partition function (or free energy) of generic one-dimensional quantum many-body systems. Many numerical methods have previously been developed to approximately solve…
As quantum computing technology improves and quantum computers with a small but non-trivial number of N > 100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
Current quantum computers are limited in the number of qubits and coherence time, constraining the algorithms executable with sufficient fidelity. The variational quantum eigensolver (VQE) is an algorithm to find an approximate ground state…
Quantum-classical hybrid algorithms are emerging as promising candidates for near-term practical applications of quantum information processors in a wide variety of fields ranging from chemistry to physics and materials science. We report…
Quantum computing holds immense promise for simulating quantum systems, a critical task for advancing our understanding of complex quantum phenomena. One of the primary goals in this domain is to accurately approximate the ground state of…
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…
Accurate computation of multiple eigenvalues of quantum Hamiltonians is essential in quantum chemistry, materials science, and molecular spectroscopy. Estimating excited-state energies is challenging for classical algorithms due to…
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…