Related papers: Adiabatic Quantum Computation
We reveal universal dynamical scaling behavior across adiabatic quantum phase transitions (QPTs) in networks ranging from traditional spatial systems (Ising model) to fully connected ones (Dicke and Lipkin-Meshkov-Glick models). Our…
Understanding how non-adiabatic terms affect quantum dynamics is fundamental to improving various protocols for quantum technologies. We present a novel approach to computing the Adiabatic Gauge Potential (AGP), which gives information on…
We introduce an adiabatic perturbation theory for quantum systems with degenerate energy spectra. This perturbative series enables one to rigorously establish conditions for the validity of the adiabatic theorem of quantum mechanics for…
The adiabatic theorem states that an initial eigenstate of a slowly varying Hamiltonian remains close to an instantaneous eigenstate of the Hamiltonian at a later time. We show that a perfunctory application of this statement is problematic…
Big Data is characterized by Volume, Velocity, Veracity and Complexity. The interaction between this huge data is complex with an associated free will having dynamic and non linear nature. We reduced big data based on its characteristics,…
Shortcuts to adiabaticity (STA) are fast methods to realize the same final state evolution of quantum adiabatic process. We develop a general theory to construct a new kind of STA by solely sampling the points of the adiabatic path of the…
Quantum annealing is guaranteed to find the ground state of optimization problems in the adiabatic limit. Recent work [Phys. Rev. X 6, 031010 (2016)] has found that for some barrier tunneling problems, quantum annealing can be run much…
Adiabatic quantum computation (AQC) is a universal model for quantum computation which seeks to transform the initial ground state of a quantum system into a final ground state encoding the answer to a computational problem. AQC initial…
In this paper, we study two different nonlinear interpolating paths in adiabatic evolution algorithms for solving a particular class of quantum search problems where both the initial and final Hamiltonian are one-dimensional projector…
Designing quantum algorithms with a speedup over their classical analogs is a central challenge in quantum information science. Motivated by recent experimental observations of a superlinear quantum speedup in solving the Maximum…
A quadratic speedup of the quantum adiabatic algorithm (QAA) for finding independent sets (ISs) in a graph is proven analytically. In comparison to the best classical algorithm with $O(n^2)$ scaling, where $n$ is the number of vertexes, our…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
We develop an adiabatic theory for generators of contracting evolution on Banach spaces. This provides a uniform framework for a host of adiabatic theorems ranging from unitary quantum evolutions through quantum evolutions of open systems…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in [E. Farhi, et al., arXiv:quant-ph/0208135]. The algorithm is applied to a random binary optimization problem (a version…
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present…
Gauge theory is the framework of the Standard Model of particle physics and is also important in condensed matter physics. As its major non-perturbative approach, lattice gauge theory is traditionally implemented using Monte Carlo…
We present a new theorem describing stable solutions for a driven quantum system. The theorem, coined `inertial theorem', is applicable for fast driving, provided the acceleration rate is small. The theorem states that in the inertial limit…
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,…
The simulation of adiabatic evolution has deep connections with Adiabatic Quantum Computation, the Quantum Approximate Optimization Algorithm and adiabatic state preparation. Here we address the error analysis problem in quantum simulation…