Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces

DOI10.1007/S11128-015-1164-0zbMath1333.81100OpenAlexW1899270760MaRDI QIDQ265339

Wenliang Jin

Publication date: 4 April 2016

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

Full work available at URL: https://doi.org/10.1007/s11128-015-1164-0

zbMATH Keywords

random perturbationsarbitrarily high-dimensional search spacesGrover's search algorithmGrover's verdict

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Related Items (6)

Efficient quantum algorithms of finding the roots of a polynomial function ⋮ Creating very true quantum algorithms for quantum energy based computing ⋮ Quantum cryptography based on the Deutsch-Jozsa algorithm ⋮ New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm ⋮ Some theoretically organized algorithm for quantum computers ⋮ Quantum algorithm for the root-finding problem

Cites Work

• Unnamed Item
• Quantum search in a possible three-dimensional complex subspace
• Decoherence, einselection, and the quantum origins of the classical
• Quantum Computers, Factoring, and Decoherence
• Algebraic analysis of quantum search with pure and mixed states
• Quantum computers and dissipation
• Strengths and Weaknesses of Quantum Computing
• Error Correcting Codes in Quantum Theory

This page was built for publication: Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces