Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications (Q-Data)

Cost-Based Query Optimization for Quantum Computation

Immanuel Trummer

Published Jun 22, 2025• 4 citations
Publisher

Abstract

Prior work explores the use of quantum computing to solve variants of query optimization.Instead, I propose using query optimization techniques to make quantum computation more efficient.
DOI
10.1145/3736393.3736690

Related papers

Optimal Parallel Quantum Query Algorithms

Stacey Jeffery, Frédéric Magniez, Ronald de Wolf

Lecture notes in computer science•Jan 1, 2014•2 citations

Optimizing ccc-sum BKW and Faster Quantum Variant for LWE

Jinzheng Cao, Qingfeng Cheng, Jian Weng

The Learning with Errors (LWE) problem has become one of the most prominent candidates of post-quantum cryptography, offering promising potential to meet the challenge of quantum computing. From a theoretical perspective, optimizing algorithms to solve LWE is a vital task for the analysis of this cryptographic primitive. In this paper, we propose a fine-grained time/memory trade-off method to analyze c-sum BKW variants for LWE in both classical and quantum models, then offer new complexity bounds for multiple BKW variants determined by modulus q, dimension k, error rate alpha, and stripe size b. Through our analysis, optimal parameters can be efficiently found for different settings, and the minimized complexities are lower than existing results. Furthermore, we enhance the performance of c-sum BKW in the quantum computing model by adopting the quantum Meet-in-the-Middle technique as c-sum solver instead of the naive c-sum technique. Our complexity trade-off formula also applies to the quantum version of BKW, and optimizes the theoretical quantum time and memory costs, which are exponentially lower than existing quantum c-sum BKW variants.

IACR Communications in Cryptology•Oct 7, 2024•1 citation

Quantum-Inspired Relational Reasoning for Database Query Optimization

Jincheng Zhang

This paper proposes a novel approach to database query optimization inspired by quantum computing principles, specifically superposition and entanglement. Traditional relational query optimization relies heavily on heuristics, which can be computationally expensive and may not fully exploit the inherent relational structure of the database. Our method represents database relations as quantum states, enabling the simultaneous exploration of multiple query execution plans through superposition. Entanglement-like correlations are then used to guide the selection of optimal plan transitions based on estimated cost functions, mimicking the behavior of quantum algorithms. We demonstrate that this quantum-inspired relational reasoning approach has the potential to surpass classical heuristics in complex scenarios, offering a more efficient and accurate method for query optimization. The key components of this system include a quantum state representation of relational data, a superposition algorithm for exploring multiple execution plans, and an entanglement-based cost function evaluation mechanism. This work lays the groundwork for future research in hybrid quantum-classical database systems.

•Aug 28, 2026•0 citations

Optimal Parallel Quantum Query Algorithms

Stacey Jeffery, Frédéric Magniez, Ronald de Wolf

Algorithmica•Sep 8, 2016•16 citations

Quantum-Inspired Optimization Techniques for Big Data Warehousing and Real-Time Predictive Analytics

Mohan V, Sathish J

Modern businesses are facing more and more challenges in terms of Big Data warehousing and real-time data analytics due to the sheer volume of growing data. Traditional optimization techniques are increasingly ineffective when working with high-dimensional datasets, thus creating delays in resource allocation and query processing. Since there is a growing demand for faster solutions for data analytics, it is necessary to find new methods for solving optimization issues. In this respect, new emerging quantum-inspired computing techniques allow solving complex optimization problems by employing the principles of quantum mechanics—superposition and probability exploration. To enhance the performance of systems used for predictive analytics and data warehousing, a quantum-inspired optimization framework is proposed. This approach involves incorporating quantum-inspired techniques such as simulations of quantum annealing processes into frameworks used for distributed processing, thus resulting in the improvement of the areas of data indexing, query execution paths and load balancing of computers. The data processing machines are improved due to the advancements in feature selection and attainment of results in a faster way. Evaluation of the method on the big datasets showed that the query performance, and the accuracy of prediction is higher than that demonstrated by conventional techniques, and the architecture is efficient and can be scaled for processing the workloads for real-time analytics.

Journal of Computer Applications and Information Technology•Jun 30, 2026•0 citations

Studies on quantum query complexity and quantum computational cryptography

亮周 河内

•Jan 1, 2004•0 citations
The Learning with Errors (LWE) problem has become one of the most prominent candidates of post-quantum cryptography, offering promising potential to meet the challenge of quantum computing. From a theoretical perspective, optimizing algorithms to solve LWE is a vital task for the analysis of this cryptographic primitive. In this paper, we propose a fine-grained time/memory trade-off method to analyze c-sum BKW variants for LWE in both classical and quantum models, then offer new complexity bounds for multiple BKW variants determined by modulus q, dimension k, error rate alpha, and stripe size b. Through our analysis, optimal parameters can be efficiently found for different settings, and the minimized complexities are lower than existing results. Furthermore, we enhance the performance of c-sum BKW in the quantum computing model by adopting the quantum Meet-in-the-Middle technique as c-sum solver instead of the naive c-sum technique. Our complexity trade-off formula also applies to the quantum version of BKW, and optimizes the theoretical quantum time and memory costs, which are exponentially lower than existing quantum c-sum BKW variants.
This paper proposes a novel approach to database query optimization inspired by quantum computing principles, specifically superposition and entanglement. Traditional relational query optimization relies heavily on heuristics, which can be computationally expensive and may not fully exploit the inherent relational structure of the database. Our method represents database relations as quantum states, enabling the simultaneous exploration of multiple query execution plans through superposition. Entanglement-like correlations are then used to guide the selection of optimal plan transitions based on estimated cost functions, mimicking the behavior of quantum algorithms. We demonstrate that this quantum-inspired relational reasoning approach has the potential to surpass classical heuristics in complex scenarios, offering a more efficient and accurate method for query optimization. The key components of this system include a quantum state representation of relational data, a superposition algorithm for exploring multiple execution plans, and an entanglement-based cost function evaluation mechanism. This work lays the groundwork for future research in hybrid quantum-classical database systems.
Modern businesses are facing more and more challenges in terms of Big Data warehousing and real-time data analytics due to the sheer volume of growing data. Traditional optimization techniques are increasingly ineffective when working with high-dimensional datasets, thus creating delays in resource allocation and query processing. Since there is a growing demand for faster solutions for data analytics, it is necessary to find new methods for solving optimization issues. In this respect, new emerging quantum-inspired computing techniques allow solving complex optimization problems by employing the principles of quantum mechanics—superposition and probability exploration. To enhance the performance of systems used for predictive analytics and data warehousing, a quantum-inspired optimization framework is proposed. This approach involves incorporating quantum-inspired techniques such as simulations of quantum annealing processes into frameworks used for distributed processing, thus resulting in the improvement of the areas of data indexing, query execution paths and load balancing of computers. The data processing machines are improved due to the advancements in feature selection and attainment of results in a faster way. Evaluation of the method on the big datasets showed that the query performance, and the accuracy of prediction is higher than that demonstrated by conventional techniques, and the architecture is efficient and can be scaled for processing the workloads for real-time analytics.