Quantum Merlin-Arthur and Proofs Without Relative Phase

被引:0
|
作者
Bassirian, Roozbeh [1 ]
Fefferman, Bill [1 ]
Marwaha, Kunal [1 ]
机构
[1] Univ Chicago, Chicago, IL 60637 USA
来源
15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024 | 2024年
关键词
quantum complexity; QMA(2); PCPs;
D O I
10.4230/LIPIcs.ITCS.2024.9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study a variant of QMA where quantum proofs have no relative phase (i.e. non-negative amplitudes, up to a global phase). If only completeness is modified, this class is equal to QMA [21]; but if both completeness and soundness are modified, the class (named QMA+ by Jeronimo and Wu [24]) can be much more powerful. We show that QMA(+) with some constant gap is equal to NEXP, yet QMA(+) with some other constant gap is equal to QMA. One interpretation is that Merlin's ability to "deceive" originates from relative phase at least as much as from entanglement, since QMA(2)subset of NEXP.
引用
收藏
页数:19
相关论文
共 50 条
  • [1] QUANTUM MERLIN-ARTHUR WITH CLIFFORD ARTHUR
    Morimae, Tomoyuki
    Hayashi, Masahito
    Nishimura, Harumichi
    Fujii, Keisuke
    QUANTUM INFORMATION & COMPUTATION, 2015, 15 (15-16) : 1420 - 1430
  • [2] Quantum Merlin-Arthur with Clifford Arthur
    Morimae, Tomoyuki
    Hayashi, Masahito
    Nishimura, Harumichi
    Fujii, Keisuke
    Quantum Information and Computation, 2015, 15 (15-16): : 1420 - 1430
  • [3] Pinned quantum Merlin-Arthur: The power of fixing a few qubits in proofs
    Nagaj, Daniel
    Hangleiter, Dominik
    Eisert, Jens
    Schwarz, Martin
    PHYSICAL REVIEW A, 2021, 103 (01)
  • [4] RELATIVIZED ARTHUR-MERLIN VERSUS MERLIN-ARTHUR GAMES
    SANTHA, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 287 : 435 - 442
  • [5] Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy
    Morimae, Tomoyuki
    Takeuchi, Yuki
    Nishimura, Harumichi
    QUANTUM, 2018, 2
  • [6] RELATIVIZED ARTHUR-MERLIN VERSUS MERLIN-ARTHUR GAMES
    SANTHA, M
    INFORMATION AND COMPUTATION, 1989, 80 (01) : 44 - 49
  • [7] Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur?
    Kobayashi, H
    Matsumoto, K
    Yamakami, T
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 189 - 198
  • [8] Quadratic Simulations of Merlin-Arthur Games
    Watson, Thomas
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 864 - 872
  • [9] On Distributed Merlin-Arthur Decision Protocols
    Fraigniaud, Pierre
    Montealegre, Pedro
    Oshman, Rotem
    Rapaport, Ivan
    Todinca, Ioan
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2019, 2019, 11639 : 230 - 245
  • [10] Quadratic Simulations of Merlin-Arthur Games
    Watson, Thomas
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2020, 12 (02)