Simpler Presentations for Many Fragments of Quantum Circuits

Colin Blake

arxiv: 2602.09874 · v2 · submitted 2026-02-10 · 🪐 quant-ph · cs.LO

Simpler Presentations for Many Fragments of Quantum Circuits

Colin Blake This is my paper

Pith reviewed 2026-05-16 05:15 UTC · model grok-4.3

classification 🪐 quant-ph cs.LO

keywords quantum circuitsClifford groupequational reasoningrewrite rulesPROP categoriescircuit optimisationcompleteness

0 comments

The pith

Treating wire permutations as structural yields minimal rewrite rules for six near-Clifford quantum circuit fragments.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper develops equational presentations for qubit Clifford, real Clifford, Clifford+T up to two qubits, Clifford+CS up to three qubits, CNOT-dihedral, and qutrit Clifford fragments by shifting to a PROP setting where wire permutations count as structural operations. It begins with existing completeness theorems, transfers them into this setting, and eliminates redundant non-structural rules while verifying that all equivalences survive. The resulting rule sets are minimal across every arity for the qubit Clifford, real Clifford, and CNOT-dihedral fragments, and minimal within bounded arities for the remaining fragments, all following one shared transfer-and-separation pattern.

Core claim

Starting from prior completeness theorems, completeness is transferred into the PROP setting and non-structural rules are removed. The resulting presentations are minimal in all arities for qubit Clifford, real Clifford, and CNOT-dihedral, minimal in bounded ranges for Clifford+T, Clifford+CS, and qutrit Clifford, and comparable by one transfer-and-separation pattern.

What carries the argument

The PROP setting in which permutations of wires are treated as structural morphisms, isolating algebraic rewrite rules from wiring.

Load-bearing premise

Prior completeness theorems for these circuit fragments transfer into the PROP setting while preserving all equivalences and permitting removal of non-structural rules.

What would settle it

A concrete circuit equivalence belonging to one of the fragments that holds under the standard semantics but cannot be derived from the proposed minimal rule set after the transfer.

read the original abstract

Equational reasoning is central to quantum circuit optimisation and verification: one replaces subcircuits by provably equivalent ones using a fixed set of rewrite rules viewed as equations. A finite rule set is most informative when it separates the genuine algebra of a circuit fragment from the structural treatment of wires. This paper gives six near-Clifford fragments a common PROP treatment, where wire permutations are structural: qubit Clifford, real Clifford, Clifford+T (up to two qubits), Clifford+CS (up to three qubits), CNOT-dihedral, and qutrit Clifford. Starting from prior completeness theorems, we transfer completeness into this setting and remove redundant non-structural rules, then check minimality by separating interpretations tailored to individual axioms; the resulting presentations are minimal in all arities for qubit Clifford, real Clifford, and CNOT-dihedral, minimal in bounded ranges for the remaining fragments, and comparable by one transfer-and-separation pattern.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Blake transfers prior completeness results into a PROP setting to strip redundant rules and obtain minimal presentations for six near-Clifford fragments.

read the letter

The main takeaway is that this paper moves existing completeness theorems for qubit Clifford, real Clifford, CNOT-dihedral and three other fragments into a PROP where permutations are structural, then drops non-structural rules that turn out to be redundant and checks the result with separating interpretations. For the first three fragments the reduced sets are minimal in every arity; the others get minimality up to bounded arity. The uniform transfer-and-separation pattern is the concrete new piece of work here and it produces smaller, more usable rule sets for anyone doing equational reasoning on these circuits. That is useful for optimization and verification tools because fewer rules mean simpler implementations without losing the ability to prove all the equivalences that mattered before. The approach is honest about building on prior theorems rather than reproving everything from scratch. The soft spot is exactly the transfer step the stress-test flagged. Completeness of the reduced presentations depends on the PROP structural rules plus the kept axioms still generating the full equational theory; if any removed rule was not fully redundant under the new structural treatment, some equivalences would disappear. The abstract sketches the method but the full paper must show the transfer arguments in detail and confirm that the separating interpretations catch every case. Without those details the minimality claims for all arities rest on an assumption that needs explicit verification. This is for people who build or use rewrite systems for quantum circuits, especially near-Clifford fragments. It is worth a serious referee because the results are concrete simplifications that could be adopted in practice and the method is clear enough to check, even if the transfer proofs will probably need revision.

Referee Report

2 major / 2 minor

