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

Authors

301

  1. AA
    Andris Ambainis

    University of Latvia, Latvia

    8 publications · 321 citations

    8

    h-index

  2. MS
    Miklós Sántha

    Centre National de la Recherche Scientifique, France

    8 publications · 249 citations

    8

    h-index

  3. FM
    Frédéric Magniez

    Centre National de la Recherche Scientifique, France

    6 publications · 258 citations

    6

    h-index

  4. XW
    Xiaodi Wu

    University of Maryland, College Park, United States

    5 publications · 171 citations

    5

    h-index

  5. RD
    Ronald de Wolf

    Centrum Wiskunde & Informatica, Netherlands

    5 publications · 310 citations

    5

    h-index

1–5 of 301

Venues

  1. arXiv (Cornell University)

    Repository · 20 publications · 484 citations

    16

    h-index

  2. ArXiv.org

    Repository · 16 publications · 751 citations

    12

    h-index

  3. Physical Review Letters

    PRL · 10 publications · 1.7K citations

    10

    h-index

  4. Physical Review A

    PRA · 10 publications · 428 citations

    10

    h-index

  5. Quantum Information and Computation

    QIC · 10 publications · 253 citations

    10

    h-index

1–5