Henry Yuen

Orcid: 0000-0002-2684-1129

According to our database1, Henry Yuen authored at least 43 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Pseudorandom unitaries with non-adaptive security.
IACR Cryptol. ePrint Arch., 2024

2023
An Improved Sample Complexity Lower Bound for (Fidelity) Quantum State Tomography.
Quantum, January, 2023

Pseudorandom Strings from Pseudorandom Quantum States.
IACR Cryptol. ePrint Arch., 2023

On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions.
IACR Cryptol. ePrint Arch., 2023

An efficient quantum parallel repetition theorem and applications.
Electron. Colloquium Comput. Complex., 2023

On the Pauli Spectrum of QAC0.
CoRR, 2023

Unitary Complexity and the Uhlmann Transformation Problem.
CoRR, 2023

Testing and Learning Quantum Juntas Nearly Optimally.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Unitary Property Testing Lower Bounds by Polynomials.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

stateQIP = statePSPACE.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Anchored Parallel Repetition for Nonlocal Games.
SIAM J. Comput., 2022

Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications.
IACR Cryptol. ePrint Arch., 2022

Nonlocal games, compression theorems, and the arithmetical hierarchy.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Interactive Proofs for Synthesizing Quantum States and Unitaries.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Quantum Search-To-Decision Reductions and the State Synthesis Problem.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
Cryptography from Pseudorandom Quantum States.
IACR Cryptol. ePrint Arch., 2021

MIP* = RE.
Commun. ACM, 2021

Quantum soundness of testing tensor codes.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Einstein Meets Turing: The Computability of Nonlocal Games.
Proceedings of the Connecting with Computability, 2021

2020
Quantum Garbled Circuits.
IACR Cryptol. ePrint Arch., 2020

Quantum soundness of the classical low individual degree test.
CoRR, 2020

Exploring entanglement and optimization within the Hamiltonian Variational Ansatz.
CoRR, 2020

Quantum statistical query learning.
CoRR, 2020

On the Complexity of Zero Gap MIP.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Perfect zero knowledge for quantum multiprover interactive proofs.
Electron. Colloquium Comput. Complex., 2019

Good approximate quantum LDPC codes from spacetime circuit Hamiltonians.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
Quantum proof systems for iterated exponential time, and beyond.
Electron. Colloquium Comput. Complex., 2018

Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Noise-Tolerant Testing of High Entanglement of Formation.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
New security notions and feasibility results for authentication of quantum data.
IACR Cryptol. ePrint Arch., 2017

Hardness amplification for entangled games via anchoring.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Multiplayer Parallel Repetition for Expanding Games.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Games, protocols, and quantum entanglement.
PhD thesis, 2016

A parallel repetition theorem for all entangled games.
Electron. Colloquium Comput. Complex., 2016

Multiplayer parallel repetition for expander games.
Electron. Colloquium Comput. Complex., 2016

Parallel repetition via fortification: analytic view and the quantum case.
Electron. Colloquium Comput. Complex., 2016

On the Sum-of-Squares Degree of Symmetric Quadratic Functions.
Proceedings of the 31st Conference on Computational Complexity, 2016

A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian.
Proceedings of the Approximation, 2016

2015
Anchoring games for parallel repetition.
CoRR, 2015

2014
A quantum lower bound for distinguishing random functions from random permutations.
Quantum Inf. Comput., 2014

Infinite randomness expansion with a constant number of devices.
Proceedings of the Symposium on Theory of Computing, 2014

2013
Robust Randomness Amplifiers: Upper and Lower Bounds.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2010
DNA Sequencing via Quantum Mechanics and Machine Learning
CoRR, 2010


  Loading...