Related papers: Polymer Physics by Quantum Computing
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct…
Quantum computers are ideally set up to solve linear systems which are of a form similar to the Schrodinger/Dirac equation of quantum mechanics. In the framework of linear response theory, the propagation and scattering of electromagnetic…
Quantum annealing is a promising approach for solving combinatorial optimization problems. However, its performance is often limited by the overhead of additional qubits required for embedding logical QUBO models onto quantum annealers.…
We investigate an efficient, generic method for evaluating the performance of quantum annealing devices that does not require the prior knowledge of the true ground state of the benchmark problem. This approach exploits symmetry properties…
The possibility of using quantum computers for electronic structure calculations has opened up a promising avenue for computational chemistry. Towards this direction, numerous algorithmic advances have been made in the last five years. The…
During recent years, quantum computers have received increasing attention, primarily due to their ability to significantly increase computational performance for specific problems. Computational performance could be improved for…
Using a specially constructed set of hard 2-SAT problems with four satisfying assignments, we study the scaling and sampling performance of numerical simulation of quantum annealing as well as that of the physical quantum annealers offered…
Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave…
High-energy physics is replete with hard computational problems and it is one of the areas where quantum computing could be used to speed up calculations. We present an implementation of likelihood-based regularized unfolding on a quantum…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
Recent advances in the development of commercial quantum annealers such as the D-Wave 2X allow solving NP-hard optimization problems that can be expressed as quadratic unconstrained binary programs. However, the relatively small number of…
Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum…
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have…
Commercial quantum annealers from D-Wave Systems can find high quality solutions of quadratic unconstrained binary optimization problems that can be embedded onto its hardware. However, even though such devices currently offer up to 2048…
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. Quantum computational algorithms have the potential to be an exciting new way of studying quantum cosmology. In quantum…
Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research direction is to tackle such quadratic optimization problems…
Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins. A critical factor that limits the success of a quantum annealer is its sensitivity to noise, and intensive research…
Here, a dichotomy of particles and waves is employed in a quantum Monte Carlo calculation of interacting electrons. Through the creation and propagation of concurrent stochastic ensembles of walkers in physical space and in Hilbert space…
Mainstream machine-learning techniques such as deep learning and probabilistic programming rely heavily on sampling from generally intractable probability distributions. There is increasing interest in the potential advantages of using…