Author of the publication

Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem.

, , , , and . STOC, page 1330-1342. ACM, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem., , , , and . STOC, page 1330-1342. ACM, (2021)Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge., and . TQC, volume 135 of LIPIcs, page 2:1-2:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Quantum Lower Bounds for Approximate Counting via Laurent Polynomials., , , and . Electron. Colloquium Comput. Complex., (2019)Mean estimation when you have the source code; or, quantum Monte Carlo methods., and . SODA, page 1186-1215. SIAM, (2023)Quantum Coupon Collector., , , , , and . TQC, volume 158 of LIPIcs, page 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Mean estimation when you have the source code; or, quantum Monte Carlo methods., and . CoRR, (2022)Exponential quantum speedup in simulating coupled classical oscillators*., , , , and . FOCS, page 405-414. IEEE, (2023)Unambiguous DNFs and Alon-Saks-Seymour., , , , and . FOCS, page 116-124. IEEE, (2021)Quantum Lower Bounds for Approximate Counting via Laurent Polynomials., , , and . CCC, volume 169 of LIPIcs, page 7:1-7:47. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)When Is Amplification Necessary for Composition in Randomized Query Complexity?, , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)