Qcma

QCMA is a complexity class in quantum computational complexity theory that consists of decision problems for which a classical proof can be efficiently verified by a quantum polynomial-time verifier, distinguishing it from QMA by requiring the witness to be classical.

16

Publications

517

Citations

34

Authors

19

Institutions

Publications per year

2017–2026

4

Authors

34

  1. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    4 publications · 88 citations

    4

    h-index

  2. CQ
    Carsten Q. Schneider

    Central European University, Austria

    2 publications · 241 citations

    2

    h-index

  3. AM
    Axel Marx

    KU Leuven, Belgium

    2 publications · 41 citations

    2

    h-index

  4. BR
    Benoît Rihoux

    UCLouvain, Belgium

    2 publications · 41 citations

    2

    h-index

  5. UA
    Ulrich A. Dietz

    Universitätsklinikum Würzburg, Germany

    1 publications · 24 citations

    1

    h-index

1–5 of 34

Venues

  1. ArXiv.org

    Repository · 2 publications · 27 citations

    2

    h-index

  2. Quantum Information and Computation

    QIC · 2 publications · 37 citations

    2

    h-index

  3. Lecture notes in computer science

    LNCS · Book series · 1 publications · 11 citations

    1

    h-index

  4. Quantum

    1 publications · 23 citations

    1

    h-index

  5. International journal of cardiac imaging

    1 publications · 24 citations

    1

    h-index

1–5