Related papers: Molecular Dynamics on Quantum Annealers
Near term quantum hardware promises unprecedented computational advantage. Crucial in its development is the characterization and minimization of computational errors. We propose the use of the quantum fluctuation theorem to benchmark the…
We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks, quantum phase estimation, and quantum Zeno…
One of the problems frequently mentioned as a candidate for quantum advantage is that of selecting a portfolio of financial assets to maximize returns while minimizing risk. In this paper we formulate several real-world constraints for use…
Simulating nonlinear partial differential equations (PDEs) such as the Navier--Stokes (NS) equations remains computationally intensive, especially when implicit time integration is used to capture multiscale flow dynamics. This work…
Computational chemistry at the atomic level has largely branched into two major fields, one based on quantum mechanics and the other on molecular mechanics using classical force fields. Because of high computational costs, quantum…
Quantum computers use quantum resources to carry out computational tasks and may outperform classical computers in solving certain computational problems. Special-purpose quantum computers such as quantum annealers employ quantum adiabatic…
We developed a quantum eigensolver (QE) which is based on an extension of optimized binary configurations measured by quantum annealing (QA) on a D-Wave Quantum Annealer (D-Wave QA). This approach performs iterative QA measurements to…
We report the first results for the computation of relativistic effects in quantum many-body systems using quantum annealers. An average accuracy of 98.9% in the fine structure splitting of boron-like ions with respect to experiments has…
Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after…
Quantum Annealing, or Quantum Stochastic Optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an…
We present a hybrid classical-quantum algorithm to solve optimization problems in current quantum computers, whose basic idea is to assist variational quantum eigensolvers (VQE) with adiabatic change of the Hamiltonian. The rational for…
Modern quantum annealers can find high-quality solutions to combinatorial optimisation objectives given as quadratic unconstrained binary optimisation (QUBO) problems. Unfortunately, obtaining suitable QUBO forms in computer vision remains…
Mixed-quantum-classical molecular dynamics simulation implies an effective measurement on the electronic states owing to continuously tracking the atomic forces.Based on this insight, we propose a quantum trajectory mean-field approach for…
Quantum simulation is known to be capable of simulating certain dynamical systems in continuous time -- Schrodinger's equations being the most direct and well-known -- more efficiently than classical simulation. Any linear dynamical system…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
Quantum computers show potential for achieving computational advantage over classical computers, with many candidate applications in combinatorial optimisation. We present an application level benchmarking framework for near-term quantum…
Quantum computers are known to provide an exponential advantage over classical computers for the solution of linear differential equations in high-dimensional spaces. Here, we present a quantum algorithm for the solution of nonlinear…
We define an observable-space framework of Quantum Koopman Algorithms (QKAs) for simulating the dynamics of both linear quantum and nonlinear classical systems, based on approximately closed sets of observables and efficient coherent…
Although quantum computing hardware has evolved significantly in recent years, spurred by increasing industrial and government interest, the size limitation of current generation quantum computers remains an obstacle when applying these…
Lie-algebraic and quantum-algebraic techniques are used in the analysis of thermodynamic properties of molecules and solids. The local anharmonic effects are described by a Morse-like potential associated with the $su(2)$ algebra. A…