相关论文: A simple nearest-neighbor two-body Hamiltonian sys…
Real quantum systems couple to their environment and lose their intrinsic quantum nature through the process known as decoherence. Here we present a method for minimizing decoherence by making it energetically unfavorable. We present a…
A cluster state cannot be a unique ground state of a two-body interacting Hamiltonian. Here, we propose the creation of a cluster state of logical qubits encoded in spin-1/2 particles by adiabatically weakening two-body interactions. The…
We study aspects of the quantum and classical dynamics of a $3$-body system in 3D space with interaction depending only on mutual distances. The study is restricted to solutions in the space of relative motion which are functions of mutual…
We propose a mean to obtain computationally useful resource states also known as cluster states, for measurement-based quantum computation, via transitionless quantum driving algorithm. The idea is to cool the system to its unique ground…
The framework of measurement-based quantum computation (MBQC) allows us to view the ground states of local Hamiltonians as potential resources for universal quantum computation. A central goal in this field is to find models with ground…
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…
We implement and characterize a numerical algorithm inspired by the $s$-source framework [Phys. Rev.~B 93, 045127 (2016)] for building a quantum many-body ground state wavefunction on a lattice of size $2L$ by applying adiabatic evolution…
We construct classical algorithms computing an approximation of the ground state energy of an arbitrary $k$-local Hamiltonian acting on $n$ qubits. We first consider the setting where a good ``guiding state'' is available, which is the main…
The digital quantum simulation of lattice gauge theories is expected to become a major application of quantum computers. Measurement-based quantum computation is a widely studied competitor of the standard circuit-based approach. We…
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…
Several proposals for quantum computation utilize a lattice type architecture with qubits trapped by a periodic potential. For systems undergoing many body interactions described by the Bose-Hubbard Hamiltonian, the ground state of the…
Understanding the entanglement structure of local Hamiltonian ground spaces is a physically motivated problem, with applications ranging from tensor network design to quantum error-correcting codes. To this end, we study the complexity of…
We propose quantum-selected configuration interaction (QSCI), a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. Suppose that an…
Solving for quantum ground states is important for understanding the properties of quantum many-body systems, and quantum computers are potentially well-suited for solving for quantum ground states. Recent work has presented a nearly…
We develop a workflow to use current quantum computing hardware for solving quantum many-body problems, using the example of the fermionic Hubbard model. Concretely, we study a four-site Hubbard ring that exhibits a transition from a…
Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its…
We study the complexity of finding the ground state energy density of a local Hamiltonian on a lattice in the thermodynamic limit of infinite lattice size. We formulate this rigorously as a function problem, in which we request an estimate…
We consider error suppression schemes in which quantum information is encoded into the ground subspace of a Hamiltonian comprising a sum of commuting terms. Since such Hamiltonians are gapped they are considered natural candidates for…
We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear systems…
We consider measurement-based quantum computation using the state of a spin-lattice system in equilibrium with a thermal bath and free to evolve under its own Hamiltonian. Any single qubit measurements disturb the system from equilibrium…