William Kretschmer
where else to find them
what they talk about
where they keep going back
- ITCS2 editions2021–2023
all 4 in the filters
on a stage with
- Daniel Liangonce
- Sabee Grewalonce
- Vishnu Iyeronce
who talks about the same things
- Uma Girish4 talks
- Ran Raz6 talks
- Charles Yuan12 talks
- Kengo Hirata5 talks
- Jens Palsberg17 talks
- Prahladh Harsha4 talks
| title | conference | date |
|---|---|---|
| Quantum cryptography and quantum complexity | Summer Cluster on Quantum Computing 2025 | 2025-07-07 |
Constructs a standard classical oracle where P = NP yet quantum‑computable one‑way functions and even trapdoor variants exist, using a forrelation encoding of… | ||
| Learning Beyond Stabilizer States | Quantum Summer Cluster Workshop 2023 | 2023-07-10 |
Shows concrete algorithms and limits: outputs of Clifford+T circuits with n qubits and k T gates are learnable in poly(n) time with sample and runtime scaling… | ||
| Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom | ITCS 2023 | 2023-01-10 |
Gives an efficient procedure that, using four copies of an n‑qubit state, samples the scaled convolution q_psi of the Weyl‑operator characteristic distribution… | ||
| Quantum Pseudorandomness and Classical Complexity | Quantum Wave in Computing Reunion 2021 | 2021-07-15 |
Constructs a simple quantum oracle where BQP = QMA relative to a quantum oracle while simultaneously pseudorandom quantum states (PRSs) exist relative to that… | ||
| The Quantum Supremacy Tsirelson Inequality | ITCS 2021 | 2021-01-06 |
Proves a query lower bound for linear cross-entropy benchmarking: any polynomial-time quantum algorithm needs about 2^{n/4} queries to beat the trivial quantum… | ||
| nothing matches | ||