Quantum
Constrained Adiabatic Quantum Programming
Publication: quant-ph updates on arXiv.org
Author: Liyi Li, Mahir Anand, James Bryan Graves, Amr Sabry
Source published: 17/11/2026, 05:00:00 UTC
Briefing created: 17/11/2026, 08:35:42 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 17/11/2026, 08:28:25 UTC.
Briefings
A new AQC language called ENQ+ allows programmers to define both the problem cost function and relational constraints that restrict the search space to specific subsets of vertices, such as finding a k-clique. The authors prove that runs starting from an approximate initial state will still reach the correct answer with a probability equal to the squared overlap between the initial and exact states. This approach turns constrained quantum annealing into a general programming construct, enabling solutions for the 3D Matching, Hamiltonian Cycle, and Traveling Salesperson problems.
Key points
- ENQ+ is an AQC language where programmers define both the problem cost function and relational constraints to restrict the search space to specific subsets of vertices.
- The authors prove that a run from an approximate initial state reaches the answer with a probability equal to the squared overlap between the initial and exact states.
Context
This research presents ENQ+, a new AQC language that allows programmers to define both cost functions and relational constraints to restrict the search space to specific subsets of vertices, turning constrained quantum annealing into a general programming construct.
Limitations
The study uses many-world configuration (MWC) graphs to derive step-wise semantics and prove correctness for specific problems like 3D Matching and Hamiltonian Cycle. The evidence is preprint status (arXiv:2611.19092v1) and relies on theoretical proofs rather than experimental validation or empirical data from running the algorithms on physical hardware.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 17/11/2026, 08:35:42 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeihvlpz25ppmsdwmifowf5duovecamznrew2ajgv2fcbrcsuinqj6q