Quantum and classical tradeoffs

DOI10.1016/j.tcs.2005.03.053zbMath1079.68033arXivquant-ph/0312213OpenAlexW1977250709MaRDI QIDQ2575086

Yaoyun Shi

Publication date: 5 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

quantum computationGrover's algorithmquantum lower boundquantum state generation

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (4)

Prospects of quantum-classical optimization for digital design ⋮ Delegating quantum computation in the quantum random oracle model ⋮ Unnamed Item ⋮ Binary decompositions of probability densities and random-bit simulation

Cites Work

• Strengths and Weaknesses of Quantum Computing
• Quantum lower bounds by polynomials
• Quantum lower bounds by quantum arguments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum and classical tradeoffs