Pith. sign in

Quantum Lower Bounds for Fanout

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We prove several new lower bounds for constant depth quantum circuits. The main result is that parity (and hence fanout) requires log depth circuits, when the circuits are composed of single qubit and arbitrary size Toffoli gates, and when they use only constantly many ancill\ae. Under this constraint, this bound is close to optimal. In the case of a non-constant number $a$ of ancillae, we give a tradeoff between $a$ and the required depth, that results in a non-trivial lower bound for fanout when $a = n^{1-o(1)}$.

fields

quant-ph 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Quantum State Readout via Overlap-Based Feature Extraction

quant-ph · 2025-05-13 · conditional · novelty 6.0

A quantum state is read out by measuring overlaps against Lorentzian basis states and fitting the coefficients classically, reducing the number of measurements for localized, continuous states.

citing papers explorer

Showing 1 of 1 citing paper.

  • Quantum State Readout via Overlap-Based Feature Extraction quant-ph · 2025-05-13 · conditional · none · ref 63 · internal anchor

    A quantum state is read out by measuring overlaps against Lorentzian basis states and fitting the coefficients classically, reducing the number of measurements for localized, continuous states.