1 citations · 1 across the 1 of their papers we have counts for
2 papers
quant-ph2024★ 1 cited
Succinct arguments for QMA from standard assumptions via compiled nonlocal games
Tony Metger, Anand Natarajan, Tina Zhang
We construct a succinct classical argument system for QMA, the quantum analogue of NP, from generic and standard cryptographic assumptions. Previously, building on the prior work o…
quant-ph2023
Public-key pseudoentanglement and the hardness of learning ground state entanglement structure
Adam Bouland, Bill Fefferman, Soumik Ghosh +4
Given a local Hamiltonian, how difficult is it to determine the entanglement structure of its ground state? We show that this problem is computationally intractable even if one is…