Universal Boolean Computation in Negatively Coupled Circle Map Lattices
Abstract
We investigate the computational capabilities of a one-dimensional lattice of negatively coupled circle maps in its traveling wave regime. We interpret propagating waves as information carriers and exploit their interactions to implement Boolean logic. The logical states are encoded by the propagation direction of the traveling waves, while the presence or absence of a wave at a designated output location represents the logical output. Using controlled wave collisions, we demonstrate the realization of NAND and NOR gates along with other basic gates. Since NAND and NOR operations are functionally complete, the results establish that the traveling wave regime of the negatively coupled circle-map lattice supports universal Boolean computation in principle. The demonstrated logical operations remain valid over a finite range of the coupling strength εand map parameter ω, indicating robustness of the computational scheme to parameter variations. Our results therefore demonstrate that computational functionality can emerge from the collective nonlinear dynamics of a coupled map lattice, providing a con- nection between the dynamical properties of traveling wave states and collision based information processing.
Related
- Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions
- A universal emulator for planar Ising lattices
- An example of universal braiding in Links--Gould topological quantum computation
- Distilling universal machine-learning potentials for moiré lattices across one million atoms
- Examining Convergence of Cluster Perturbation Theory and Cluster Coupled Cluster for J1-J2 Heisenberg Spin Lattices
BibTeX
@misc{bhoyar2026universal,
title = {{Universal Boolean Computation in Negatively Coupled Circle Map Lattices}},
author = {Priyanka D. Bhoyar and Prashant M. Gade},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.16290},
eprint = {2610.16290},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.16290},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Universal Boolean Computation in Negatively Coupled Circle Map Lattices
AU - Priyanka D. Bhoyar
AU - Prashant M. Gade
PY - 2026
DA - 2026/10/23
PB - arXiv
DO - 10.48550/arxiv.2610.16290
UR - https://arxiv.org/abs/2610.16290
AB - We investigate the computational capabilities of a one-dimensional lattice of negatively coupled circle maps in its traveling wave regime. We interpret propagating waves as information carriers and exploit their interactions to implement Boolean logic. The logical states are encoded by the propagation direction of the traveling waves, while the presence or absence of a wave at a designated output location represents the logical output. Using controlled wave collisions, we demonstrate the realization of NAND and NOR gates along with other basic gates. Since NAND and NOR operations are functionally complete, the results establish that the traveling wave regime of the negatively coupled circle-map lattice supports universal Boolean computation in principle. The demonstrated logical operations remain valid over a finite range of the coupling strength εand map parameter ω, indicating robustness of the computational scheme to parameter variations. Our results therefore demonstrate that computational functionality can emerge from the collective nonlinear dynamics of a coupled map lattice, providing a con- nection between the dynamical properties of traveling wave states and collision based information processing.
ER -