The authors design dimension-independent classical sketches that approximately preserve the trace distance between quantum states, supporting approximate database operations without full state tomography.
Deleting a marked item from an unsorted database with a single query
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
cs.DB 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Quantum Data Sketches
The authors design dimension-independent classical sketches that approximately preserve the trace distance between quantum states, supporting approximate database operations without full state tomography.