Pith. sign in

REVIEW 1 cited by

Depth-2 QAC circuits cannot simulate quantum 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

arxiv 2005.12169 v1 pith:E4EVRS4B submitted 2020-05-25 quant-ph cs.CC

classification quant-phcs.CC
keywords quantumgateparityqubitsancillaapplyarbitrarycannot
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We show that the quantum parity gate on $n > 3$ qubits cannot be cleanly simulated by a quantum circuit with two layers of arbitrary C-SIGN gates of any arity and arbitrary 1-qubit unitary gates, regardless of the number of allowed ancilla qubits. This is the best known and first nontrivial separation between the parity gate and circuits of this form. The same bounds also apply to the quantum fanout gate. Our results are incomparable with those of Fang et al. [3], which apply to any constant depth but require a sublinear number of ancilla qubits on the simulating circuit.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Shor's algorithm requires Fanout

    quant-ph 2026-08 conditional novelty 7.0 of 10

    Constant-depth quantum Fourier transform is possible iff constant-depth fanout is possible.

Pith tools