On beating the hybrid argument

DOI10.1145/2090236.2090273zbMath1347.68159OpenAlexW2104136674MaRDI QIDQ2826078

Emanuele Viola, Bill Fefferman, Ronen Shaltiel, Christopher Umans

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2090236.2090273

zbMATH Keywords

quantum computingpseudorandomnessbranching programconstant-depth circuitssmall spacehybrid argument

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3, Algebraic generalization of Diffie-Hellman key exchange, Unnamed Item

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES