Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
From MaRDI portal
Recommendations
- Quantum search in a possible three-dimensional complex subspace
- A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace
- An exact quantum search algorithm with arbitrary database
- Grover's search with faults on some marked elements
- Algebraic analysis of quantum search with pure and mixed states
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Algebraic analysis of quantum search with pure and mixed states
- Decoherence, einselection, and the quantum origins of the classical
- Error Correcting Codes in Quantum Theory
- Quantum computers and dissipation
- Quantum computers, factoring, and decoherence
- Quantum search in a possible three-dimensional complex subspace
- Strengths and Weaknesses of Quantum Computing
Cited in
(8)- A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace
- Some theoretically organized algorithm for quantum computers
- scientific article; zbMATH DE number 1406119 (Why is no real title available?)
- Quantum algorithm for the root-finding problem
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- Efficient quantum algorithms of finding the roots of a polynomial function
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Creating very true quantum algorithms for quantum energy based computing
This page was built for publication: Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265339)
