Related papers: Improved gap dependence in adiabatic state prepara…
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…
We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to…
We consider the adiabatic quantum algorithm for systems with "no sign problem", such as the transverse field Ising mode, and analyze the equilibration time for quantum Monte Carlo (QMC) on these systems. We ask: if the spectral gap is only…
A stable and fast path linking two arbitrary states of a quantum system is generally required for state-engineering protocols, such as stimulated Raman adiabatic passage, shortcuts to adiabaticity, and holonomic transformation. Such a path…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…
Motivated by the quantum adiabatic algorithm (QAA), we consider the scaling of the Hamiltonian gap at quantum first order transitions, generally expected to be exponentially small in the size of the system. However, we show that a quantum…
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…
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes…
We develop a time-dependent real-space renormalization-group approach which can be applied to Hamiltonians with time-dependent random terms. To illustrate the renormalization-group analysis, we focus on the quantum Ising Hamiltonian with…
Adiabatic Quantum Computing relies on the quantum adiabatic theorem, which states that a quantum system evolves along its ground state with time if the governing Hamiltonian varies infinitely slowly. However, practical limitations force…
We consider quantum field theoretic systems subject to a time-dependent perturbation, and discuss the question of defining a time dependent particle number not just at asymptotic early and late times, but also during the perturbation.…
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical…
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…
There are a number of tasks in quantum information science that exploit non-transitional adiabatic dynamics. Such a dynamics is bounded by the adiabatic theorem, which naturally imposes a speed limit in the evolution of quantum systems.…
A major challenge in machine learning is the computational expense of training these models. Model training can be viewed as a form of optimization used to fit a machine learning model to a set of data, which can take up significant amount…
Adiabatic passage is a standard tool for achieving robust transfer in quantum systems. We show that, in the context of driven nonlinear Hamiltonian systems, adiabatic passage becomes highly non-robust when the target is unstable. We show…
In this thesis, it is presented a set of results in adiabatic dynamics (closed and open system) and transitionless quantum driving that promote some advances in our understanding on quantum control and Hamiltonian inverse engineering. In…
A wide variety of dissipative state preparation schemes suffer from a basic time-entanglement tradeoff: the more entangled the steady state, the slower the relaxation to the steady state. Here, we show how a minimal kind of adaptive…
We implement and characterize a numerical algorithm inspired by the $s$-source framework [Phys. Rev.~B 93, 045127 (2016)] for building a quantum many-body ground state wavefunction on a lattice of size $2L$ by applying adiabatic evolution…
Whether one is interested in quantum state preparation or in the design of efficient heat engines, adiabatic (reversible) transformations play a pivotal role in minimizing computational complexity and energy losses. Understanding the…