Quantum Circuit Complexity

Quantum Circuit Complexity is the computational complexity measure that quantifies the minimum number of elementary quantum gates required to construct a given quantum circuit, distinguished from other complexity measures by its focus on the syntactic structure and resource cost of implementing unitary transformations in quantum computation.

347

Publications

21.9K

Citations

690

Authors

369

Institutions

Publications per year

2017–2026

189

Authors

690

  1. AA
    Andris Ambainis

    University of Latvia, Latvia

    9 publications · 441 citations

    9

    h-index

  2. AB
    Arpan Bhattacharyya

    Indian Institute of Technology Gandhinagar, India

    7 publications · 538 citations

    7

    h-index

  3. DE
    Dax Enshan Koh

    Agency for Science, Technology and Research, Singapore

    6 publications · 143 citations

    6

    h-index

  4. SZ
    Shengyu Zhang

    Tencent (China), China

    6 publications · 167 citations

    6

    h-index

  5. SA
    Scott Aaronson

    Massachusetts Institute of Technology, United States

    6 publications · 377 citations

    6

    h-index

1–5 of 690

Venues

  1. Quantum Information and Computation

    QIC · 24 publications · 1.4K citations

    21

    h-index

  2. Physical Review Letters

    PRL · 20 publications · 1.8K citations

    19

    h-index

  3. Journal of High Energy Physics

    JHEP · 22 publications · 2.2K citations

    18

    h-index

  4. Physical review. D/Physical review. D.

    PRD · 17 publications · 1.1K citations

    16

    h-index

  5. Physical review. A/Physical review, A

    PRA · 18 publications · 849 citations

    16

    h-index

1–5