Related papers: Extracting vacuum expectation values from approxim…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
An important class of physical systems that are of interest in practice are input-output open quantum systems that can be described by quantum stochastic differential equations and defined on an infinite-dimensional underlying Hilbert…
The adiabatic approximation exhibits wide applicability in quantum mechanics, providing a simple approach for nontransitional dynamics in quantum systems governed by slowly varying time-dependent Hamiltonians. However, the standard…
We discuss in this chapter the basics of adiabatic computation, as well as some physical implementations. After a short introduction of the quantum circuit model, we describe quantum adiabatic computation, quantum annealing, and the strong…
The theoretical analysis of the Adiabatic Quantum Computation protocol presents several challenges resulting from the difficulty of simulating, with classical resources, the unitary dynamics of a large quantum device. We present here a…
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
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…
Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $\epsilon$ in Heisenberg-limited time $T=\Theta(1/\epsilon)$. Standard gate-based implementations of QPE require…
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…
We argue the feasibility to study the phase structure of a quantum physical system on quantum devices via adiabatic preparation of states. We introduce a novel method and successfully test it in application to the Schwinger model in the…
Understanding the thermodynamic properties of quantum systems is essential for developing energy-efficient quantum technologies. In this regard, this work explores the application of quantum computational methods to study the quantum…
In relativistic field theories, the mass spectrum is given by the difference between the energy of the vacuum and the excited states. Near the continuum limit, the cancellation between these two values leads to loss of precision. We propose…
We introduce the prodiabatic elimination, a powerful approximation technique that systematically extends the adiabatic elimination of fast degrees of freedom in light-matter coupled systems. Through a controlled expansion of operators, the…
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to…
Feedback in compound quantum systems is effected by using the output from one sub-system (``the system'') to control the evolution of a second sub-system (``the ancilla'') which is reversibly coupled to the system. In the limit where the…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
We introduce a novel hybrid quantum-classical algorithm for the near-term computation of expectation values in quantum systems at finite temperatures. This is based on two stages: on the first one, a mixed state approximating a fiducial…
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this…