Space-bounded Quantum Computation

Space-Bounded Quantum Computation is a computational model in quantum complexity theory that characterizes the class of problems solvable by a quantum Turing machine using a bounded amount of memory space relative to the input size.

14

Publications

975

Citations

32

Authors

20

Institutions

Publications per year

2017–2026

3

Authors

32

  1. JW
    John Watrous

    University of Calgary, Canada

    3 publications · 99 citations

    3

    h-index

  2. KY
    Kazuyoshi Yoshimi

    The University of Tokyo, Japan

    1 publications · 13 citations

    1

    h-index

  3. PW
    Peter W. Shor

    AT&T (United States), United States

    1 publications · 279 citations

    1

    h-index

  4. JR
    John Realpe-Gómez

    Ames Research Center, United States

    1 publications · 100 citations

    1

    h-index

  5. NK
    Naoki Kawashima

    The University of Tokyo, Japan

    1 publications · 13 citations

    1

    h-index

1–5 of 32

Venues

  1. Computational Complexity

    CC · 1 publications · 63 citations

    1

    h-index

  2. Physical Review Letters

    PRL · 1 publications · 191 citations

    1

    h-index

  3. Parallel Computing

    1 publications · 100 citations

    1

    h-index

  4. Lobachevskii Journal of Mathematics

    LJM · 1 publications · 30 citations

    1

    h-index

  5. Theoretical Computer Science

    1 publications · 44 citations

    1

    h-index

1–5