Density classification with non-unitary quantum cellular automata

Elisabeth Wagner, Federico Dell'Anna, Ramil Nigmatullin, Gavin K. Brennen

Research output: Contribution to journalArticlepeer-review

8 Downloads (Pure)

Abstract

The density classification (DC) task, a computation which maps global density information to local density, is studied using one-dimensional non-unitary quantum cellular automata (QCAs). Two approaches are considered: one that preserves the number density and one that performs majority voting. For number-preserving DC, two QCAs are introduced that reach the fixed-point solution in a time scaling quadratically with the system size. One of the QCAs is based on a known classical probabilistic cellular automaton which has been studied in the context of DC. The second is a new quantum model that is designed to demonstrate additional quantum features and is restricted to only two-body interactions. Both can be generated by continuous-time Lindblad dynamics. A third QCA is a hybrid rule defined by both discrete-time and continuous-time three-body interactions that is shown to solve the majority voting problem within a time that scales linearly with the system size.
Original languageEnglish
Article number26
Pages (from-to)1-35
Number of pages35
JournalEntropy
Volume27
Issue number1
DOIs
Publication statusPublished - Jan 2025

Bibliographical note

© 2024 by the authors. Licensee MDPI, Basel, Switzerland. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

Keywords

  • quantum cellular automata
  • density classification
  • majority problem
  • quantum computing
  • quantum simulation
  • open quantum systems

Cite this