Related papers: An Oracle-Free Quantum Algorithm for Nonadiabatic …
We develop a unified quantum geometric framework to understand reactive quantum dynamics. The critical roles of the quantum geometry of adiabatic electronic states in both adiabatic and non-adiabatic quantum dynamics are unveiled. A…
The main challenges in achieving high-fidelity quantum gates are to reduce the influence of control errors caused by imperfect Hamiltonians and the influence of decoherence caused by environment noise. To overcome control errors, a…
We introduce a digital-analog quantum computing framework that enables counterdiabatic protocols to be implemented at constant circuit depth, allowing fast and resource-efficient quantum state preparation on current quantum hardware.…
We propose a hybrid classical-quantum digitized-counterdiabatic algorithm to tackle the protein folding problem on a tetrahedral lattice. Digitized-counterdiabatic quantum computing is a paradigm developed to compress quantum algorithms via…
We propose a new variant of the controlled-NOT quantum logic gate based on adiabatic level-crossing dynamics of the q-bits. The gate has a natural implementation in terms of the Cooper pair transport in arrays of small Josephson tunnel…
Exact nonadiabatic quantum evolution preserves many geometric properties of the molecular Hilbert space. In a companion paper [S. Choi and J. Van\'{\i}\v{c}ek, 2019], we presented numerical integrators of arbitrary-order of accuracy that…
This paper is devoted to a generalisation of the quantum adiabatic theorem to a nonlinear setting. We consider a Hamiltonian operator which depends on the time variable and on a finite number of parameters and acts on a separable Hilbert…
Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…
Nonadiabatic holonomic quantum computation (NHQC) has attracted significant attention due to its fast evolution and the geometric nature induced resilience to local noises. However, its long operation time and complex physical…
Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…
A numerical method is proposed for simulation of composite open quantum systems. It is based on Lindblad master equations and adiabatic elimination. Each subsystem is assumed to converge exponentially towards a stationary subspace, slightly…
We propose a novel method to describe realistically ionization processes with absorbing boundary conditions in basis expansion within the formalism of the so-called Non-Adiabatic Quantum Molecular Dynamics. This theory couples…
Nonadiabatic dynamical processes are one of the most important quantum mechanical phenomena in chemical, materials, biological, and environmental molecular systems, where the coupling between different electronic states is either inherent…
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…
We extend the concept of superadiabatic dynamics, or transitionless quantum driving, to quantum open systems whose evolution is governed by a master equation in the Lindblad form. We provide the general framework needed to determine the…
We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this…
We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…
We propose a method to produce fast transitionless dynamics for finite-dimensional quantum systems without requiring additional Hamiltonian components not included in the initial control setup, remaining close to the true adiabatic path at…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…