Qma

QMA is a complexity class in quantum computational complexity theory that consists of decision problems for which a quantum verifier can efficiently check a quantum proof with bounded error, distinguishing it from other complexity classes by its reliance on quantum witnesses and quantum computation.

111

Publications

5.3K

Citations

176

Authors

113

Institutions

Publications per year

2017–2026

15

Authors

176

  1. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    8 publications · 180 citations

    8

    h-index

  2. DN
    Daniel Nagaj

    Slovak Academy of Sciences, Slovakia

    5 publications · 220 citations

    5

    h-index

  3. JW
    John Watrous

    University of Calgary, Canada

    5 publications · 409 citations

    5

    h-index

  4. DA
    Dorit Aharonov

    Hebrew University of Jerusalem, Israel

    4 publications · 394 citations

    4

    h-index

  5. AB
    Anne Broadbent

    University of Ottawa, Canada

    4 publications · 69 citations

    4

    h-index

1–5 of 176

Venues

  1. arXiv (Cornell University)

    Repository · 11 publications · 224 citations

    10

    h-index

  2. Quantum Information and Computation

    QIC · 9 publications · 434 citations

    9

    h-index

  3. ArXiv.org

    Repository · 7 publications · 217 citations

    7

    h-index

  4. SIAM Journal on Computing

    5 publications · 138 citations

    5

    h-index

  5. International Journal of Quantum Information

    IJQI · 2 publications · 83 citations

    2

    h-index

1–5