The mathematics of quantum-enabled applications on the D-wave quantum computer
From MaRDI portal
Abstract: In this article we cover the canonical problem formulation necessary to program the D-Wave quantum processing unit (QPU) and discuss how such a problem is compiled onto the QPU. We also cover recent joint work solving a problem from topological data analysis on the D-Wave quantum computer. The goal of the article is to cover the above from a mathematical viewpoint accessible to a wide range of levels to introduce people to a (small) portion of the mathematics encountered in this industry.
Recommendations
- D-Wave and predecessors: from simulated to quantum annealing
- Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
- Quantum annealing versus digital computing. An experimental comparison
- An introduction to quantum annealing
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
Cited in
(6)- Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
- Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
- D-Wave and predecessors: from simulated to quantum annealing
- Mathematical aspects of the Digital Annealer's simulated annealing algorithm
- Analysis of \(D\)-Wave topologies with classical graph metrics
- Explainable AI for chest CT image recognition using topological data analysis
This page was built for publication: The mathematics of quantum-enabled applications on the D-wave quantum computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5238703)
