Related papers: Spin networks on adiabatic quantum computer
We introduce a simple framework for estimating lower bounds on the runtime of a broad class of adiabatic quantum algorithms. The central formula consists of calculating the variance of the final Hamiltonian with respect to the initial…
We describe an adiabatic state transfer mechanism that allows for high-fidelity transfer of a microwave quantum state from one cavity to another through an optical fiber. The conversion from microwave frequency to optical frequency is…
We present a theory of conducting quantum networks that accounts for Abelian and non-Abelian fields acting on spin carriers. We apply this approach to model the conductance of mesoscopic spin interferometers of different geometry (such as…
A spin network is a generalization of a knot or link: a graph embedded in space, with edges labelled by representations of a Lie group, and vertices labelled by intertwining operators. Such objects play an important role in 3-dimensional…
A scalable superconducting architecture for adiabatic quantum computers is proposed. The architecture is based on time-independent, nearest-neighbor interqubit couplings: it can handle any problem in the class NP even in the presence of…
We study the adiabatic approximation of the dynamics of a bipartite quantum system with respect to one of the components, when the coupling between its two components is perturbative. We show that the density matrix of the considered…
We introduce a geometric framework for efficient few-parameter pulse optimization in multi-level quantum systems, enabling high-fidelity state transfer beyond the adiabatic limit. Our method interpolates smoothly between adiabatic and…
Adiabatic process has found many important applications in modern physics, the distinct merit of which is that it does not need accurate control over the timing of the process. However, it is a slow process, which limits the application in…
The ability to efficiently prepare ground states of quantum Hamiltonians via adiabatic protocols is typically limited by the smallest energy gap encountered during the quantum evolution. This presents a key obstacle for quantum simulation…
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…
Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers…
We discuss applications of shortcuts to adiabaticity (STA) to adiabatic quantum computation. After reviewing the fundamental properties and the present status of STA from the author's personal point of view, we apply the method to the…
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…
Through the introduction of a new electron spin transport mechanism, a 2D donor electron spin quantum computer architecture is proposed. This design addresses major technical issues in the original Kane design, including spatial…
Adiabatic processes in the quantum Ising model and the anisotropic Heisenberg model are discussed. The adiabatic processes are assumed to consist in the slow variation of the strength of the magnetic field that environs the spin-systems.…
We propose a spin manipulation technique based entirely on electric fields applied to acceptor states in $p$-type semiconductors with spin-orbit coupling. While interesting in its own right, the technique can also be used to implement…
It has recently been shown that a parametrically driven oscillator with Kerr nonlinearity yields a Schr\"odinger cat state via quantum adiabatic evolution through its bifurcation point and a network of such nonlinear oscillators can be used…
We propose applying the adiabatic algorithm to prepare high-energy eigenstates of integrable models on a quantum computer. We first review the standard adiabatic algorithm to prepare ground states in each magnetization sector of the…
We show that adiabatic evolution of a low-dimensional lattice of quantum spins with a spectral gap can be simulated efficiently. In particular, we show that as long as the spectral gap \Delta E between the ground state and the first excited…
Eigenstate filters underpin near-optimal quantum algorithms for ground state preparation. Their realization on current quantum computers, however, poses a challenge as the filters are typically represented by deep quantum circuits.…