Pith. sign in

REVIEW 1 cited by

Deleting a marked item from an unsorted database with a single query

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 0710.3301 v1 pith:RFEMPPF6 submitted 2007-10-17 quant-ph

Yang Liu , Gui Lu Long This is my paper · ORCID
classification quant-ph
keywords algorithmquerydatabasedeletingmarkedsingleunsortedachieves
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this Letter we present a quantum deletion algorithm that deletes a marked state from an unsorted database of $N$ items with only a single query. This algorithm achieves exponential speedup compared with classical algorithm where O(N) number of query is required. General property of this deleting algorithm is also studied.

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