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

Authors

145

  1. TC
    Timothy C. Ralph

    The University of Queensland, Australia

    4 publications · 168 citations

    4

    h-index

  2. PP
    Peter P. Rohde

    Macquarie University, Australia

    4 publications · 148 citations

    4

    h-index

  3. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    4 publications · 157 citations

    4

    h-index

  4. BF
    Bill Fefferman

    University of Chicago, United States

    4 publications · 399 citations

    4

    h-index

  5. JE
    Jens Eisert

    Freie Universität Berlin, Germany

    3 publications · 112 citations

    3

    h-index

1–5 of 145

Venues

  1. Physical Review Letters

    PRL · 6 publications · 302 citations

    6

    h-index

  2. IEEE Transactions on Signal Processing

    6 publications · 334 citations

    6

    h-index

  3. Physical review. A/Physical review, A

    PRA · 6 publications · 407 citations

    6

    h-index

  4. arXiv (Cornell University)

    Repository · 5 publications · 172 citations

    5

    h-index

  5. Physical Review A

    PRA · 4 publications · 148 citations

    4

    h-index

1–5