Related papers: Filter-enhanced adiabatic quantum computing on a d…
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These…
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…
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…
Several Bayesian estimation based heuristics have been developed to perform quantum state tomography (QST). Their ability to quantify uncertainties using region estimators and include a priori knowledge of the experimentalists makes this…
Preparing the ground state of a local Hamiltonian is a crucial problem in understanding quantum many-body systems, with applications in a variety of physics fields and connections to combinatorial optimization. While various quantum…
Quantum computers are a highly promising tool for efficiently simulating quantum many-body systems. The preparation of their eigenstates is of particular interest and can be addressed, e.g., by quantum phase estimation algorithms. The…
Digitized adiabatic quantum factorization is a hybrid algorithm that exploits the advantage of digitized quantum computers to implement efficient adiabatic algorithms for factorization through gate decompositions of analog evolutions. In…
A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of…
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement…
Quantum phase transitions materialize as level crossings in the ground-state energy when the parameters of the Hamiltonian are varied. The resulting ground-state phase diagrams are straightforward to determine by exact diagonalization on…
Quantum error mitigation is essential for computing on the noisy quantum computer with a limited number of qubits. In this paper, we propose a practical protocol of error mitigation by virtually purifying the quantum state without qubit…
Accurate state preparation is a critical bottleneck in many quantum algorithms, particularly those for ground state energy estimation. Even in fault-tolerant quantum computing, preparing a quantum state with sufficient overlap to the…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
Quantum computing promises to efficiently and accurately solve many important problems in quantum chemistry which elude classical solvers, such as the electronic structure problem of highly correlated materials. Two leading methods in…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating…
Adiabatic process has found many important applications in modern physics, the distinct merit of which is that it does not need accurate control over the timing of the process. However, it is a slow process, which limits the application in…
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…