Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.19273 · Results in Optics

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

Dawit Hiluf Hailu

quant-phSubmitted May 19, 2026• Announced May 20, 2026• 4 citations
arXivHTMLPDF

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.

DOI
10.1016/j.rio.2025.100789

Related papers

A Mathematical Architecture for Molecular Computing

Robert J. Bonneau, George Ramseyer, Tom Renz +1 more

Traditional computing uses transistors and binary logic in order to perform computing operations. This approach has proved successful as long as the number of transistors per integrated circuit can be scaled to accommodate increasing speed and heat requirements. Unfortunately, this approach does not allow speeds above the limit where the size of the transistors approaches the limit of the integrated circuit substrates' molecular size. In this condition, electrons cannot reliably be contained within the boundaries separating one transistor from the next and increasingly small circuits become impractical. The current solution to this dilemma is to increase the number of functional units on an integrated circuit and thereby eliminate the need for increasingly small transistors. However whether we increase the number of functional units or the speed, there are inherent limitations in the number of transistors we can put onto one chip. We therefore look to another functional approach to generate the next generation of integrated circuits. We therefore look to using the molecules and elementary particles themselves as a means of computation. In order to accomplish molecular computation we need to modify the model of traditional computation from a transistor based binary method to analog based arbitrary basis model. This approach is not unknown since optical computation among other has used analog processing for highly parallel computation. The issue with molecular and quantum computing methods has traditionally been that understanding the state the computing function itself is often subject to high degree uncertainty. This uncertainty is not unexpected since the number of possible states that can exist when electromagnetic energy interrogates a collection of molecules, atoms, or electrons is quite large. In order to develop a method of representing these states we use a partially observable Markov decision process. We will then develop a finite state machine approach to computation based on a model for our molecular or quantum system.

Proceedings•Oct 1, 2007•1 citation

A quantum information processing machine for computing by observables

F. Remacle, Raphael David Levine

A quantum machine that accepts an input and processes it in parallel is described. The logic variables of the machine are not wavefunctions (qubits) but observables (i.e., operators) and its operation is described in the Heisenberg picture. The active core is a solid-state assembly of small nanosized colloidal quantum dots (QDs) or dimers of dots. The size dispersion of the QDs that causes fluctuations in their discrete electronic energies is a limiting factor. The input to the machine is provided by a train of very brief laser pulses, at least four in number. The coherent band width of each ultrashort pulse needs to span at least several and preferably all the single electron excited states of the dots. The spectrum of the QD assembly is measured as a function of the time delays between the input laser pulses. The dependence of the spectrum on the time delays can be Fourier transformed to a frequency spectrum. This spectrum of a finite range in time is made up of discrete pixels. These are the visible, raw, basic logic variables. The spectrum is analyzed to determine a possibly smaller number of principal components. A Lie-algebraic point of view is used to explore the use of the machine to emulate the dynamics of other quantum systems. An explicit example demonstrates the considerable quantum advantage of our scheme.

Proceedings of the National Academy of Sciences•Mar 10, 2023•7 citations

Quantum finite state machines - A circuit based approach

Martin Lukáč, Michitaka Kameyama, Marek A. Perkowski

We present a model of Quantum Finite State Machines (QFSM) based on the quantum circuit representation. In this model, properties of quantum bits are exploited in order to implement Quantum Finite State Machines without an explicit external memory. We show that because of the the natural ability of quantum systems to retain the quantum state, quantum circuits can be directly used to implement some classes of the quantum finite state machines. In particular, the circuit model allows to remove the logic-memory distinction as it is used in the classically established model of finite state machines. Rather, the quantum register implementing the QFSM as a circuit is alternatively used as memory and as logic. In order to allow such behavior the quantum circuit (processor) is controlled by a classical circuit that provides the necessary timing of the quantum operations as well as the interface between the quantum and the classical world. Moreover, additional mechanism for preserving unknown quantum qubit state is used and a novel computational protocol allowing the implementation of the QFSM is proposed. This framework is is called the Classically Controlled Quantum Computer (CCQC). The CCQC thus combines a quantum processor with a classical controller in such manner that computation is carried from the classical inputs, through quantum processing to classical outputs. We discuss a high level synthesis approach to quantum sequence detection based on the synthesis of quantum sequential circuits. Such machines can find many applications for instance in robotics; for example a robot is required to recognize certain sequences of input sensor values.

International journal of unconventional computing•May 1, 2013•4 citations

Classical computation with quantum systems

P Delaney, James C. Greer

