REVIEW 2 cited by
Quantum Lower Bounds for Fanout
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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)}$.
Forward citations
Cited by 2 Pith papers
-
Quantum State Readout via Overlap-Based Feature Extraction
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.
-
Quantum circuit lower bounds in the magic hierarchy
A Clifford circuit followed by a shallow two-qubit circuit cannot prepare several explicit entangled states, including some topological ground states and quantum codes.
Discussion (0). Continue with ORCID to comment.