Related papers: Quadratic fermionic interactions yield effective H…
Recent work has highlighted that the strong correlation inherent in spin Hamiltonians can be effectively reduced by mapping spins to fermions via the Jordan-Wigner transformation (JW). The Hartree-Fock method is straightforward in the…
We propose a method for the realization of the two-qubit quantum Fourier transform (QFT) using a Hamiltonian which possesses the circulant symmetry. Importantly, the eigenvectors of the circulant matrices are the Fourier modes and do not…
The Jordan-Wigner transformation establishes a duality between $su(2)$ and fermionic algebras. We present qualitative arguments and numerical evidence that when mapping spins to fermions, the transformation makes strong correlation weaker,…
Euclidean time projection is a powerful tool that uses exponential decay to extract the low-energy information of quantum systems. The adiabatic projection method, which is based on Euclidean time projection, is a procedure for studying…
Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting…
While general quantum many-body systems require exponential resources to be simulated on a classical computer, systems of non-interacting fermions can be simulated exactly using polynomially scaling resources. Such systems may be of…
It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the 2-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions…
In digital quantum simulation of fermionic models with qubits, non-local maps for encoding are often encountered. Such maps require linear or logarithmic overhead in circuit depth which could render the simulation useless, for a given…
We prove an adiabatic theorem for general densities of observables that are sums of local terms in finite systems of interacting fermions, without periodicity assumptions on the Hamiltonian and with error estimates that are uniform in the…
Many-body entangled quantum states studied in condensed matter physics can be primary resources for quantum information, allowing any quantum computation to be realized using measurements alone, on the state. Such a universal state would be…
We propose a method of simulating efficiently many-body interacting fermion lattice models in trapped ions, including highly nonlinear interactions in arbitrary spatial dimensions and for arbitrarily distant couplings. We map products of…
We illustrate the adiabatic quantum computing solution of the knapsack problem with both integer profits and weights. For problems with $n$ objects (or items) and integer capacity $c$, we give specific examples using both an Ising class…
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…
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum…
Feynman's circuit-to-Hamiltonian construction connects quantum computation and ground states of many-body quantum systems. Kitaev applied this construction to demonstrate QMA-completeness of the local Hamiltonian problem, and Aharanov et…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…
The Fermi-Hubbard model (FHM) on a two dimensional square lattice has long been an important testbed and target for simulating fermionic Hamiltonians on quantum hardware. We present an alternative for quantum simulation of FHMs based on an…
Gate-based quantum computers can in principle simulate the adiabatic dynamics of a large class of Hamiltonians. Here we consider the cyclic adiabatic evolution of a parameter in the Hamiltonian. We propose a quantum algorithm to estimate…
We describe a many-body quantum system which can be made to quantum compute by the adiabatic application of a large applied field to the system. Prior to the application of the field quantum information is localized on one boundary of the…
The success of adiabatic quantum computation (AQC) depends crucially on the ability to maintain the quantum computer in the ground state of the evolution Hamiltonian. The computation process has to be sufficiently slow as restricted by the…