Toward Separating QMA from QCMA with a Classical Oracle

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Zhandry, Mark
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917827757211648
author Zhandry, Mark
author_facet Zhandry, Mark
contents QMA is the class of languages that can be decided by an efficient quantum verifier given a quantum witness, whereas QCMA is the class of such languages where the efficient quantum verifier only is given a classical witness. A challenging fundamental goal in quantum query complexity is to find a classical oracle separation for these classes. In this work, we offer a new approach towards proving such a separation that is qualitatively different than prior work, and show that our approach is sound assuming a natural statistical conjecture which may have other applications to quantum query complexity lower bounds.
format Preprint
id arxiv_https___arxiv_org_abs_2411_01718
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Toward Separating QMA from QCMA with a Classical Oracle
Zhandry, Mark
Quantum Physics
Computational Complexity
QMA is the class of languages that can be decided by an efficient quantum verifier given a quantum witness, whereas QCMA is the class of such languages where the efficient quantum verifier only is given a classical witness. A challenging fundamental goal in quantum query complexity is to find a classical oracle separation for these classes. In this work, we offer a new approach towards proving such a separation that is qualitatively different than prior work, and show that our approach is sound assuming a natural statistical conjecture which may have other applications to quantum query complexity lower bounds.
title Toward Separating QMA from QCMA with a Classical Oracle
topic Quantum Physics
Computational Complexity
url https://arxiv.org/abs/2411.01718