Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
William Kretschmer
Observed names:
Kretschmer, William,
Kretschmer, William Werner
Institutions:
The University of Texas at Austin,
University of California, Berkeley
Observed institutions:
Massachusetts Institute of Technology,
The University of Texas at Austin,
University of California, Berkeley
ORCID:
0000-0002-7784-9817
Observed ORCID:
0000-0002-7784-9817
OpenAlex ID:
A5036924443
Quantum Pseudorandomness and Classical Complexity
2021
·
Kretschmer, William
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
178
Simulation of qubit quantum circuits via Pauli propagation
2019
·
Patrick Rall
, Daniel Liang
, et al.
·
Physical Review A
·
133
PDF
Quantum Cryptography in Algorithmica
2023
·
William Kretschmer
, Luowen Qian
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
120
PDF
Improved Stabilizer Estimation via Bell Difference Sampling
2024
·
Sabee Grewal
, Vishnu Iyer
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
80
Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates
2025
·
Sabee Grewal
, Vishnu Iyer
, et al.
·
Quantum
·
78
PDF
Quantum-Computable One-Way Functions without One-Way Functions
2025
·
William Kretschmer
, Luowen Qian
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
31
PDF
Demonstrating an unconditional separation between quantum and classical information resources
2025
·
Kretschmer, William
, Grewal, Sabee
, et al.
·
arXiv (Cornell University)
·
29
PDF
Learning the Closest Product State
2025
·
Ainesh Bakshi
, John Bostanci
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
27
PDF
Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
2022
·
Grewal, Sabee
, Iyer, Vishnu
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
27
PDF
The Acrobatics of BQP
2021
·
Aaronson, Scott
, Ingram, DeVon
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
26
PDF
Agnostic Tomography of Stabilizer Product States
2026
·
Sabee Grewal
, Vishnu Iyer
, et al.
·
Quantum
·
22
PDF
A Qubit, a Coin, and an Advice String Walk into a Relational Problem
2023
·
Aaronson, Scott
, Buhrman, Harry
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
21
PDF
Symmetries, Graph Properties, and Quantum Speedups
2024
·
Shalev Ben-David
, Andrew M. Childs
, et al.
·
SIAM Journal on Computing
·
15
Pseudoentanglement Ain't Cheap
2024
·
Grewal, Sabee
, Iyer, Vishnu
, et al.
·
arXiv (Cornell University)
·
12
PDF
The Quantum Supremacy Tsirelson Inequality
2021
·
William Kretschmer
·
Quantum
·
11
PDF
Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates II: Single-Copy Measurements
2023
·
Grewal, Sabee
, Iyer, Vishnu
, et al.
·
arXiv (Cornell University)
·
8
Structured Factored Inference for Probabilistic Programming.
2018
·
Avi Pfeffer
, Brian E. Ruttenberg
, et al.
·
International Conference on Artificial Intelligence and Statistics
·
8
Quantum Mass Production Theorems
2022
·
Kretschmer, William
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
6
PDF
Structured Factored Inference: A Framework for Automated Reasoning in Probabilistic Programming Languages
2016
·
Pfeffer, Avi
, Ruttenberg, Brian
, et al.
·
arXiv (Cornell University)
·
4
PDF
Lower Bounding the AND-OR Tree via Symmetrization
2021
·
William Kretschmer
·
ACM Transactions on Computation Theory
·
3
PDF
Unitary complexity in polynomial space
2026
·
Kretschmer, William
, Tang, Ewin
·
arXiv (Cornell University)
·
2
PDF
$\mathsf{QMA}$ Lower Bounds for Approximate Counting
2019
·
Kretschmer, William
·
arXiv (Cornell University)
·
1
PDF
Lower bounds on the non-Clifford cost of pseudoentanglement
2025
·
Sabee Grewal
, Vishnu Iyer
, et al.
·
Physical Review A
Two-Disk Compound Symmetry Groups
2023
·
Hearn, Robert A.
, Kretschmer, William
, et al.
·
arXiv (Cornell University)
PDF
QMA Lower Bounds for Approximate Counting.
2019
·
William Kretschmer
·
Electronic colloquium on computational complexity
Show more works
View as search
Works count:
27
Citation count:
851
H-index:
13
I10-index:
15
Year
Topic
Type