235 citations · 405 across the 36 of their papers we have counts for
6 papers · 2 filters
Rigidity of superdense coding
Ashwin Nayak, Henry Yuen
The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a…
Quantum soundness of the classical low individual degree test
Zhengfeng Ji, Anand Natarajan, Thomas Vidick +2
Low degree tests play an important role in classical complexity theory, serving as basic ingredients in foundational results such as [BFL91] and the…
Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
Roeland Wiersema, Cunlu Zhou, Yvette de Sereville +3
Quantum variational algorithms are one of the most promising applications of near-term quantum computers; however, recent studies have demonstrated that unless the variational quan…
Quantum Garbled Circuits
Zvika Brakerski, Henry Yuen
We present a garbling scheme for quantum circuits, thus achieving a decomposable randomized encoding scheme for quantum computation. Specifically, we show how to compute an encodin…
On the complexity of zero gap MIP*
Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen
The class is the set of languages decidable by multiprover interactive proofs with quantum entangled provers. It was recently shown by Ji, Natarajan, Vidick, Wrigh…
Quantum statistical query learning
Srinivasan Arunachalam, Alex B. Grilo, Henry Yuen
We propose a learning model called the quantum statistical learning QSQ model, which extends the SQ learning model introduced by Kearns to the quantum setting. Our model can be als…