Related papers: Quantum adiabatic elimination at arbitrary order f…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…
Efficient descriptions of open quantum systems can be obtained by performing an adiabatic elimination of the fast degrees of freedom and formulating effective operators for the slow degrees of freedom in reduced dimensions. Here, we perform…
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 subtraction is a popular method of renormalization of observables in quantum field theories on a curved spacetime. When applied to the computation of the power spectra of light ($m\ll H$) fields on de Sitter space with flat…
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…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing his challenge by using coherently controlled…
Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic…
Among various algorithms designed to exploit the specific properties of quantum computers with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to find the minimal value of an arbitrary cost function…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
Combinatorial optimization problems are crucial for widespread applications but remain difficult to solve on a large scale with conventional hardware. Novel optical platforms, known as coherent or photonic Ising machines, are attracting…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…
We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The…
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…
Different techniques to speed up quantum adiabatic processes are currently being explored for applications in atomic, molecular and optical physics, such as transport, cooling and expansions, wavepacket splitting, or internal state control.…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
The adiabatic theorem refers to a setup where an evolution equation contains a time-dependent parameter whose change is very slow, measured by a vanishing parameter $\epsilon$. Under suitable assumptions the solution of the…
We investigate the adiabatic elimination of fast variables in relativistic stochastic mechanics, which is analyzed by using the equation of motion and the distribution function, with relativistic corrections explicitly derived. A new…