Related papers: Computing the molecular ground state energy in a r…
We present experimental quantum computation of the ground-state energy in a 103-site flat Kagome lattice under the antiferromagnetic Heisenberg model (KAFH), with IBM's Heron r1 and Heron r2 quantum processors. For spin-1/2 KAFH, our…
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…
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…
Quantum annealing devices have been subject to various analyses in order to classify their usefulness for practical applications. While it has been successfully proven that such systems can in general be used for solving combinatorial…
A significant challenge in quantum annealing is to map a real-world problem onto a hardware graph of limited connectivity. If the maximum degree of the problem graph exceeds the maximum degree of the hardware graph, one employs minor…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a…
Preparing ground states of Hamiltonians is important in the condensed matter physics and the quantum chemistry. The interaction Hamiltonians typically contain not only diagonal but also off-diagonal elements. Although quantum annealing…
Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a very challenging task for classical computers. Here, we develop a quantum annealing scheme to solve this problem. First, the task of finding the…
Considering recent advancements and successes in the development of efficient quantum algorithms for electronic structure calculations --- alongside impressive results using machine learning techniques for computation --- hybridizing…
Under suitable assumptions, the algorithms in [Lin, Tong, Quantum 2020] can estimate the ground state energy and prepare the ground state of a quantum Hamiltonian with near-optimal query complexities. However, this is based on a block…
We present a novel method for improving the quantum simulation of the ground state energy of molecules. We perform a pre-processing step classically, which reduces the dimensionality of the problem by generating a custom mapping which…
Quantum optimization algorithms offer a promising route to finding the ground states of target Hamiltonians on near-term quantum devices. None the less, it remains necessary to limit the evolution time and circuit depth as much as possible,…
The ground state of second-quantized quantum chemistry Hamiltonians is key to determining molecular properties. Neural quantum states (NQS) offer flexible and expressive wavefunction ansatze for this task but face two main challenges:…
We use superconducting qubit quantum annealing devices to determine the ground state of Ising models with algebraically decaying competing long-range interactions in the thermodynamic limit. This is enabled by a unit-cell-based optimization…
Quantum computers are ideal for solving chemistry problems due to their polynomial scaling with system size in contrast to classical computers which scale exponentially. Until now molecular energy calculations using quantum computing…
Quantum computers hold promise to circumvent the limitations of conventional computing for difficult molecular problems. However, the accumulation of quantum logic errors on real devices represents a major challenge, particularly in the…
An iterative version of the qubit coupled cluster (QCC) method [I.G. Ryabinkin et al., J. Chem. Theory Comput. 14, 6317 (2019)] is proposed. The new method seeks to find ground electronic energies of molecules on noisy intermediate-scale…
Quantum annealing aims at solving hard computational problems through adiabatic state preparation. Here, I propose to use inhomogeneous longitudinal magnetic fields to enhance the efficiency of the annealing. Such fields are able to bias…
Quantum computing leverages the quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical computers. Examples include calculating molecular and nuclear structure,…
As quantum computing approaches its first commercial implementations, quantum simulation emerges as a potentially ground-breaking technology for several domains, including Biology and Chemistry. However, taking advantage of quantum…