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 条
  • [21] Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity
    Akmal, Shyan
    Chen, Lijie
    Jin, Ce
    Raj, Malvika
    Williams, Ryan
    ALGORITHMICA, 2023, 85 (08) : 2395 - 2426
  • [22] Quantum Arthur-Merlin games
    Marriott, C
    Watrous, J
    COMPUTATIONAL COMPLEXITY, 2005, 14 (02) : 122 - 152
  • [23] Quantum Arthur-Merlin games
    Marriott, C
    Watrous, J
    19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 275 - 285
  • [24] GENERALIZED QUANTUM ARTHUR-MERLIN GAMES
    Kobayashi, Hirotada
    Le Gall, Francois
    Nishimura, Harumichi
    SIAM JOURNAL ON COMPUTING, 2019, 48 (03) : 865 - 902
  • [25] Generalized Quantum Arthur-Merlin Games
    Kobayashi, Hirotada
    Le Gall, Francois
    Nishimura, Harumichi
    30TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2015), 2015, 33 : 488 - 511
  • [26] Quantum nonexpander problem is quantum-Merlin-Arthur-complete
    Bookatz, Adam D.
    Jordan, Stephen P.
    Liu, Yi-Kai
    Wocjan, Pawel
    PHYSICAL REVIEW A, 2013, 87 (04):
  • [27] A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
    Pass, Rafael
    Venkitasubramaniam, Muthuramakrishnan
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2012, 4 (04)
  • [28] Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation
    Williams, Richard Ryan
    31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
  • [29] Adptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
    Terhal, BM
    DiVincenzo, DP
    QUANTUM INFORMATION & COMPUTATION, 2004, 4 (02) : 134 - 145
  • [30] Quantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices
    Jordan, Stephen P.
    Gosset, David
    Love, Peter J.
    PHYSICAL REVIEW A, 2010, 81 (03):