A Haskell Adiabatic DSL: Solving Classical Optimization Problems on Quantum Hardware
summary
A Haskell library called EnQ expresses optimization problems as energy constraint computations and uses the Traversable and Monad abstractions to build final Hamiltonians from choices and constraint views, then compiles those Hamiltonians either to brute‑force classical solvers or to quantum back ends (D‑Wave and Qiskit). The pipeline auto‑assigns qubits per choice, encodes penalties as Pauli operators, provides heuristics for the initial Hamiltonian, translates AQC evolution into gate sequences, and runs five case studies (search, type inference, number partitioning, clique, graph coloring), with real‑device runs needing repeated samples due to noise and some problems disabled on D‑Wave because its initial Hamiltonian is fixed.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 1:06Quantum computing and AQC
- 3:16Limitations of quantum programming
- 5:25Adiabatic quantum basics
- 7:11NQ DSL for AQC
- 9:18Graph coloring in NQ
- 12:32NQ compilation pipeline
- 15:05Front-end compilation
- 17:37Building problem Hamiltonian
- 19:02Executable quantum programs
- 19:22Case studies and results
- 21:31Conclusion and Q&A
related talks
14mQuantum approach to classical optimization: why bother and what to do?
21mSoftware for Quantum Computing- Easing Solutions for Complex
01h 10mThe Rise & Collapse of a Quantum State
19mAn Industry Perspective on the Path Forward in Quantum Optimization
19mExtracting maximum value from today's quantum computers while prep
41mQuantum Computing in Practice: Where We Are, What Works, and What’s Next
16mModeling Heat Flow in Automotive Industry with Novel Quantum Computing Solutions
15mAccelerQ: Accelerating Quantum Eigensolvers With Machine Learning on Quantum Simulators