REVIEW 2 cited by
QCE'24 Tutorial: Quantum Annealing -- Emerging Exploration for Database Optimization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Quantum annealing is a meta-heuristic approach tailored to solve combinatorial optimization problems with quantum annealers. In this tutorial, we provide a fundamental and comprehensive introduction to quantum annealing and modern data management systems and show quantum annealing's potential benefits and applications in the realm of database optimization. We demonstrate how to apply quantum annealing for selected database optimization problems, which are critical challenges in many data management platforms. The demonstrations include solving join order optimization problems in relational databases, optimizing sophisticated transaction scheduling, and allocating virtual machines within cloud-based architectures with respect to sustainability metrics. On the one hand, the demonstrations show how to apply quantum annealing on key problems of database management systems (join order selection, transaction scheduling), and on the other hand, they show how quantum annealing can be integrated as a part of larger and dynamic optimization pipelines (virtual machine allocation). The goal of our tutorial is to provide a centralized and condensed source regarding theories and applications of quantum annealing technology for database researchers, practitioners, and everyone who wants to understand how to potentially optimize data management with quantum computing in practice. Besides, we identify the advantages, limitations, and potentials of quantum computing for future database and data management research.
Forward citations
Cited by 2 Pith papers
-
QCardEst/QCardCorr: Quantum Cardinality Estimation and Correction
A hybrid quantum-classical network with a compact query encoding learns to correct PostgreSQL cardinality estimates, reporting 6.37x and 8.66x error reductions on JOB-light and STATS.
-
Quantum Information-Theoretical Size Bounds for Conjunctive Queries with Functional Dependencies
Worst-case conjunctive query size bounds can be reformulated with quantum Rényi entropy, producing sound but generally non-tight upper bounds whose classical tight version is recovered only in the α→1 limit.
Discussion (0). Continue with ORCID to comment.