Zobrazeno 1 - 10
of 203
pro vyhledávání: '"Natarajan, Anand"'
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 of Mahadev (FOCS '18), Bartusek et al. (CRYPTO '22) also constructed a
Externí odkaz:
http://arxiv.org/abs/2404.19754
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 qubit of the state in either the standard or the Hadamard basis. Our noti
Externí odkaz:
http://arxiv.org/abs/2404.14438
Autor:
Natarajan, Anand, Nirkhe, Chinmay
In classical complexity theory, the two definitions of probabilistically checkable proofs -- the constraint satisfaction and the nonlocal games version -- are computationally equal in power. In the quantum setting, the situation is far less clear. Th
Externí odkaz:
http://arxiv.org/abs/2403.13084
Autor:
Cui, David, Malavolta, Giulio, Mehta, Arthur, Natarajan, Anand, Paddock, Connor, Schmidt, Simon, Walter, Michael, Zhang, Tina
Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. In this work, we continue the study initiated by Kalai et al. (STOC '23) of compil
Externí odkaz:
http://arxiv.org/abs/2402.17301
Quantum multiprover interactive proof systems with entanglement MIP* are much more powerful than its classical counterpart MIP (Babai et al. '91, Ji et al. '20): while MIP = NEXP, the quantum class MIP* is equal to RE, a class including the halting p
Externí odkaz:
http://arxiv.org/abs/2312.04360
The polynomial hierarchy has been widely studied in classical complexity theory. In this paper, we will generalize some commonly known results about the polynomial hierarchy to a version of the hierarchy extended to promise problems. This paper propo
Externí odkaz:
http://arxiv.org/abs/2311.12228
Autor:
Natarajan, Anand, Zhang, Tina
We present a step towards the goal of producing a general cryptographic 'compilation' procedure which can translate any entangled nonlocal game into a single-prover interactive protocol while preserving quantum completeness and soundness, using crypt
Externí odkaz:
http://arxiv.org/abs/2303.01545
Autor:
Natarajan, Anand, Zhang, Tina
The complexity of free games with two or more classical players was essentially settled by Aaronson, Impagliazzo, and Moshkovitz (CCC'14). There are two complexity classes that can be considered quantum analogues of classical free games: (1) AM*, the
Externí odkaz:
http://arxiv.org/abs/2302.04322
Autor:
Natarajan, Anand, Nirkhe, Chinmay
Publikováno v:
Quantum 8, 1377 (2024)
It is a long-standing open question in quantum complexity theory whether the definition of $\textit{non-deterministic}$ quantum computation requires quantum witnesses $(\textsf{QMA})$ or if classical witnesses suffice $(\textsf{QCMA})$. We make progr
Externí odkaz:
http://arxiv.org/abs/2210.15380
Publikováno v:
Quantum 8, 1501 (2024)
In this paper, we present two constructions of quantum locally testable codes (QLTC) with constant soundness. In the first approach, we introduce an operation called check product, and show how this operation gives rise to QLTCs of constant soundness
Externí odkaz:
http://arxiv.org/abs/2209.11405