On the Tightness of the Buhrman-Cleve-Wigderson Simulation
From MaRDI portal
Publication:3652231
DOI10.1007/978-3-642-10631-6_45zbMath1273.68190OpenAlexW1564168778MaRDI QIDQ3652231
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_45
Analysis of algorithms and problem complexity (68Q25) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
Communication Lower Bounds via Critical Block Sensitivity ⋮ Unbounded-error quantum query complexity ⋮ Unnamed Item