Related papers: Analysis and limitations of modified circuit-to-Ha…
Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state…
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
Rydberg-atom quantum simulators are of keen interest because of their possibilities towards high-dimensional qubit architectures. Here we report three-dimensional conformation spectra of quantum-Ising Hamiltonian systems with programmed…
Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the…
We discuss the application of the adiabatic perturbation theory to analyze the dynamics in various systems in the limit of slow parametric changes of the Hamiltonian. We first consider a two-level system and give an elementary derivation of…
The exponential speedups promised by Hamiltonian simulation on a quantum computer depends crucially on structure in both the Hamiltonian $\hat{H}$, and the quantum circuit $\hat{U}$ that encodes its description. In the quest to better…
For a class of Hamiltonians of $XXZ$ spin chains in a uniform external magnetic field that are small quantum perturbations of an Ising Hamiltonian, it is shown that the spectral gap above the ground-state energy remains strictly positive…
A method of fundamental solutions has been used to study adiabatic transition amplitudes in two energy level systems for a class of Hamiltonians allowing some simplifications of Stokes graphs corresponding to such transitions. It has been…
We prove the validity of linear response theory at zero temperature for perturbations of gapped Hamiltonians describing interacting fermions on a lattice. As an essential innovation, our result requires the spectral gap assumption only for…
Certain gauge transformations may act non-trivially on physical states in quantum electrodynamics (QED). This observation has sparked the yet unresolved question of how to characterize allowed boundary conditions for gauge theories. Faddeev…
The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block-encodings…
We prove that adiabatic computation is equivalent to standard quantum computation even when the adiabatic quantum system is restricted to be a set of particles on a one-dimensional chain. We give a construction that uses a 2-local…
We introduce a shortcut to the adiabatic gate teleportation model of quantum computation. More specifically, we determine fast local counterdiabatic Hamiltonians able to implement teleportation as a universal computational primitive. In…
We apply the method of transitionless quantum driving for time-dependent quantum systems to spin systems. For a given Hamiltonian, the driving Hamiltonian is constructed so that the adiabatic states of the original system obey the…
In the context of adiabatic quantum computation (AQC), it has been argued that first-order quantum phase transitions (QPTs) due to localisation phenomena cause AQC to fail by exponentially decreasing the minimal spectral gap of the…
Random quantum circuits are a central concept in quantum information theory with applications ranging from demonstrations of quantum computational advantage to descriptions of scrambling in strongly-interacting systems and black holes. The…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
We demonstrate the possibility of (sub)exponential quantum speedup via a quantum algorithm that follows an adiabatic path of a gapped Hamiltonian with no sign problem. This strengthens the superpolynomial separation recently proved by…
The identification of parameters in the Hamiltonian that describes complex many-body quantum systems is generally a very hard task. Recent attention has focused on such problems of Hamiltonian tomography for networks constructed with…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…