291 citations · 380 across the 13 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
quant-ph2024
On the hardness of cloning and connections to representation theory
Vojtěch Havlíček, Chinmay Nirkhe
The states accepted by a quantum circuit are known as the witnesses for the quantum circuit's satisfiability. The assumption BQP does not equal QMA implies that no efficient algori…
quant-ph2024★ 1 cited
The status of the quantum PCP conjecture (games version)
Anand Natarajan, Chinmay Nirkhe
In classical complexity theory, the two definitions of probabilistically checkable proofs -- the constraint satisfaction and the nonlocal games version -- are computationally equal…