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

TL;DR

This paper introduces a quantum algorithm capable of deleting a marked item from an unsorted database with just one query, significantly outperforming classical methods that require linear queries.

Contribution

The paper presents a novel quantum deletion algorithm that achieves exponential speedup over classical algorithms for removing a marked item from an unsorted database.

Findings

Deletes a marked item with a single quantum query

Achieves exponential speedup over classical algorithms

Studies the general properties of the deletion algorithm

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.