AI for Science

Qute: Towards Quantum-Native Database

MMuzhi ChenXXuanhe ZhouWWei ZhouBBangrui XuSSurui TangGGuoliang LiBBingsheng HeYYeye HeYYitong SongFFan Wu
Published
February 16, 2026
Authors
10
Word Count
6,195

Qute brings quantum computing into database systems as a native execution substrate, not an add-on.

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.

Key Takeaways

  • 1

    Qute integrates quantum computation as a first-class substrate throughout the entire database query pipeline, not just as an isolated accelerator.

  • 2

    Quantum filtering using Grover's algorithm achieves O(√N) complexity instead of classical O(N), dramatically reducing computational checks needed.

  • 3

    The system rethinks the entire stack from SQL compilation through storage to preserve quantum state fidelity and optimize execution.

Limitations

  • Limited qubit budgets restrict quantum execution to probing only small fractions of datasets during operation.

  • Quantum operators have fundamentally different latency, success probability, and approximation error characteristics requiring new optimization strategies.

More in AI for Science

View all
Qute: Towards Quantum-Native Database | Paperchime