SearcharxivSearch

arXiv · 1907.02075

Clifford Quantum Cellular Automata: Trivial group in 2D and Witt group in 3D

Abstract

We study locality preserving automorphisms of operator algebras on $D$-dimensional uniform lattices of prime $p$-dimensional qudits (QCA), specializing in those that are translation invariant (TI) and map every prime $p$-dimensional Pauli matrix to a tensor product of Pauli matrices (Clifford). We associate antihermitian forms of unit determinant over Laurent polynomial rings to TI Clifford QCA with lattice boundaries, and prove that the form determines the QCA up to Clifford circuits and shifts (trivial). It follows that every 2D TI Clifford QCA is trivial since the antihermitian form in this case is always trivial. Further, we prove that for any $D$ the fourth power of any TI Clifford QCA is trivial. We present explicit examples of nontrivial TI Clifford QCA for $D=3$ and any odd prime $p$, and show that the Witt group of the finite field $\mathbb F_p$ is a subgroup of the group $\mathfrak C(D = 3, p)$ of all TI Clifford QCA modulo trivial ones. That is, $\mathfrak C(D = 3, p \equiv 1 \mod 4) \supseteq \mathbb Z_2 \times \mathbb Z_2$ and $\mathfrak C(D = 3, p \equiv 3 \mod 4) \supseteq \mathbb Z_4$. The examples are found by disentangling the ground state of a commuting Pauli Hamiltonian which is constructed by coupling layers of prime dimensional toric codes such that an exposed surface has an anomalous topological order that is not realizable by commuting Pauli Hamiltonians strictly in two dimensions. In an appendix independent of the main body of the paper, we revisit a recent theorem of Freedman and Hastings that any two-dimensional QCA, which is not necessarily Clifford or translation invariant, is a constant depth quantum circuit followed by a shift. We give a more direct proof of the theorem without using any ancillas.

Explore related subjects

Keep this discovery

BibTeXRIS

Jeongwan Haah. 2019-07-03. Clifford Quantum Cellular Automata: Trivial group in 2D and Witt group in 3D. https://doi.org/10.1063/5.0022185

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph