Related papers: Quadratic fermionic interactions yield effective H…
The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…
Zombie States are a recently introduced formalism to describe coupled coherent Fermionic states which address the Fermionic sign problem in a computationally tractable manner. Previously it has been shown that Zombie States with fractional…
We study the mixing time of a recently proposed efficiently implementable Lindbladian designed to prepare the Gibbs states in the setting of weakly interacting fermionic systems. We show that at any temperature, the Lindbladian spectral gap…
We report a ground-state solution for the two-dimensional fermionic Hubbard model, which is obtained via a numerical variational method. The two ingredients in this approach are tensor network states and the time-evolving block decimation.…
Estimating ground state energies of many-body Hamiltonians is a central task in many areas of quantum physics. In this work, we give quantum algorithms which, given any $k$-body Hamiltonian $H$, compute an estimate for the ground state…
Models of quantum computation are important because they change the physical requirements for achieving universal quantum computation (QC). For example, one-way QC requires the preparation of an entangled "cluster" state followed by…
We propose to apply stimulated adiabatic passage to transfer atoms from their ground state into Rydberg excited states. Atoms a few micrometers apart experience a dipole-dipole interaction among Rydberg states that is strong enough to shift…
We generalize the quantum adiabatic theorem to the non-Hermitian system and build a rigorous adiabaticity condition with respect to the adiabatic phase. The non-Hermitian Hamiltonian inverse engineering method is proposed for the purpose to…
Two of the most popular quantum mechanical models of interacting fermions are compared to each other and to potentially exact solutions for a pair of contact-interacting fermions trapped in a 1D double-well potential, a model of atoms in a…
Towards better understanding of how to design efficient adiabatic quantum algorithms, we study how the adiabatic gap depends on the spectra of the initial and final Hamiltonians in a natural family of test-bed examples. We show that perhaps…
We prove the existence of a unitary transformation that enables two arbitrarily given Hamiltonians in the same Hilbert space to be transformed into one another. The result is straightforward yet, for example, it lays the foundation to…
Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, $H_{\rm p}$, is normally chosen to be diagonal in the…
In this work, we consider a fundamental task in quantum many-body physics - finding and learning ground states of quantum Hamiltonians and their properties. Recent works have studied the task of predicting the ground state expectation value…
All Hamiltonian complexity results to date have been proven by constructing a local Hamiltonian whose ground state -- or at least some low-energy state -- is a "computational history state", encoding a quantum computation as a superposition…
Accurate modeling of driven light-matter interactions is essential for quantum technologies, where natural and synthetic atoms are used to store and process quantum information, mediate interactions between bosonic modes, and enable…
The Jordan-Wigner transformation maps a one-dimensional spin-1/2 system onto a fermionic model without spin degree of freedom. A double chain of quantum bits with XX and ZZ couplings of neighboring qubits along and between the chains,…
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…
Adiabatic time evolution of quantum systems is a widely used tool with applications ranging from state preparation through simplifications of computations and topological transformations to optimization and quantum computing. Adiabatic time…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv)…