Quantum Algorithmic Complexity
Quantum Algorithmic Complexity is a theoretical framework that characterizes the inherent computational resources required by a quantum algorithm to solve a given problem, distinguished from classical algorithmic complexity by its incorporation of quantum mechanical principles such as superposition, entanglement, and interference in quantifying time, space, and query complexity within quantum computational models.
163
Publications
9.8K
Citations
301
Authors
178
Institutions
Publications per year
2017–2026
49
163
Complexity, action, and black holes
Adam R. Brown, Daniel A. Roberts, Leonard Susskind et al. · Physical review. D/Physical review. D. · 2016 · 655 citations · Full text
A Quantum Algorithm for Finding the Minimum
1–5 of 163
301
8
h-index
8
h-index
6
h-index
5
h-index
5
h-index
1–5 of 301
178
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
11 h-index
21 publications
1.3K citations

University of Amsterdam
Amsterdam, The Netherlands
8 h-index
9 publications
491 citations
University of Maryland, College Park
College Park, United States
7 h-index
18 publications
1.6K citations

University of Latvia
Riga, Latvia
7 h-index
9 publications
230 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
8 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
8 publications
396 citations
Joint Center for Quantum Information and Computer Science
College Park, United States
5 h-index
12 publications
1.2K citations

University of Waterloo
Waterloo, Canada
5 h-index
7 publications
303 citations
1–8 of 178
Repository · 20 publications · 484 citations
16
h-index
Repository · 16 publications · 751 citations
12
h-index
PRL · 10 publications · 1.7K citations
10
h-index
PRA · 10 publications · 428 citations
10
h-index
QIC · 10 publications · 253 citations
10
h-index
1–5