William Kretschmer

Orcid: 0000-0002-7784-9817

Affiliations:
  • University of California, Berkeley USA
  • University of Texas at Austin, TX, USA (former)


According to our database1, William Kretschmer authored at least 21 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Quantum-Computable One-Way Functions without One-Way Functions.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Learning the Closest Product State.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Symmetries, Graph Properties, and Quantum Speedups.
SIAM J. Comput., 2024

Agnostic Tomography of Stabilizer Product States.
CoRR, 2024

Pseudoentanglement Ain't Cheap.
CoRR, 2024

Improved Stabilizer Estimation via Bell Difference Sampling.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
A Qubit, a Coin, and an Advice String Walk Into a Relational Problem.
Electron. Colloquium Comput. Complex., 2023

Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates.
CoRR, 2023

Two-Disk Compound Symmetry Groups.
CoRR, 2023

Quantum Mass Production Theorems.
Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

Quantum Cryptography in Algorithmica.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2021
Lower Bounding the AND-OR Tree via Symmetrization.
ACM Trans. Comput. Theory, 2021

The Quantum Supremacy Tsirelson Inequality.
Quantum, 2021

The Acrobatics of BQP.
Electron. Colloquium Comput. Complex., 2021

Quantum Pseudorandomness and Classical Complexity.
Proceedings of the 16th Conference on the Theory of Quantum Computation, 2021

2019
QMA Lower Bounds for Approximate Counting.
Electron. Colloquium Comput. Complex., 2019

Quantum Lower Bounds for Approximate Counting via Laurent Polynomials.
Electron. Colloquium Comput. Complex., 2019

$\mathsf{QMA}$ Lower Bounds for Approximate Counting.
CoRR, 2019

2018
Structured Factored Inference for Probabilistic Programming.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2016
Structured Factored Inference: A Framework for Automated Reasoning in Probabilistic Programming Languages.
CoRR, 2016


  Loading...