Related papers: Stochastic quantum adiabatic algorithm with fracti…
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…
The success of adiabatic quantum computation (AQC) depends crucially on the ability to maintain the quantum computer in the ground state of the evolution Hamiltonian. The computation process has to be sufficiently slow as restricted by 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…
Validity conditions for the adiabatic approximation are useful tools to understand and predict the quantum dynamics. Remarkably, the resonance phenomenon in oscillating quantum systems has challenged the adiabatic theorem. In this scenario,…
Counterdiabatic driving emerges as a valuable technique for implementing shortcuts to adiabaticity protocols, enhancing quantum technology applications. In this context, counterdiabatic quantum computing represents a new paradigm with the…
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…
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 quantum annealers encounter scalability challenges due to exponentially fast diminishing energy gaps between ground and excited states with qubit-count increase. This introduces errors in identifying ground states compounded by a…
Adiabatic control is a fundamental technique for manipulating quantum systems, guided by the quantum adiabatic theorem, which ensures suppressed nonadiabatic transitions under slow parameter variations. Quantum annealing, a heuristic…
Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long…
Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the…
Physical implementations of quantum computation must be scrutinized about their reliability under real conditions, in order to be considered as viable candidates. Among the proposed models, those based on adiabatic quantum dynamics have…
In this paper, we study a class of dissipative stochastic differential equations driven by nonlinear multiplicative fractional Brownian noise with Hurst index $H \in \left(\frac{1}{3},\frac{1}{2})\cup(\frac{1}{2}, 1\right) $. We establish…
Stochastic calculus with respect to fractional Brownian motion (fBm) has attracted a lot of interest in recent years, motivated in particular by applications in finance and Internet traffic modeling. Multifractional Brownian motion (mBm) is…
We present a new technique for efficiently transitioning a quantum system from an initial to a final stationary state in less time than is required by an adiabatic (quasi-static) process. Our approach makes use of Nelson's stochastic…
We investigate the symmetry breaking role of noise in adiabatic quantum computing using the example of the CNOT gate. In particular, we analyse situations where the choice of initial configuration leads to symmetries in the Hamiltonian and…
In quantum adiabatic algorithm, as the adiabatic parameter $s(t)$ changes slowly from zero to one with finite rate, a transition to excited states inevitably occurs and this induces an intrinsic computational error. We show that this…
We investigate synchronization by noise for stochastic differential equations (SDEs) driven by a fractional Brownian motion (fbm) with Hurst index $H\in(0,1)$. Provided that the SDE has a negative top Lyapunov exponent, we show that a weak…
Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialised state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible.…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…