Related papers: Ground States via Spectral Combing on a Quantum Co…
We propose a method for implementation of a quantum computer using artificial molecules. The artificial molecule consists of two coupled quantum dots stacked along z direction and one single electron. One-qubit and two-qubit gates are…
A quantum eigensolver is designed under a multi-layer cluster mean-field (CMF) algorithm by partitioning a quantum system into spatially-separated clusters. For each cluster, a reduced Hamiltonian is obtained after a partial average over…
Quantum simulators have the potential to shed light on the study of quantum many-body systems and materials, offering unique insights into various quantum phenomena. While adiabatic evolution has been conventionally employed for state…
Calculating the physical properties of quantum thermal states is a difficult problem for classical computers, rendering it intractable for most quantum many-body systems. A quantum computer, by contrast, would make many of these…
We explore the preparation of specific nuclear states on gate-based quantum hardware using variational algorithms. Large scale classical diagonalization of the nuclear shell model have reached sizes of $10^9 - 10^{10}$ basis states, but are…
Over the last decades, there have been many proposals for quantum computation. One of the promising candidates is adiabatic quantum computation (AQC). The central idea of AQC is about finding the ground state of a system with a problem…
Ground state counting plays an important role in several applications in science and engineering, from estimating residual entropy in physical systems, to bounding engineering reliability and solving combinatorial counting problems. While…
Reconstructing the state of a complex quantum system represents a pivotal task for all quantum information applications, both for characterization purposes and for verification of quantum protocols. Recent technological developments have…
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…
Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require development of quantum algorithms with reduced resource requirements.…
{Many-body quantum states at thermal equilibrium are ubiquitous in nature. Investigating their dynamical properties is a formidable task due to the complexity of the Hilbert space they live in. Quantum computers may have the potential to…
We propose new quantum algorithms for thermal and ground state preparation based on system-bath interactions. These algorithms require only forward evolution under a system-bath Hamiltonian in which the bath is a single reusable ancilla…
The determination of the ground state of quantum many-body systems via digital quantum computers rests upon the initialization of a sufficiently educated guess. This requirement becomes more stringent the greater the system. Preparing…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
Complex quantum simulation workflows are often hindered by incompatible wavefunction representations adopted across different algorithmic frameworks. In particular, the mismatch between the first- and second-quantization formalisms prevents…
The widespread use of the noninteracting ground state as the initial state for the digital quantum simulation of the Fermi-Hubbard model is largely due to the scarcity of alternative easy-to-prepare approximations to the exact ground state…
Hamiltonian simulation is a domain where quantum computers have the potential to outperform their classical counterparts. One of the main challenges of such quantum algorithms is increasing the system size, which is necessary to achieve…
Digital quantum simulation of electron-phonon systems requires truncating infinite phonon levels into $N$ basis states and then encoding them with qubit computational basis. Unary encoding and the more compact binary/Gray encoding are the…
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…
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,…