Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Chemistry
Implementation of Finite state logic machines via the dynamics of atomic systems
arXiv
Authors: Dawit Hiluf Hailu
Year
2026
Paper ID
63749
Status
Preprint
Abstract Read
~2 min
Abstract Words
192
Citations
N/A
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.
Why This Paper Matters
- This paper contributes to the Quantum Chemistry research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- Following the success of Moore's predictions, we are approaching a limit in the miniaturization of semiconductors for computing materials.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.