REVIEW 2 cited by
Tight bounds on depth-2 QAC-circuits computing parity
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
read the original abstract
We show that the parity of more than three non-target input bits cannot be computed by QAC-circuits of depth-2, not even uncleanly, regardless of the number of ancilla qubits. This result is incomparable with other recent lower bounds on constant-depth QAC-circuits by Rosenthal [ICTS~2021,arXiv:2008.07470] and uses different techniques which may be of independent interest: 1. We show that all members of a certain class of multivariate polynomials are irreducible. The proof applies a technique of Shpilka & Volkovich [STOC 2008]. 2. We give a tight-in-some-sense characterization of when a multiqubit CZ gate creates or removes entanglement from the state it is applied to. The current paper strengthens an earlier version of the paper [arXiv:2005.12169].
Forward citations
Cited by 2 Pith papers
-
Shor's algorithm requires Fanout
Constant-depth quantum Fourier transform is possible iff constant-depth fanout is possible.
-
Hard-to-Sample Distributions from Robust Extractors
Robust extractors yield explicit distributions at statistical distance 1-o(1) from the outputs of low-depth circuits, small-space sources, and low-degree F2-polynomial sources.
Discussion (0). Continue with ORCID to comment.