Quantum Cryptographic Complexity
Quantum Cryptographic Complexity is a theoretical framework within quantum complexity theory that characterizes the computational resources required to break cryptographic protocols secure against quantum adversaries, distinguished by its incorporation of quantum query models, bounded-error quantum polynomial time constraints, and reductions between cryptographic primitives in the presence of quantum oracles.
28
Publications
878
Citations
61
Authors
50
Institutions
Publications per year
2017–2026
10
Parents
28
Limits on the power of quantum statistical zero-knowledge
John Watrous · 2003 · 113 citations
Computational complexity of the quantum separability problem
Lawrence M. Ioannou · 2007 · 71 citations
1–5 of 28
61
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 61
50
Mitre (United States)
Bedford, United States
2 h-index
4 publications
60 citations

University of Calgary
Calgary, Canada
2 h-index
2 publications
135 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
4 publications
70 citations
Russian Academy of Sciences
Moscow, Russia
1 h-index
4 publications
68 citations
Institut de Recherche en Informatique Fondamentale
Paris, France
1 h-index
1 publications
16 citations
Institute for Quantum Optics and Quantum Information Innsbruck
Innsbruck, Austria
1 h-index
1 publications
14 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
1 h-index
1 publications
12 citations
Instituto de Telecomunicações
Lisbon, Portugal
1 h-index
5 publications
195 citations
1–8 of 50
QIC · 3 publications · 94 citations
3
h-index
Repository · 2 publications · 27 citations
2
h-index
PRA · 1 publications · 21 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5