A Demonstration of Q 2 O: Quantum-Augmented Query Optimizer
Authors:
Open Access
- 1 August 2025
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 18 (12) , 5439-5443
Abstract
The join order (JO) optimization problem is a key challenge in query optimization. Classical approaches can compute the optimal solution for smaller queries. For larger queries, some heuristic methods trade off plan quality to reduce the exponential search space. Recently, quantum-based methods have been proposed to leverage quantum mechanisms to accelerate exploration; however, encoding problem-specific constraints as penalty terms introduces extra overhead. Moreover, quantum-inspired methods on classical hardware do not harness the true advantages of quantum computation. Furthermore, these methods remain at the simulation stage. In this demonstration, we present the first Quantum-augmented Query Optimizer ( Q 2 O ) that integrates a hybrid quantum-classical approach to solve the JO problem in a real database setup. This demonstration allows conference attendees to interact directly with Q 2 O by executing queries and viewing detailed execution results (Scenario 1). Users can easily compare plan quality between Q 2 O and PostgreSQL (Scenario 2). Additionally, they can experiment with quantum parameters to observe their impact (Scenario 3). Experimental results show that the query plan generated by our approach achieves up to a 13x speedup in query execution. The video corresponding to this demonstration is available at this link.Keywords
This publication has 17 references indexed in Scilit:
- D-Wave’s Nonlinear-Program Hybrid Solver: Description and Performance AnalysisIEEE Access, 2025
- Real World Application of Quantum-Classical Optimization for Production Scheduling2024
- Quantum Join Ordering by Splitting the Search Space of QUBO ProblemsDatenbank-Spektrum, 2024
- Power Network Optimization: A Quantum ApproachIEEE Access, 2023
- Constructing Optimal Bushy Join Trees by Solving QUBO Problems on Quantum Hardware and Simulators2023
- Noisy intermediate-scale quantum algorithmsReviews of Modern Physics, 2022
- Quantum annealing with manufactured spinsNature, 2011
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998
- On the complexity of generating optimal left-deep processing trees with cross products1995
- On the optimal nesting order for computing N -relational joinsACM Transactions on Database Systems, 1984