Henry Yuen
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2022–2023
all 5 in the filters
on a stage with
all 6 in the filters
who talks about the same things
- Gregory Rosenthal2 talks
- Nengkun Yu10 talks
- Runzhou Tao6 talks
- Charles Yuan12 talks
- Yuval Filmus9 talks
- Toniann Pitassi5 talks
| title | conference | date |
|---|---|---|
| Unitary property testing lower bounds by polynomials | ITCS 2023 | 2023-01-10 |
A method shows any T-query tester that accesses an unknown unitary U and U^{-1} has acceptance probability given by a degree ≤2T multivariable polynomial, and… | ||
| Interactive Proofs for Synthesizing Quantum States and Unitaries | ITCS 2022 | 2022-01-31 |
Defines quantum analogs of function classes and proves concrete inclusions: state PSPACE ⊆ state QIP (completeness with exponentially small trace distance… | ||
| Interactive Proofs for Synthesizing Quantum States and Unitaries | Quantum Wave in Computing Reunion 2021 | 2021-07-15 |
Proves that space-uniform families of n‑qubit states admit interactive synthesis protocols, i.e. state PSPACE ⊆ state QIP, with perfect completeness and the… | ||
| MIP* = RE Part 1: The Quantum Low-Degree Test | Quantum Protocols: Testing & Quantum PCPs | 2020-03-30 |
Shows a concrete protocol that self-tests for 2^n EPR pairs by certifying Pauli relations on many qubits. It combines the magic‑square subtest to force… | ||
| MIP* = RE Part 2: PCPs and Introspection | Quantum Protocols: Testing & Quantum PCPs | 2020-03-30 |
Claim: MIP contains nondeterministic doubly-exponential time (AnyExp) and the techniques extend to the full compression that yields MIP = RE. Key tools are… | ||
| Parallel Repetition for Entangled Games via Fast Quantum Search | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Proves for free (product-input) games a stronger parallel-repetition upper bound: the entangled value falls like entangled value ≤ (1−ε^{3/2})^{Θ(n/s)} where ε… | ||
| Infinite Randomness Expansion with a Constant Number of Devices | Quantum Games and Protocols | 2014-02-24 |
Claims an unbounded (infinite) certified randomness expansion starting from a constant m‑bit seed (m ~ 100–1000), by alternating a VV exponential-expansion… | ||
| nothing matches | ||