相关论文: Improving nonstoquastic quantum annealing with spi…
We propose a method for quantum state transfer in spin chains using an adiabatic passage technique. Modifying even and odd nearest-neighbour couplings in time allows to achieve transfer fidelities arbitrarily close to one, without the need…
We study the glued-trees problem of Childs et. al. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involved in the…
Quantum Annealing (QA) is one of the most promising frameworks for quantum optimization. Here, we focus on the problem of minimizing complex classical cost functions associated with prototypical discrete neural networks, specifically the…
We argue that a quantum annealer at very long annealing times is likely to experience a quasistatic evolution, returning a final population that is close to a Boltzmann distribution of the Hamiltonian at a single (freeze-out) point during…
Quantum annealers are special-purpose quantum computers that primarily target solving Ising optimization problems. Theoretical work has predicted that the probability of a quantum annealer ending in a ground state can be dramatically…
Quantum annealing has great promise in leveraging quantum mechanics to solve combinatorial optimisation problems. However, to realize this promise to it's fullest extent we must appropriately leverage the underlying physics. In this spirit,…
Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins. A critical factor that limits the success of a quantum annealer is its sensitivity to noise, and intensive research…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a…
Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the quantum approximate optimization algorithm (QAOA). These algorithms are…
Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing by replacing sequences of one- and two-qubit gates with a unitary transformation generated…
We study the weak-strong cluster problem for quantum annealing in its mean-field version as proposed by Albash [Phys. Rev. A 99 (2019) 042334] who showed by numerical diagonalization that non-stoquastic $XX$ interactions (non-stoquastic…
Quantum many-body phases offer unique properties and emergent phenomena, making them an active area of research. A promising approach for their experimental realization in model systems is to adiabatically follow the ground state of a…
Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of…
Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators, may be built with capabilities exceeding classical computers. A quantum…
Suppressing unwanted transitions out of the instantaneous ground state is a major challenge in unitary adiabatic quantum computation. A recent approach consists in building counterdiabatic potentials approximated using variational…
We consider a finite-time quantum Otto cycle with single and two-spin-$1/2$ systems as its working medium. In order to mimic adiabatic dynamics at a finite-time, we employ a shortcut-to-adiabaticity technique and evaluate the performance of…
We apply the transitionless quantum driving method to control the electron spin of a two-electron double quantum dot with spin-orbit coupling by time-dependent electric fields. The $x$ and $y$ components of applied electric fields in each…
Quantum annealing is analogous to simulated annealing with a tunneling mechanism substituting for thermal activation. Its performance has been tested in numerical simulation with mixed conclusions. There is a class of optimization problems…
We investigate a stochastic approach to non-equilibrium quantum spin systems based on recent insights linking quantum and classical dynamics. Exploiting a sequence of exact transformations, quantum expectation values can be recast as…
This work explores the relationship between optimal control theory and adiabatic passage techniques in quantum systems. The study is based on a geometric analysis of the Hamiltonian dynamics constructed from the Pontryagin Maximum…