Pith. sign in

REVIEW 1 cited by

Fermionic cellular automata in one dimension

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2501.05349 v1 pith:QMHVEHRD submitted 2025-01-09 quant-ph cond-mat.stat-mechmath-phmath.MP

Lorenzo S. Trezzini , Matteo Lugli , Paolo Meda , Alessandro Bisio , Paolo Perinotti , Alessandro Tosini This is my paper
classification quant-phcond-mat.stat-mechmath-phmath.MP
keywords automatafermioniccellularcircuitsquantumtermsadditionancilla
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the addition of ancillary systems. We strengthen this result removing the ancilla degrees of freedom in defining the equivalence classes. A complete characterization of nearest-neighbours automata is given. A class of Fermionic automata is found which cannot be expressed in terms of single mode and controlled-phase gates composed with shifts, as is the case for qubit cellular automata.

Discussion (0). Sign in 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. Causal Decompositions of 1D Quantum Cellular Automata

    quant-ph 2025-06 conditional novelty 8.0 of 10

    For N > 4r, every 1D quantum cellular automaton of causality radius r is exactly a routed unitary circuit of nearest-neighbour interactions, and translation-invariant automata get translation-invariant circuits.

Pith tools