Sampling Complexity
Sampling Complexity is a computational complexity measure that quantifies the minimum number of samples or resource-intensive sampling operations required by a quantum algorithm to approximate or simulate the output distribution of a quantum computation to within a specified accuracy.
65
Publications
3K
Citations
145
Authors
114
Institutions
Publications per year
2017–2026
33
Parents
65
On the complexity and verification of quantum random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe et al. · Nature Physics · 2018 · 294 citations
Computing, Computer Science, Physics +12
A Novel Sampling Theorem on the Sphere
Jason D. McEwen, Yves Wiaux · IEEE Transactions on Signal Processing · 2011 · 174 citations · Full text
1–5 of 65
145
4
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 145
114
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
11 publications
497 citations
University of California, Berkeley
Berkeley, United States
6 h-index
10 publications
1.5K citations
Centre for Quantum Computation and Communication Technology
Sydney, Australia
5 h-index
7 publications
384 citations
Joint Center for Quantum Information and Computer Science
College Park, United States
4 h-index
11 publications
751 citations
ARC Centre of Excellence for Engineered Quantum Systems
Brisbane, Australia
4 h-index
9 publications
308 citations

The University of Queensland
Brisbane, Australia
4 h-index
15 publications
622 citations
University of Maryland, College Park
College Park, United States
4 h-index
11 publications
751 citations

Macquarie University
Sydney, Australia
4 h-index
7 publications
263 citations
1–8 of 114
PRL · 6 publications · 302 citations
6
h-index
6 publications · 334 citations
6
h-index
PRA · 6 publications · 407 citations
6
h-index
Repository · 5 publications · 172 citations
5
h-index
PRA · 4 publications · 148 citations
4
h-index
1–5