Quantum Time Complexity

Quantum Time Complexity is a theoretical measure in computational complexity theory that characterizes the minimum number of elementary quantum operations required by a quantum algorithm to solve a given computational problem, distinguishing it from classical time complexity by accounting for quantum superposition, entanglement, and interference.

106

Publications

4.6K

Citations

252

Authors

165

Institutions

Publications per year

2017–2026

49

Authors

252

  1. AA
    Andris Ambainis

    University of Latvia, Latvia

    7 publications · 390 citations

    7

    h-index

  2. MS
    Márió Szegedy

    Rutgers, The State University of New Jersey, United States

    4 publications · 76 citations

    4

    h-index

  3. RP
    Renato Portugal

    Laboratório Nacional de Computação Científica, Brazil

    3 publications · 54 citations

    3

    h-index

  4. PK
    Prasanta K. Panigrahi

    Indian Institute of Science Education and Research Kolkata, India

    3 publications · 55 citations

    3

    h-index

  5. FL
    François Le Gall

    The University of Tokyo, Japan

    3 publications · 62 citations

    3

    h-index

1–5 of 252

Venues

  1. Physical Review Letters

    PRL · 8 publications · 539 citations

    8

    h-index

  2. arXiv (Cornell University)

    Repository · 7 publications · 130 citations

    7

    h-index

  3. Physical review. A/Physical review, A

    PRA · 7 publications · 275 citations

    7

    h-index

  4. ArXiv.org

    Repository · 7 publications · 472 citations

    7

    h-index

  5. Physical Review A

    PRA · 6 publications · 310 citations

    6

    h-index

1–5