Is Quantum Computing Ready for Real-Time Database Optimization?
Hanwen Liu, Ibrahim Sabek

TL;DR
This paper introduces Q2O, a quantum-augmented query optimizer that leverages recent low-latency quantum annealing solutions to improve real-time database optimization tasks such as join ordering.
Contribution
It presents the first real quantum-augmented query optimizer, integrating quantum annealing into PostgreSQL for real-time optimization using actual database statistics.
Findings
Q2O can handle actual queries in real time.
Quantum annealing improves search space exploration for database optimization.
The system demonstrates practical integration of quantum solutions in DBMSs.
Abstract
Database systems encompass several performance-critical optimization tasks, such as join ordering and index tuning. As data volumes grow and workloads become more complex, these problems have become exponentially harder to solve efficiently. Quantum computing, especially quantum annealing, is a promising paradigm that can efficiently explore very large search spaces through quantum tunneling. It can escape local optima by tunneling through energy barriers rather than climbing over them. Earlier works mainly focused on providing an abstract representation (e.g., Quadratic Unconstrained Binary Optimization (QUBO)) for the database optimization problems (e.g., join order) and overlooked the real integration within database systems due to the high overhead of quantum computing services (e.g., a minimum 5s runtime for D-Wave's CQM-Solver). Recently, quantum annealing providers have offered…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Cloud Computing and Resource Management · Advanced Database Systems and Queries
