Entanglement Generation of Clifford Quantum Cellular Automata

TL;DR

This paper explores how Clifford quantum cellular automata generate entanglement, their properties, and potential applications, highlighting their role as fundamental components in quantum computation despite classical simulability.

Contribution

It provides a comprehensive introduction to CQCAs, analyzes their entanglement generation, and discusses finite configurations and practical applications.

Findings

CQCAs can generate entanglement efficiently.

They are connected to stabilizer states and quantum computation.

Finite configurations have specific entanglement properties.

Abstract

Clifford quantum cellular automata (CQCAs) are a special kind of quantum cellular automata (QCAs) that incorporate Clifford group operations for the time evolution. Despite being classically simulable, they can be used as basic building blocks for universal quantum computation. This is due to the connection to translation-invariant stabilizer states and their entanglement properties. We will give a self-contained introduction to CQCAs and investigate the generation of entanglement under CQCA action. Furthermore, we will discuss finite configurations and applications of CQCAs.