Fetching marked items from an unsorted database in NMR ensemble computing
arXiv:quant-ph/0112162 · doi:10.1103/PhysRevA.66.052320
Abstract
Searching a marked item or several marked items from an unsorted database is a very difficult mathematical problem. Using classical computer, it requires steps to find the target. Using a quantum computer, Grover's algorithm uses steps. In NMR ensemble computing, Brushweiler's algorithm uses steps. In this Letter, we propose an algorithm that fetches marked items in an unsorted database directly. It requires only a single query. It can find a single marked item or multiple number of items.
arXiv comment4 pages and 1 figure
References in corpus (8)
- Quantum Mechanics helps in searching for a needle in a haystack
- Tight bounds on quantum searching
- Grover's quantum searching algorithm is optimal
- Grover Algorithm with zero theoretical failure rate
- Effective Pure States for Bulk Quantum Computation
- Implementation of quantum search algorithm using classical Fourier optics
- On Arbitrary Phases in Quantum Amplitude Amplification
- Non-thermal nuclear magnetic resonance quantum computing using hyperpolarized Xenon
Cited by in corpus (14)
- The General Quantum Interference Principle and the Duality Computer
- Experimental Implementation of the Quantum Random-Walk Algorithm
- NMR experiment factors numbers with Gauss sums
- Parallel Quantum Computing in a Single Ensemble Quantum Computer
- Tomographic measurements on superconducting qubit states
- Experimental realization of a fetching algorithm in a 7 qubit NMR quantum computer
- Network Community Detection On Small Quantum Computers
- A Hybrid Quantum Encoding Algorithm of Vector Quantization for Image Compression
- Realization of Quantum State Privacy Amplification in a Nuclear Magnetic Resonance Quantum System
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
- Quantum dissonance provide power to deterministic quantum computation with single qubit
- Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm
- Ensemble Algorithm for the Selection Problem by NMR Ensemble Quantum Computers
- Implementation of Liouville space search algorithm on strongly dipolar coupled nuclear spins