As semiconductor electronic devices scale to the nanometer range and quantum structures (molecules, fullerenes, quantum dots, nanotubes) are investigated for use in information processing and storage, it becomes useful to explore the limits imposed by quantum mechanics on classical computing. To formulate the problem of a quantum mechanical description of classical computing, electronic device and logic gates are described as quantum sub-systems with inputs treated as boundary conditions, outputs expressed as operator expectation values, and transfer characteristics and logic operations expressed through the sub-system Hamiltonian, with constraints appropriate to the boundary conditions. This approach, naturally, leads to a description of the sub-systems in terms of density matrices. Application of the maximum entropy principle subject to the boundary conditions (inputs) allows for the determination of the density matrix (logic operation), and for calculation of expectation values of operators over a finite region (outputs). The method allows for an analysis of the static properties of quantum sub-systems.

Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Nov 4, 2005•8 citations

STUDY AND REALIZATION OF SIMPLE QUANTUM GATES

Lavanya Ravala, S. Vishnu Priya, G .V. Sujitha +2 more

Quantum computing represents a paradigm shift in computation by leveraging the principles of quantum mechanics such as superposition, entanglement, and interference to perform operations beyond classical limitations. Unlike classical computing systems that rely on irreversible logic operations and suffer from energy dissipation due to information loss, quantum systems utilize reversible unitary transformations that preserve information and improve computational efficiency. This paper presents a comprehensive framework for the design, simulation, and validation of quantum gates and reversible arithmetic circuits, including half adders and half subtractors. The proposed approach systematically maps classical arithmetic logic into quantum circuits using fundamental quantum gates such as Pauli-X, Hadamard, Controlled-NOT (CNOT), and Toffoli gates. The circuits are implemented and simulated using the Qiskit Aer framework, enabling detailed analysis of quantum state evolution and measurement outputs. The results obtained from simulation include program-level outputs, state vector representations, measurement counts, and probability distributions, all of which demonstrate strong agreement with classical truth tables. The analysis confirms the correctness, reversibility, and scalability of the proposed designs. Furthermore, a comparative performance evaluation highlights the advantages of quantum computing over classical approaches in terms of parallelism and energy efficiency. The proposed framework establishes a robust foundation for future implementation of complex Boolean logic and arithmetic operations in quantum systems.

International Journal of Novel Research and Development•Apr 1, 2026•0 citations

Parallel and Multivalued Logic by the Two-Dimensional Photon-Echo Response of a Rhodamine–DNA Complex

Barbara Fresch, Marco Cipolloni, Tian-Min Yan +3 more

Implementing parallel and multivalued logic operations at the molecular scale has the potential to improve the miniaturization and efficiency of a new generation of nanoscale computing devices. Two-dimensional photon-echo spectroscopy is capable of resolving dynamical pathways on electronic and vibrational molecular states. We experimentally demonstrate the implementation of molecular decision trees, logic operations where all possible values of inputs are processed in parallel and the outputs are read simultaneously, by probing the laser-induced dynamics of populations and coherences in a rhodamine dye mounted on a short DNA duplex. The inputs are provided by the bilinear interactions between the molecule and the laser pulses, and the output values are read from the two-dimensional molecular response at specific frequencies. Our results highlights how ultrafast dynamics between multiple molecular states induced by light−matter interactions can be used as an advantage for performing complex logic operations in parallel, operations that are faster than electrical switching.

