Related papers: Quantum Adiabatic Brachistochrone
Adiabatic optimal control schemes are essential for advancing the practical implementation of quantum technologies. However, the vast array of possible adiabatic protocols, combined with their dependence on the particular quantum system and…
A unitary evolution in time may be treated as a curve in the manifold of the special unitary group. The length of such a curve can be related to the energetic cost of the associated computation, meaning a geodesic curve identifies an…
Nonadiabatic geometric quantum computation (NGQC) has been developed to realize fast and robust geometric gate. However, the conventional NGQC is that all of the gates are performed with exactly the sameamount of time, whether the geometric…
Adiabatic elimination is a perturbative model reduction technique based on timescale separation and often used to simplify the description of composite quantum systems. We here analyze a quantum experiment where the perturbative expansion…
Quantum annealing (QA) is a promising approach for not only solving combinatorial optimization problems but also simulating quantum many-body systems such as those in condensed matter physics. However, non-adiabatic transitions constitute a…
Adiabatic protocols are employed across a variety of quantum technologies, from implementing state preparation and individual operations that are building blocks of larger devices, to higher-level protocols in quantum annealing and…
On-the-fly quantum nonadiabatic dynamics for large systems greatly benefits from the adiabatic representation readily available from the electronic structure programs. However, frequently occurring in this representation conical…
The parametric deformations of quasienergies and eigenvectors of unitary operators are applied to the design of quantum adiabatic algorithms. The conventional, standard adiabatic quantum computation proceeds along eigenenergies of…
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this…
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization…
We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly compare computational devices at vastly different stages of…
Quantum control plays an irreplaceable role in practical use of quantum computers. However, some challenges have to be overcome to find more suitable and diverse control parameters. We propose a promising and generalizable…
We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup relative to classical state of the art methods in combinatorial optimization and related sampling tasks. We argue for…
Achieving fast, excitation-free quantum control is a vital challenge in modern quantum technologies. In many cases, shortcuts to adiabaticity enable fast adiabatic-like protocols, yet determining control parameters that satisfy practical…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
Adiabatic quantum computation (AQC) is known to possess some intrinsic robustness, though it is likely that some form of error correction will be necessary for large scale computations. Error handling routines developed for circuit-model…
The adiabatic theorem states that when the time evolution of the Hamiltonian is "infinitely slow", a system, when started in the ground state, remains in the instantaneous ground state at all times. This, however, does not mean that the…
The challenge in building high-fidelity quantum gates lies in overcoming control errors and decoherence effects caused by the coupling between the quantum system and the external environment. Nonadiabatic holonomic quantum computation uses…
We discuss the energetic cost of superadiabatic models of quantum computation. Specifically, we investigate the energy-time complementarity in general transitionless controlled evolutions and in shortcuts to the adiabatic quantum search…
We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to…