Related papers: Determining probability density functions with adi…
Nonadiabatic geometric quantum computation is dedicated to the realization of high-fidelity and robust quantum gates, which are necessary for fault-tolerant quantum computation. However, it is limited by cyclic and mutative evolution path,…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for…
Quantum systems are typically subject to various environmental noise sources. Treating these environmental disturbances with a system-bath approach beyond weak coupling one must refer to numerical methods as, for example, the numerically…
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…
Distributed quantum computing has been well-known for many years as a system composed of a number of small-capacity quantum circuits. Limitations in the capacity of monolithic quantum computing systems can be overcome by using distributed…
We map adiabatic quantum evolution on the classical Hamiltonian dynamics of a 1D gas (Pechukas gas) and simulate the latter numerically. This approach turns out to be both insightful and numerically efficient, as seen from our example of a…
We describe a scheme for using an all-electrical, rapid, adiabatic population transfer between two spatially separated dots in a triple-quantum dot system. The electron spends no time in the middle dot and does not change its energy during…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
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…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems is an important objective in its own right. In many cases,…
Estimation of the coin parameter(s) is an important part of the problem of implementing more robust schemes for quantum simulation using quantum walks. We present the estimation of the quantum coin parameter used for one-dimensional…
Nonadiabatic geometric phases are only dependent on the evolution path of a quantum system but independent of the evolution details, and therefore quantum computation based on nonadiabatic geometric phases is robust against control errors.…
We study quantum dynamics of Grover's adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolutions are visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. In the training phase we identify an optimal set of weak classifiers, to form a single strong classifier. In the testing phase we…
This paper establishes the applicability of density functional theory methods to quantum computing systems. We show that ground-state and time-dependent density functional theory can be applied to quantum computing systems by proving the…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…