Pith. sign in

REVIEW 2 cited by

Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement

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 2505.07804 v2 pith:IYIL6OIP submitted 2025-05-12 quant-ph cs.CCmath-phmath.MP

classification quant-phcs.CCmath-phmath.MP
keywords circuitsclassicalcomplexityefficientframeworkquontopologicalboundary
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a new framework of topological complexity to study the computational complexity of quantum circuits and tensor networks. Within this framework, we establish the Quon Classical Simulation (QCS) for hybrid Clifford-Matchgate circuits, which is efficient for both Clifford circuits and Matchgate circuits, therefore answering a long standing open question on unifying efficient classical simulations. This framework is built upon the Quon language, a 2+1D topological quantum field theory with space-time boundary and defects. Its exponential computation complexity is captured by Magic holes, a topological feature capturing the global long-range entanglement. Both Clifford circuits and Matchgate circuits are free of Magic holes. Efficient classical simulations of Cliffords and Matchgates are implemented by two parallel operations, generalized surgery theory of 3-manifolds and Yang-Baxter relations on the 2D boundary respectively, with additional binary arithmetic properties.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Graphical Calculus for Fermionic Tensors

    quant-ph 2025-08 conditional novelty 6.0 of 10

    A parity-aware graphical calculus extends the ZX diagram language to fermionic modes, covering Gaussian states, partial traces, purification, fermionization/bosonization, and fermionic error-correcting codes.

  2. Characterizing Pauli Propagation via Operator Complexity

    quant-ph 2025-10 conditional novelty 5.0 of 10

    Truncation error in Pauli propagation is bounded by Operator Stabilizer Rényi entropy, giving a Top-K budget formula, and the 1D XY chain's evolved local operator has O(s²) Pauli terms.

Pith tools