Pith. sign in

REVIEW 3 cited by

Quantum Data Management in the NISQ Era: Extended Version

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

arxiv 2409.14111 v3 pith:TUQKGYNB submitted 2024-09-21 quant-ph cs.DB

classification quant-phcs.DB
keywords dataquantummanagementcomputingnisqchallengesclassicalfuture
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum computing has emerged as a promising tool for transforming the landscape of computing technology. Recent efforts have applied quantum techniques to classical database challenges, such as query optimization, data integration, index selection, and transaction management. In this paper, we shift focus to a critical yet underexplored area: data management for quantum computing. We are currently in the noisy intermediate-scale quantum (NISQ) era, where qubits, while promising, are fragile and still limited in scale. After differentiating quantum data from classical data, we outline current and future data management paradigms in the NISQ era and beyond. We address the data management challenges arising from the emerging demands of near-term quantum computing. Our goal is to chart a clear course for future quantum-oriented data management research, establishing it as a cornerstone for the advancement of quantum computing in the NISQ era.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. InferQ: A Database-Oriented Benchmark for Quantum Circuits Simulation

    quant-ph 2026-07 conditional novelty 7.0 of 10

    InferQ generates 202,975 compositional quantum circuits as SQL workloads and shows RDBMS engines beat Qiskit Aer on peak memory for ~51% of them, with ML selectors predicting the best backend at up to 95-97% accuracy.

  2. Quantum Information-Theoretical Size Bounds for Conjunctive Queries with Functional Dependencies

    quant-ph 2025-06 reject novelty 5.0 of 10

    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.

  3. Qymera: Simulating Quantum Circuits using RDBMS

    quant-ph 2025-06 conditional novelty 4.0 of 10

    Qymera translates quantum circuits into SQL over integer-encoded state tables, runs them in SQLite or DuckDB, and provides a circuit builder and benchmarking tools.

Pith tools