The Journal of Physical Chemistry Letters•Apr 20, 2015•27 citations
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.
Traditional computing uses transistors and binary logic in order to perform computing operations. This approach has proved successful as long as the number of transistors per integrated circuit can be scaled to accommodate increasing speed and heat requirements. Unfortunately, this approach does not allow speeds above the limit where the size of the transistors approaches the limit of the integrated circuit substrates' molecular size. In this condition, electrons cannot reliably be contained within the boundaries separating one transistor from the next and increasingly small circuits become impractical. The current solution to this dilemma is to increase the number of functional units on an integrated circuit and thereby eliminate the need for increasingly small transistors. However whether we increase the number of functional units or the speed, there are inherent limitations in the number of transistors we can put onto one chip. We therefore look to another functional approach to generate the next generation of integrated circuits. We therefore look to using the molecules and elementary particles themselves as a means of computation. In order to accomplish molecular computation we need to modify the model of traditional computation from a transistor based binary method to analog based arbitrary basis model. This approach is not unknown since optical computation among other has used analog processing for highly parallel computation. The issue with molecular and quantum computing methods has traditionally been that understanding the state the computing function itself is often subject to high degree uncertainty. This uncertainty is not unexpected since the number of possible states that can exist when electromagnetic energy interrogates a collection of molecules, atoms, or electrons is quite large. In order to develop a method of representing these states we use a partially observable Markov decision process. We will then develop a finite state machine approach to computation based on a model for our molecular or quantum system.
A quantum machine that accepts an input and processes it in parallel is described. The logic variables of the machine are not wavefunctions (qubits) but observables (i.e., operators) and its operation is described in the Heisenberg picture. The active core is a solid-state assembly of small nanosized colloidal quantum dots (QDs) or dimers of dots. The size dispersion of the QDs that causes fluctuations in their discrete electronic energies is a limiting factor. The input to the machine is provided by a train of very brief laser pulses, at least four in number. The coherent band width of each ultrashort pulse needs to span at least several and preferably all the single electron excited states of the dots. The spectrum of the QD assembly is measured as a function of the time delays between the input laser pulses. The dependence of the spectrum on the time delays can be Fourier transformed to a frequency spectrum. This spectrum of a finite range in time is made up of discrete pixels. These are the visible, raw, basic logic variables. The spectrum is analyzed to determine a possibly smaller number of principal components. A Lie-algebraic point of view is used to explore the use of the machine to emulate the dynamics of other quantum systems. An explicit example demonstrates the considerable quantum advantage of our scheme.
We present a model of Quantum Finite State Machines (QFSM) based on the quantum circuit representation. In this model, properties of quantum bits are exploited in order to implement Quantum Finite State Machines without an explicit external memory. We show that because of the the natural ability of quantum systems to retain the quantum state, quantum circuits can be directly used to implement some classes of the quantum finite state machines. In particular, the circuit model allows to remove the logic-memory distinction as it is used in the classically established model of finite state machines. Rather, the quantum register implementing the QFSM as a circuit is alternatively used as memory and as logic. In order to allow such behavior the quantum circuit (processor) is controlled by a classical circuit that provides the necessary timing of the quantum operations as well as the interface between the quantum and the classical world. Moreover, additional mechanism for preserving unknown quantum qubit state is used and a novel computational protocol allowing the implementation of the QFSM is proposed. This framework is is called the Classically Controlled Quantum Computer (CCQC). The CCQC thus combines a quantum processor with a classical controller in such manner that computation is carried from the classical inputs, through quantum processing to classical outputs. We discuss a high level synthesis approach to quantum sequence detection based on the synthesis of quantum sequential circuits. Such machines can find many applications for instance in robotics; for example a robot is required to recognize certain sequences of input sensor values.
As semiconductor electronic devices scale to the nanometer range and quantum structures (molecules, fullerenes, quantum dots, nanotubes) are investigated for use in information processing and storage, it becomes useful to explore the limits imposed by quantum mechanics on classical computing. To formulate the problem of a quantum mechanical description of classical computing, electronic device and logic gates are described as quantum sub-systems with inputs treated as boundary conditions, outputs expressed as operator expectation values, and transfer characteristics and logic operations expressed through the sub-system Hamiltonian, with constraints appropriate to the boundary conditions. This approach, naturally, leads to a description of the sub-systems in terms of density matrices. Application of the maximum entropy principle subject to the boundary conditions (inputs) allows for the determination of the density matrix (logic operation), and for calculation of expectation values of operators over a finite region (outputs). The method allows for an analysis of the static properties of quantum sub-systems.
Quantum computing represents a paradigm shift in computation by leveraging the principles of quantum mechanics such as superposition, entanglement, and interference to perform operations beyond classical limitations. Unlike classical computing systems that rely on irreversible logic operations and suffer from energy dissipation due to information loss, quantum systems utilize reversible unitary transformations that preserve information and improve computational efficiency. This paper presents a comprehensive framework for the design, simulation, and validation of quantum gates and reversible arithmetic circuits, including half adders and half subtractors. The proposed approach systematically maps classical arithmetic logic into quantum circuits using fundamental quantum gates such as Pauli-X, Hadamard, Controlled-NOT (CNOT), and Toffoli gates. The circuits are implemented and simulated using the Qiskit Aer framework, enabling detailed analysis of quantum state evolution and measurement outputs. The results obtained from simulation include program-level outputs, state vector representations, measurement counts, and probability distributions, all of which demonstrate strong agreement with classical truth tables. The analysis confirms the correctness, reversibility, and scalability of the proposed designs. Furthermore, a comparative performance evaluation highlights the advantages of quantum computing over classical approaches in terms of parallelism and energy efficiency. The proposed framework establishes a robust foundation for future implementation of complex Boolean logic and arithmetic operations in quantum systems.
Implementing parallel and multivalued logic operations at the molecular scale has the potential to improve the miniaturization and efficiency of a new generation of nanoscale computing devices. Two-dimensional photon-echo spectroscopy is capable of resolving dynamical pathways on electronic and vibrational molecular states. We experimentally demonstrate the implementation of molecular decision trees, logic operations where all possible values of inputs are processed in parallel and the outputs are read simultaneously, by probing the laser-induced dynamics of populations and coherences in a rhodamine dye mounted on a short DNA duplex. The inputs are provided by the bilinear interactions between the molecule and the laser pulses, and the output values are read from the two-dimensional molecular response at specific frequencies. Our results highlights how ultrafast dynamics between multiple molecular states induced by light−matter interactions can be used as an advantage for performing complex logic operations in parallel, operations that are faster than electrical switching.