Related papers: Projection based adiabatic elimination of bipartit…
Background: Solving nuclear many-body problems with an ab initio approach is widely recognized as a computationally challenging problem. Quantum computers offer a promising path to address this challenge. There are urgent needs to develop…
It is believed that the presence of anticrossings with exponentially small gaps between the lowest two energy levels of the system Hamiltonian, can render adiabatic quantum optimization inefficient. Here, we present a simple adiabatic…
We propose an adiabatic-elimination formalism in the dispersive regime based on a transition-centric perturbation theory. The perturbative expansion is recast into a diagrammatic framework, while adiabatic elimination is implemented through…
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…
According to the quantum adiabatic theorem, we can in principle obtain a true vacuum of a quantum system starting from a trivial vacuum of a simple Hamiltonian. In actual adiabatic digital quantum simulation with finite time length and…
We present a comprehensive review of past research into adiabatic quantum computation and then propose a scalable architecture for an adiabatic quantum computer that can treat NP-hard problems without requiring local coherent operations.…
Adiabatic elimination is a standard tool in quantum optics, which produces an effective Hamiltonian for a relevant subspace of states, incorporating effects of its coupling to states with much higher unperturbed energy. It shares with…
Adiabatic techniques are known to allow for engineering quantum states with high fidelity. This requirement is currently of large interest, as applications in quantum information require the preparation and manipulation of quantum states…
We present a method for accelerating adiabatic protocols for systems involving a coupling to a continuum, one that cancels both non-adiabatic errors as well as errors due to dissipation. We focus on applications to a generic quantum state…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…
We present a robust pulse optimization method for adiabatic population transfer and adiabatic quantum computation. The approach relies on identifying control pulses that keep the evolving quantum system close to its instantaneous ground…
Shortcuts to adiabaticity (STA) are powerful quantum control methods, allowing quick evolution into target states of otherwise slow adiabatic dynamics. Such methods have widespread applications in quantum technologies, and various STA…
Shortcuts to adiabaticity are alternative fast processes which reproduce the same final state as the adiabatic process in a finite or even shorter time, which have been extended from Hermitian systems to non-Hermitian systems in recent…
Dimensionality reduction is the fundamental problem for machine learning and pattern recognition. During data preprocessing, the feature selection is often demanded to reduce the computational complexity. The problem of feature selection is…
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…
We work out the theory and applications of a fast quasi-adiabatic approach to speed up slow adiabatic manipulations of quantum systems by driving a control parameter as near to the adiabatic limit as possible over the entire protocol…
The two-level quantum system (qubit) in a precessing magnetic field and in contact with a heat bath is investigated. The exact reduced dynamics for the qubit in question is obtained. We apply the approach based on the block operator…
The adiabatic theorem is a fundamental result established in the early days of quantum mechanics, which states that a system can be kept arbitrarily close to the instantaneous ground state of its Hamiltonian if the latter varies in time…
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…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…