REVIEW 2 cited by
Decomposing Quantum Generalized Toffoli with an Arbitrary Number of Ancilla
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
abstract
We present a general decomposition of the Generalized Toffoli, and for completeness, the multi-target gate using an arbitrary number of clean or dirty ancilla. While prior work has shown how to decompose the Generalized Toffoli using 0, 1, or $O(n)$ many clean ancilla and 0, 1, and $n-2$ dirty ancilla, we provide a generalized algorithm to bridge the gap, i.e. this work gives an algorithm to generate a decomposition for any number of clean or dirty ancilla. While it is hard to guarantee optimality, our decompositions guarantee a decrease in circuit depth as the number of ancilla increases.
Forward citations
Cited by 2 Pith papers
-
Depth-Efficient Quantum Circuit Synthesis for Deterministic Dicke State Preparation
Deterministic quantum circuits prepare Dicke states in depth O(log k log(n/k)+k) with all-to-all connectivity and O(k log(n/k)+n_2) or O(n_2) on an n1 x n2 grid, with lower bounds showing near-optimality in several regimes.
-
On Exact Space-Depth Trade-Offs in Multi-Controlled Toffoli Decomposition
The paper gives exact Toffoli-depth versus ancilla-count formulas for multi-controlled Toffoli decomposition and claims a ceil(log2 n) lower bound, but the main formula is inconsistent with its own example.
Discussion (0). Continue with ORCID to comment.