Fermionic cellular automata in one dimension are classified up to finite-depth circuits without ancillas, and a new 'forking' automaton is shown to be implementable but not expressible by qubit-style gates.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fermionic cellular automata in one dimension
Fermionic cellular automata in one dimension are classified up to finite-depth circuits without ancillas, and a new 'forking' automaton is shown to be implementable but not expressible by qubit-style gates.