Sure success partial search

DOI10.1007/S11128-006-0037-YzbMath1119.81021arXivquant-ph/0603136OpenAlexW2139674202MaRDI QIDQ2384167

Thomas A. Walker, Samuel L. Braunstein, Byung-Soo Choi

Publication date: 20 September 2007

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0603136

zbMATH Keywords

Grover's algorithmpartial searchQuantum database searchsure success

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Quantum computation (81P68)

Related Items (5)

A review on quantum search algorithms ⋮ Quantum partial search of a database with several target items ⋮ Quantum partial search for uneven distribution of multiple target items ⋮ Decomposition of neurological multivariate time series by state space modelling ⋮ Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights

Cites Work

• Unnamed Item
• Quest for fast partial search algorithm
• Optimization of partial search
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Mean field theory on the incommensurate ground state of the zigzag spin chain

This page was built for publication: Sure success partial search