🤖 AI Summary
This work proposes Qute, the first quantum-native database system that treats quantum computation as a first-class execution option to overcome the limitations of traditional databases, which lack native support for quantum processing and fail to harness quantum advantage. Qute extends SQL compilation to generate efficient quantum circuits, incorporates a hybrid query optimizer that dynamically selects between classical and quantum execution paths, and introduces selective quantum indexing alongside a fidelity-aware storage mechanism. Evaluated on the real quantum processor Origin_Wukong, Qute demonstrates significant performance gains over classical baselines on large-scale tasks. The prototype has been open-sourced, and the project outlines a three-stage evolutionary roadmap to provide a systematic framework for the future development of quantum databases.
📝 Abstract
This paper envisions a quantum database (Qute) that treats quantum computation as a first-class execution option. Unlike prior simulation-based methods that either run quantum algorithms on classical machines or adapt existing databases for quantum simulation, Qute instead (i) compiles an extended form of SQL into gate-efficient quantum circuits, (ii) employs a hybrid optimizer to dynamically select between quantum and classical execution plans, (iii) introduces selective quantum indexing, and (iv) designs fidelity-preserving storage to mitigate current qubit constraints. We also present a three-stage evolution roadmap toward quantum-native database. Finally, by deploying Qute on a real quantum processor (origin_wukong), we show that it outperforms a classical baseline at scale, and we release an open-source prototype at https://github.com/weAIDB/Qute.