Pith. sign in

REVIEW 1 cited by

Classification of qubit cellular automata on hypercubic lattices

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 2408.04493 v2 pith:XIVJVMT3 submitted 2024-08-08 quant-ph

classification quant-ph
keywords automatacellularhypercubiclatticesquantumcellcellscharacterisation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We classify quantum cellular automata whose cells are qubits, on hypercubic lattices $\mathbb Z^s$, with the von Neumann neighborhood scheme, in terms of realizability as finite-depth quantum circuits. We show the most general structure of such automata and use its characterisation to simulate a few steps of evolution and evaluate the rate of entanglement production between one cell and its surroundings.

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