Scholarlink

Formal verification techniques in quantum computing are essential for ensuring the correctness of complex algorithms and protocols. This review examines verification from the perspective of quantum interactive proof (QIP) systems and quantum-classical Merlin–Arthur (QCMA) protocols. We survey semidefinite programming (SDP) formulations for quantum verification. Classical-verifier protocols are also analyzed, including cryptographic schemes (such as Mahadev’s) that allow a classical client to certify quantum computations.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Comprehensive Review of Quantum Complexity Theory Classes in Formal Verification

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Mahmoud Naderi,
  • Muhammad Naveed Zafar,
  • Marko Pezer,
  • Manuel Mazzara

摘要

Formal verification techniques in quantum computing are essential for ensuring the correctness of complex algorithms and protocols. This review examines verification from the perspective of quantum interactive proof (QIP) systems and quantum-classical Merlin–Arthur (QCMA) protocols. We survey semidefinite programming (SDP) formulations for quantum verification. Classical-verifier protocols are also analyzed, including cryptographic schemes (such as Mahadev’s) that allow a classical client to certify quantum computations.