1 citations · 1 across the 2 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2025
Two bases suffice for QMA1-completeness
Henry Ma, Anand Natarajan
We introduce a basis-restricted variant of the Quantum-k-SAT problem, in which each term in the input Hamiltonian is required to be diagonal in either the standard or Hadamard basi…
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-ph2024★ 2 cited
Classical Commitments to Quantum States
Sam Gunn, Yael Tauman Kalai, Anand Natarajan +1
We define the notion of a classical commitment scheme to quantum states, which allows a quantum prover to compute a classical commitment to a quantum state, and later open each qub…