Search Results
Dynamic Programming on a Quantum Annealer: Solving the RBC Model
We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization.
Open source software in quantum computing
Open source software is becoming crucial in the design and testing of quantum algorithms.
Quantum Physics Mathematical Software Programming Languages
Tropical Tensor Network for Ground States of Spin Glasses
We present a unified exact tensor network approach to compute the ground state energy, identify the optimal configuration, and count the number of solutions for spin glasses.
Statistical Mechanics Quantum Physics Computation
Quantum Advantage for All
In particular, we show that any classical algorithm $A$ that runs in $\mathcal{O}(f(n))$ time and $\mathcal{O}(g(n))$ space requires no more than $\mathcal{O}(f(n)\cdot g(n))$ quantum bits to execute, even symbolically, on a quantum computer.
Programming Languages
Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework
To encourage the reuse and extension of these techniques, we provide an implementation of the framework and embedding algorithms.
Quantum Physics Data Structures and Algorithms
A Hybrid Quantum-Classical Algorithm for Robust Fitting
While our usage of quantum computing does not surmount the fundamental intractability of robust fitting, by providing error bounds our algorithm is a practical improvement over randomised heuristics.
Qubit assignment using time reversal
For any given quantum program and device there are many ways to assign physical qubits for execution of the program, and assignments will differ in performance due to the variability in quality across qubits and entangling operations on a single device.
Quantum Physics
Solving Large Break Minimization Problems in a Mirrored Double Round-robin Tournament Using Quantum Annealing
In the case of 36 teams, it took 84. 8 s for the integer programming method to reach the objective function value, which was obtained by the quantum annealer in 0. 05 s. These results not only present the break minimization problem in an MDRRT as an example of applying QA to practical optimization problems, but also contribute to find problems that can be effectively solved by QA.
Boltzmann sampling with quantum annealers via fast Stein correction
Despite the attempts to apply a quantum annealer to Boltzmann sampling, it is still impossible to perform accurate sampling at arbitrary temperatures.
Statistical Mechanics Quantum Physics
Cloning and Beyond: A Quantum Solution to Duplicate Code
However, the kinds of problems for which these computers are a good fit, and the ways to express those problems, are substantially different from the kinds of problems and expressions used in classical computing.
