Related papers: Adiabatic Quantum Simulation of Quantum Chemistry
The Kitaev honeycomb model is a system allowing for experimentally realisable quantum computation with topological protection of quantum information. Practical implementation of quantum information processing typically relies on adiabatic,…
Due to the wide range of technical applications of actinide elements, a thorough understanding of their electronic structure could complement technological improvements in many different areas. Quantum computing could greatly aid in this…
We propose applying the adiabatic algorithm to prepare high-energy eigenstates of integrable models on a quantum computer. We first review the standard adiabatic algorithm to prepare ground states in each magnetization sector of the…
Adiabatic elimination is a perturbative model reduction technique based on timescale separation and often used to simplify the description of composite quantum systems. We here analyze a quantum experiment where the perturbative expansion…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
Achieving densely connected hardware graphs is a challenge for most quantum computing platforms today, and a particularly crucial one for the case of quantum annealing applications. In this context, we present a scalable architecture for…
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand…
Determining Hamiltonian ground states and energies is a challenging task with many possible approaches on quantum computers. While variational quantum eigensolvers are popular approaches for near term hardware, adiabatic state preparation…
In this paper, we address the adiabatic technique for quantum estimation of the azimuthal orientation of a magnetic field. Exactly solving a model consisting of a two-qubit system, where one of which is driven by a static magnetic field…
A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few…
Adiabatic quantum algorithms are often most easily formulated using many-body interactions. However, experimentally available interactions are generally two-body. In 2004, Kempe, Kitaev, and Regev introduced perturbative gadgets, by which…
The need for Hamiltonians with many-body interactions arises in various applications of quantum computing. However, interactions beyond two-body are difficult to realize experimentally. Perturbative gadgets were introduced to obtain…
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical…
We propose a computational protocol for quantum simulations of Fermionic Hamiltonians on a quantum computer, enabling calculations which were previously not feasible with conventional encoding and ansatses of variational quantum…
Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
Much research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians with Hamming symmetric potentials, such as the well studied "spike" example. Due to the large amount of symmetry in these potentials such problems…
We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
In a digital quantum simulator, basic two-qubit interactions are manipulated by means of fast local control operations to establish a desired target Hamiltonian. Here we consider a quantum simulator based on logical systems, i.e. where…
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian,…