Approximate QCAs in one dimension using approximate algebras

• URL: http://arxiv.org/abs/2603.08702v1
• Date: Mon, 09 Mar 2026 17:58:16 GMT
• Title: Approximate QCAs in one dimension using approximate algebras
• Abstract summary: Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality.<n>We study approximate QCAs, where the locality condition is only satisfied up to a small error.<n>A priori, approximate QCAs could exhibit genuinely new behavior, failing to be well-approximated by any exact QCA.
• Score: 1.3438189447065458
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small error, as occurs for local quantum dynamics on the lattice. A priori, approximate QCAs could exhibit genuinely new behavior, failing to be well-approximated by any exact QCA. We show this does not occur in one dimension: every approximate QCA on a finite circle can be rounded to a strict QCA with approximately the same action on local operators, so these systems are classified by the same index as in the exact case. Previous work considered the case of the infinite line, by using global methods not amenable to finite systems. Our new approach proceeds locally and now applies to finite systems, including circles or homomorphisms from sub-intervals. We extract exact local boundary algebras from the approximate QCA restricted to local patches, then glue these to form a strict QCA. The key technical ingredient is a robust notion of the intersection of two subalgebras: when the projections onto two subalgebras approximately commute, we construct an exact subalgebra that serves as a stable proxy for their intersection. This construction uses a recent theorem of Kitaev on the rigidity of approximate $C^*$-algebras.

Related papers

• Non-Clifford quantum cellular automata from invertible topological quantum field theories [10.600087006666332]
  Quantum cellular automata (QCAs) describe locality-preserving quantum dynamics and connect quantum information, many-body physics, and topological quantum field theory (TQFT)<n>We develop a unified algebra that extends the commuting generators of the Hamiltonian to a complete separator-flipper algebra on the full tensor-product space.<n>We explicitly construct finite-depth quantum circuits for the 5-dimensional $w_32$ and $w_4k-1$ QCAs.
  arXiv  Detail & Related papers  (2026-07-23T18:00:00Z)
• $K$-Theoretic Obstructions to Linearizing QCA Representations [8.162672407534899]
  We develop an obstruction theory for the linearization of QCA representations.<n>We also fully compute the homotopy types of the QCA spaces over a point, a line, and a plane.
  arXiv  Detail & Related papers  (2026-06-17T23:42:14Z)
• Layerwise LQR for Geometry-Aware Optimization of Deep Networks [38.84575015854741]
  We introduce Layerwise LQR, a framework for learning structured inverse preconditioners under a global layerwise optimal-control objective.<n>We derive a scalable relaxation that learns diagonal, (E-)Kronecker-factored, or other structured inverse preconditioners.<n> Experiments on ResNets and Transformers show that LLQR improves optimization dynamics and often translates these gains into improved final test performance.
  arXiv  Detail & Related papers  (2026-05-05T19:16:00Z)
• On Infinite Tensor Networks, Complementary Recovery and Type II Factors [39.58317527488534]
  We study local operator algebras at the boundary of infinite tensor networks.<n>We decompose the limiting Hilbert space and the algebras of observables in a way that keeps track of the entanglement in the network.
  arXiv  Detail & Related papers  (2025-03-31T18:00:09Z)
• A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees [34.85903827323451]
  We propose a new class of regularizers constructed from the current and previous gradients to solve regularized Newton equation.<n>The proposed algorithm is adaptive, requiring no prior knowledge of the Hessian Lipschitz constant.
  arXiv  Detail & Related papers  (2025-02-07T10:10:10Z)
• Quantum Cellular Automata on Symmetric Subalgebras [6.158725838873227]
  We investigate quantum cellular automata on one-dimensional spin systems defined over a subalgebra of the full local operator algebra.<n>For systems where each site carries a regular representation of $G$, we establish a complete classification of such subalgebra QCAs.
  arXiv  Detail & Related papers  (2024-11-28T17:22:50Z)
• A unified approach to quantum de Finetti theorems and SoS rounding via geometric quantization [0.0]
  We study a connection between a Hermitian version of the SoS hierarchy, related to the quantum de Finetti theorem. We show that previously known HSoS rounding algorithms can be recast as quantizing an objective function.
  arXiv  Detail & Related papers  (2024-11-06T17:09:28Z)
• Quantum information spreading in generalised dual-unitary circuits [44.99833362998488]
  We show that local operators spread at the speed of light as in dual-unitary circuits. We use these properties to find a closed-form expression for the entanglement membrane in these circuits.
  arXiv  Detail & Related papers  (2023-12-05T18:09:27Z)
• Solving Superconducting Quantum Circuits in Dirac's Constraint Analysis Framework [1.038595888464679]
  We study different types of Superconducting Quantum Circuits (SQC) in a itunified way. The Lagrangian of a SQC reveals the constraints, that are classified in a Hamiltonian framework. We have also analysed and predicted new results for a generic form of SQC.
  arXiv  Detail & Related papers  (2023-08-21T10:22:36Z)
• Local topological order and boundary algebras [0.0]
  We introduce axioms for locally topologically ordered quantum spin systems in terms of nets of local ground state projections.<n>For a locally topologically ordered spin system on $mathbbZk$, we define a local net of boundary algebras on $mathbbZk-1$.<n>We construct a canonical quantum channel so that states on the boundary quasi-local algebra parameterize bulk-boundary states without reference to a boundary Hamiltonian.
  arXiv  Detail & Related papers  (2023-07-24T06:38:48Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• The Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) Equation for Two-Dimensional Systems [62.997667081978825]
  Open quantum systems can obey the Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) equation. We exhaustively study the case of a Hilbert space dimension of $2$.
  arXiv  Detail & Related papers  (2022-04-16T07:03:54Z)
• Three-dimensional quantum cellular automata from chiral semion surface topological order and beyond [2.554567149842799]
  We construct a novel three-dimensional quantum cellular automaton (QCA) based on a system with short-range entangled bulk and chiral semion boundary topological order. We show that the resulting Hamiltonian hosts chiral semion surface topological order in the presence of a boundary and can be realized as a non-Pauli stabilizer code on qubits.
  arXiv  Detail & Related papers  (2022-02-11T04:41:37Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.