Related papers: An Integrated Programming and Development Environm…
Physical implementations of quantum computation must be scrutinized about their reliability under real conditions, in order to be considered as viable candidates. Among the proposed models, those based on adiabatic quantum dynamics have…
Adiabatic quantum optimization has been proposed as a route to solve NP-complete problems, with a possible quantum speedup compared to classical algorithms. However, the precise role of quantum effects, such as entanglement, in these…
We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic…
Existing quantum discrete adiabatic approaches are hindered by circuit depth that increases linearly with the number of evolution steps, a significant challenge for current quantum hardware with limited coherence times. To address this, we…
Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. In this work, we address such problems…
For adiabatic controls of quantum systems, the non-adiabatic transitions are reduced by increasing the operation time of processes. Perfect quantum adiabaticity usually requires the infinitely slow variation of control parameters. In this…
Adiabatic techniques are known to allow for engineering quantum states with high fidelity. This requirement is currently of large interest, as applications in quantum information require the preparation and manipulation of quantum states…
We present a quantum algorithm for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. Our algorithm digitally simulates the adiabatic evolution between two self-adjoint…
We introduce the prodiabatic elimination, a powerful approximation technique that systematically extends the adiabatic elimination of fast degrees of freedom in light-matter coupled systems. Through a controlled expansion of operators, the…
In this work we integrate the variational quantum eigensolver (VQE) with the adiabatic connection (AC) method for efficient simulations of chemical problems on near-term quantum computers. Orbital optimized VQE methods are employed to…
The application of adiabatic protocols in quantum technologies is severely limited by environmental sources of noise and decoherence. Shortcuts to adiabaticity by counterdiabatic driving constitute a powerful alternative that speed up…
Nonadiabatic geometric quantum computation provides a means to perform fast and robust quantum gates. It has been implemented in various physical systems, such as trapped ions, nuclear magnetic resonance and superconducting circuits.…
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…
A shortcut-to-adiabaticity is compared with a numerically optimized protocol for implementing a high-fidelity quantum gate on Rydberg atoms. The counterdiabatic method offers an analytical framework for accelerating high-fidelity gates by…
Gate-based quantum computers can in principle simulate the adiabatic dynamics of a large class of Hamiltonians. Here we consider the cyclic adiabatic evolution of a parameter in the Hamiltonian. We propose a quantum algorithm to estimate…
The evaluation of the performance of adiabatic annealers is hindered by lack of efficient algorithms for simulating their behaviour. We exploit the analyticity of the standard model for the adiabatic quantum process to develop an efficient…
Integer factorization remains a significant challenge for classical computers and is fundamental to the security of RSA encryption. Adiabatic quantum algorithms present a promising solution, yet their practical implementation is limited by…
The increasing scale and nonlinearity of modern energy and power system problems pose significant challenges to classical numerical solvers. In parallel, advances in quantum and quantum-inspired hardware are expected to improve scalability…
Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of…
We explore to what extent path-integral quantum Monte Carlo methods can efficiently simulate the tunneling behavior of quantum adiabatic optimization algorithms. Specifically we look at symmetric cost functions defined over n bits with a…