Pith. sign in

REVIEW 1 cited by

Quantum Relational Databases

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 quant-ph/9712025 v1 pith:QDHLGF33 submitted 1997-12-11 quant-ph

Paul Cockshott This is my paper · ORCID
classification quant-ph
keywords quantumclassicalcomplexitylimitrelationalupperalgebraapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The approach given by Grover can be generalised to set an upper complexity limit to the basic operations of relational algebra on a quantum computer. Except in special cases where indices can be used on a classical machine, the quantum upper complexity limit is lower than the classical one.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Quantum Data Sketches

    cs.DB 2025-01 reject novelty 6.0 of 10

    The authors design dimension-independent classical sketches that approximately preserve the trace distance between quantum states, supporting approximate database operations without full state tomography.

Pith tools