Implementation of Finite state logic machines via the dynamics of atomic systems

TL;DR

This paper introduces a novel computing paradigm using the dynamics of two-level atomic systems to implement finite-state logic machines, enabling complex, parallel, and scalable classical logic operations.

Contribution

It proposes a new quantum-inspired approach to classical logic computation leveraging atomic state dynamics and Liouville space analysis.

Findings

Logic operations can be performed before environmental noise causes information loss.

Parallel reading of logic operations enables complex computations.

The system can be scaled to N-level atomic configurations.

Abstract

Following the success of Moore's predictions, we are approaching a limit in the miniaturization of semiconductors for computing materials. This has led to the exploration of various research paths to develop alternative computing paradigms, such as quantum computing, 3D transistors, molecular logic, and continuous logic. In this context, we propose a novel approach in which the dynamics of a two-level atom is used to execute classical Boolean logic operations. Unlike traditional combinational logic circuits, where the output depends solely on the input, we suggest a finite-state machine-like computing model, where the output is influenced by both the input and the system's initial state. The proposed mechanism leverages the dynamics of a two-level quantum state, with information encoded in observable quantities. These observables, the density matrix's population (diagonal) and coherence (off-diagonal) elements, were analyzed using the Liouville equation. The selection of observables within the Liouville space allows us to encode more variables. Although environmental noise may cause some loss of encoded information, fast computations can still be performed before it dissipates. In addition, logic operations can be read in parallel, enabling complex computations. This system can also be scaled to an N-level configuration.