11 papers
Warm-Starting MaxCut Relaxation via Low-Depth Quantum Approximate Optimization Algorithm
Bao G. Bach, Ilya Safro, Filip B. Maciejewski
Quantum optimization has attracted growing interest as quantum hardware continues to improve, yet state-of-the-art classical solvers remain a formidable benchmark for practical uti…
Exponentially many initializations to avoid barren plateaus
Ankit Kulshrestha, Ricard Puig, Diego GarcÃa-MartÃn +4
Barren plateaus are stated as an average-case phenomenon: pick an ansatz, initialize it naively, and concentration follows. This has led to the common view that a potential cure fo…
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…
QUACOD: Quantum Optimization via Coordinate Descent for Scalable Drone Scheduling
Van-Quang-Huy Nguyen, Hoang-Quan Nguyen, Samee U. Khan +2
Quantum computing has demonstrated its potential to solve various optimization problems, including drone scheduling, which is important not only for drone delivery but also for log…
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…