Summary. The paper presents a unified PROP-based approach to equational presentations for six near-Clifford quantum circuit fragments: qubit Clifford, real Clifford, Clifford+T (up to two qubits), Clifford+CS (up to three qubits), CNOT-dihedral, and qutrit Clifford. Starting from prior completeness results, it transfers them to a setting where wire permutations are structural, removes redundant non-structural rules, and verifies minimality using separating interpretations. The presentations are minimal in all arities for qubit Clifford, real Clifford, and CNOT-dihedral, and in bounded ranges for the remaining fragments.

Significance. If the completeness is successfully transferred without loss of equivalences, this provides minimal rule sets that separate the algebraic content from structural wiring, which is useful for quantum circuit optimization and verification. The common transfer-and-separation pattern across fragments is a notable contribution if rigorously established.

major comments (2)

[Completeness transfer] The central claim relies on transferring prior completeness theorems into the PROP setting and removing non-structural rules while preserving all equivalences. A specific lemma or argument showing that the structural rules for permutations plus retained axioms suffice for the full equational theory is needed, as any gap would invalidate the minimality results for the three fragments claimed to be minimal in all arities.
[Minimality proofs] For the separating interpretations used to show minimality, ensure they are defined for all arities where minimality is claimed, particularly for the bounded-range fragments like Clifford+T up to two qubits.

minor comments (2)

[Abstract] The abstract mentions 'comparable by one transfer-and-separation pattern' but does not specify what this pattern is; a brief description would help readers.
[Notation] Standardize the naming of the fragments throughout the paper for consistency.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We appreciate the recognition of the unified PROP-based approach across the six fragments. We address each major comment below and will make the indicated revisions to strengthen the presentation.

read point-by-point responses

Referee: The central claim relies on transferring prior completeness theorems into the PROP setting and removing non-structural rules while preserving all equivalences. A specific lemma or argument showing that the structural rules for permutations plus retained axioms suffice for the full equational theory is needed, as any gap would invalidate the minimality results for the three fragments claimed to be minimal in all arities.

Authors: We agree that an explicit lemma would improve clarity and rigor. In the revised manuscript we will insert a new Lemma 3.1 in Section 3 that formally proves the completeness transfer: the PROP structural rules for wire permutations, together with the retained axioms from each prior theorem, generate the full equational theory without loss of equivalences. The proof will proceed by showing that any derivation in the original presentation can be simulated using the structural permutations plus the kept rules, and conversely. This addition directly supports the minimality claims for qubit Clifford, real Clifford, and CNOT-dihedral in all arities. revision: yes
Referee: For the separating interpretations used to show minimality, ensure they are defined for all arities where minimality is claimed, particularly for the bounded-range fragments like Clifford+T up to two qubits.

Authors: The separating interpretations are already defined exactly on the arities for which minimality is claimed. For Clifford+T (up to two qubits) the interpretations are given for arities 0, 1 and 2; for Clifford+CS (up to three qubits) they cover arities 0 through 3. In the revision we will add an explicit sentence at the start of each minimality subsection stating the precise arity range covered by the corresponding interpretation, thereby removing any potential ambiguity. revision: yes

Circularity Check

0 steps flagged

No significant circularity: completeness transferred from external priors with independent minimality verification

full rationale

The derivation begins from prior completeness theorems (treated as external inputs), transfers them into the PROP setting, removes non-structural rules, and verifies minimality via separate interpretations tailored to individual axioms. No step reduces a claimed result to its own inputs by construction, no fitted parameters are relabeled as predictions, and no load-bearing self-citation chain is exhibited. The minimality statements rest on the post-transfer separation check rather than definitional equivalence, keeping the chain self-contained against the cited external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on standard category-theoretic structures and prior completeness results without introducing new free parameters or postulated entities.

axioms (2)

standard math Axioms of PROPs as symmetric monoidal categories with structural permutations
The framework treats wire permutations as structural, which rests on the standard definition of PROPs.
domain assumption Completeness of the cited prior rule sets for each fragment
The transfer of completeness begins from these prior theorems as stated in the abstract.

pith-pipeline@v0.9.0 · 5442 in / 1337 out tokens · 33149 ms · 2026-05-16T05:15:01.723984+00:00 · methodology

Simpler Presentations for Many Fragments of Quantum Circuits

Core claim

What carries the argument

Load-bearing premise

What would settle it

discussion (0)