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
Parents
16
Carsten Q. Schneider · Political Analysis · 2018 · 139 citations · Full text
Ulrich A. Dietz, Hans‐Jürgen Rupprecht, Rüdiger Brennecke et al. · International journal of cardiac imaging · 1997 · 24 citations
1–5 of 16
34
4
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 34
19

University of Waterloo
Waterloo, Canada
2 h-index
2 publications
56 citations
Université Paris Cité
Paris, France
1 h-index
1 publications
17 citations
Hebrew University of Jerusalem
Jerusalem, Israel
1 h-index
2 publications
46 citations
Centre for Quantum Technologies
Singapore, Singapore
1 h-index
1 publications
17 citations
The University of Tokyo
Tokyo, Japan
1 h-index
1 publications
11 citations
California Institute of Technology
Pasadena, United States
1 h-index
1 publications
23 citations
Universitat de Barcelona
Barcelona, Spain
1 h-index
5 publications
55 citations
Délégation Paris 7
Bagnolet, France
1 h-index
1 publications
17 citations
1–8 of 19
Repository · 2 publications · 27 citations
2
h-index
QIC · 2 publications · 37 citations
2
h-index
LNCS · Book series · 1 publications · 11 citations
1
h-index
1 publications · 23 citations
1
h-index
1 publications · 24 citations
1
h-index
1–5