An Upper Bound on the Rate of Information Transfer by Grover’s Oracle

DOI10.1007/11889342_25MaRDI QIDQ5504202zbMATH OpenOpenAlexFDO

Authors

Publication date 22 January 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/24014

zbMATH Keywords

entropyGrover's algorithmquantum search

Mathematics Subject Classification ID

Quantum computation (81P68) Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• An upper bound on the rate of information transfer by Grover's oracle
• Exact quantum lower bound for Grover's problem
• A panoply of quantum algorithms
• Quest for fast partial search algorithm
• The quadratic speedup in Grover's search algorithm from the entanglement perspective

Cited in

(10)

• Quantum distributed computing applied to Grover's search algorithm
• Quantum search of spatial regions
• The Grover energy transfer algorithm for relativistic speeds
• Quantum oracles in terms of universal gate set
• An upper bound on the rate of information transfer by Grover's oracle
• Simulation and the exact complexity of Grover's search algorithm
• Exact quantum lower bound for Grover's problem
• Complexity of Grover's algorithm: an algebraic approach
• Quantum information processing: The case of vanishing interaction energy
• The 50\% advanced information rule of the quantum algorithms

This page was built for publication: An Upper Bound on the Rate of Information Transfer by Grover’s Oracle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504202)