The Power of Shallow-depth Toffoli and Qudit Quantum Circuits

The relevance of shallow-depth quantum circuits has recently increased, mainly due to their applicability to near-term devices. In this context, one of the main goals of quantum circuit complexity is to find problems that can be solved by quantum shallow circuits but require more computational resources classically. Our first contribution in this work is to prove new separations between classical and quantum constant-depth circuits. Firstly, we show a separation between constant-depth quantum circuits with quantum advice \(\mathsf {QNC}^0/\mathsf {qpoly} \) , and \(\mathsf {AC}^0[p] \) , which is the class of classical constant-depth circuits with unbounded-fan in and \(\mathsf {MOD}_{p} \) gates. Additionally, we show a separation between \(\mathsf {QAC}^0 \) , the circuit class containing Toffoli gates with unbounded control, and \(\mathsf {AC}^0[p] \) , when \(\mathsf {QAC}^0 \) is augmented with additional mid-circuit measurements and classical fanout. This establishes the first such separation for a shallow-depth quantum class that does not involve quantum fanout gates, while relying solely on finite quantum gate sets. Equivalently, this yields a separation between \(\mathsf {AC}^0[p] \) and \([\mathsf {QNC}^0, \mathsf {AC}^0]^2 \) , i.e., shallow quantum circuits interleaved with simple classical computation. Secondly, we consider \(\mathsf {QNC}^0 \) circuits with infinite-size gate sets. We show that these circuits, along with quantum prime modular gates or classical prime modular gates in combination with classical fanout, can implement threshold gates, showing that \(\mathsf {QNC}^0[p]=\mathsf {QTC}^0 \) . Finally, we also show that in the infinite-size gate set case, these quantum circuit classes for higher-dimensional Hilbert spaces do not offer any advantage to standard qubit implementations.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Quantum Computing
Published
2026-05-18
DOI
https://doi.org/10.1145/3802819
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits

Damian Markham, Elham Kashefi, Michael de Oliveira, Alex B. Grilo
2 citations
ACM Transactions on Quantum Computing
Quantum Computing Algorithms and Architecture
preprint

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits

Damian Markham, Elham Kashefi, Michael de Oliveira, Alex B. Grilo
preprint en
2 citations

Abstract

The relevance of shallow-depth quantum circuits has recently increased, mainly due to their applicability to near-term devices. In this context, one of the main goals of quantum circuit complexity is to find problems that can be solved by quantum shallow circuits but require more computational resources classically. Our first contribution in this work is to prove new separations between classical and quantum constant-depth circuits. Firstly, we show a separation between constant-depth quantum circuits with quantum advice \(\mathsf {QNC}^0/\mathsf {qpoly} \) , and \(\mathsf {AC}^0[p] \) , which is the class of classical constant-depth circuits with unbounded-fan in and \(\mathsf {MOD}_{p} \) gates. Additionally, we show a separation between \(\mathsf {QAC}^0 \) , the circuit class containing Toffoli gates with unbounded control, and \(\mathsf {AC}^0[p] \) , when \(\mathsf {QAC}^0 \) is augmented with additional mid-circuit measurements and classical fanout. This establishes the first such separation for a shallow-depth quantum class that does not involve quantum fanout gates, while relying solely on finite quantum gate sets. Equivalently, this yields a separation between \(\mathsf {AC}^0[p] \) and \([\mathsf {QNC}^0, \mathsf {AC}^0]^2 \) , i.e., shallow quantum circuits interleaved with simple classical computation. Secondly, we consider \(\mathsf {QNC}^0 \) circuits with infinite-size gate sets. We show that these circuits, along with quantum prime modular gates or classical prime modular gates in combination with classical fanout, can implement threshold gates, showing that \(\mathsf {QNC}^0[p]=\mathsf {QTC}^0 \) . Finally, we also show that in the infinite-size gate set case, these quantum circuit classes for higher-dimensional Hilbert spaces do not offer any advantage to standard qubit implementations.

ACM Transactions on Quantum Computing
Sorbonne Université (FR), International Iberian Nanotechnology Laboratory (PT), University of Edinburgh (GB)
Agence Nationale de la Recherche, Fundação para a Ciência e a Tecnologia
Openalex Percentile: Top 100%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.