4 papers · 1 filter
Scaling Quantum Optimization for Unit Commitment via Pauli Correlation Encoding
Kien X. Nguyen, Ilya Safro, Xiaoyuan Liu
Unit commitment is an important optimization problem in power system operations, classified as NP-hard. This paper presents a hybrid quantum-classical method for the unit commitmen…
QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning
Kien X. Nguyen, Ankit Kulshrestha, Ilya Safro +1
Qubit routing is a fundamental problem in quantum compilation, known to be NP-hard. Its dynamic nature makes local routing decisions propagate and compound over time, making global…
Quantum Hypergraph Partitioning
Cameron Ibrahim, Bao G. Bach, Jad Salem +4
Quantum optimization algorithms are inherently probabilistic, yet they are most often used to search for a single high-quality solution. In this paper, we instead study hypergraph…
Q3SAT-GPT: A Generative Model for Discovering Quantum Circuits for the 3-SAT Problem
Pratim Ugale, Ilya Tyagin, Karunya Shirali +2
This work introduces Q3SAT-GPT, a generative model for discovering quantum circuits for the Max-E3-SAT problem. Our method learns from high-performing QAOA-style ansätze to directl…