pith. sign in

arxiv: 2605.19273 · v1 · pith:6JGDALXDnew · submitted 2026-05-19 · 🪐 quant-ph

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

Dawit Hiluf Hailu This is my paper

Pith reviewed 2026-05-20 06:29 UTC · model grok-4.3

classification 🪐 quant-ph
keywords two-level atomfinite-state machineBoolean logicdensity matrixLiouville equationcoherenceatomic computingopen quantum systems
0
0 comments X

The pith

The time evolution of a two-level atom can carry out classical Boolean logic in a finite-state machine where each output depends on both the input and the prior state.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows how the natural dynamics of a two-level atom can be used to perform ordinary logic operations that remember their history. Data are placed in the population and coherence parts of the atom's density matrix, and these parts change according to the equation that describes open quantum systems. Because the next result depends on the current state as well as the new input, the scheme behaves like a finite-state machine rather than a memoryless gate. Multiple pieces of information can be handled at once by choosing different matrix elements, and the calculations are meant to finish before environmental noise wipes the data out. The same idea is claimed to work for atoms with more than two levels.

Core claim

The dynamics of a two-level quantum system, governed by the Liouville equation for the density matrix, can be arranged so that chosen population and coherence observables directly realize Boolean logic operations whose results also depend on the system's initial state, thereby implementing a finite-state machine model of computation.

What carries the argument

The Liouville equation acting on the vectorized density matrix, with logic values stored in its diagonal population elements and off-diagonal coherence elements.

If this is right

  • Multiple logic variables can be processed in parallel because several density-matrix elements are accessible at once.
  • The scheme extends directly to N-level atoms, allowing larger state spaces for more complex finite-state behavior.
  • Computations remain feasible provided they complete faster than the rate at which noise erases the encoded information.
  • The approach supplies an alternative computing route once semiconductor miniaturization reaches its physical limit.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same encoding could be tested in current trapped-atom or ion experiments by applying sequences of control pulses and checking whether the final observables reproduce standard logic tables.
  • Because the memory is carried by the atom's internal state, the model might combine with optical readout techniques to chain many logic steps inside a single physical system.
  • If the noise window proves too short, one could ask whether adding weak continuous driving could extend the usable coherence time without destroying the classical logic mapping.

Load-bearing premise

Environmental noise still leaves a usable time window in which the logic steps can finish before the stored population and coherence information is lost, and the chosen observables can be driven and read with enough accuracy to produce reliable Boolean results without error correction.

What would settle it

An experiment that drives a two-level atom with the proposed input pulses and finds that the measured population and coherence values after each step do not match the Boolean output expected from the given input and initial state.

Figures

Figures reproduced from arXiv: 2605.19273 by Dawit Hiluf Hailu.

Figure 1
Figure 1. Figure 1: (Color online) (a) Energy level diagram of Pr3+:Y2SiO5 (b) The corresponding two￾level system with detuning h¯∆ and coupling pulse h¯Ω(t). exceptionally long decoherence times, often ranging from milliseconds to seconds under optimal conditions. In high-quality crystals, these coherence times can exceed 1 millisecond, making them particularly suitable for the storage and processing of quantum information [… view at source ↗
Figure 2
Figure 2. Figure 2: (Color online) Numerical solutions for the case when ∆ = 0. (i) When the population is initially prepared to be in the ground state |0⟩. (ii) When the population is initially prepared to be in the excited state |1⟩. Parameters in reduced units, Ω0 = 1.0, τ = 5.0, and σ = 1.0. Key: Solid line (blue) represents ρ00, dashed line (red) represents ρ11, dashed-dot line (green) denotes the real part of ρ01, and d… view at source ↗
Figure 3
Figure 3. Figure 3: State diagram of two state parity checker Note that if the state of the machine is even (corresponding to logic value 0), then input string 0 dictates to stay in the same state outputting 0 (i.e. even); similarly input string 1 means changing state to odd (corresponding to logic value 1) outputting 1 (i.e. odd). In contrast, if the state of the machine is odd (corresponding to the logic value 1), then the … view at source ↗
Figure 4
Figure 4. Figure 4: (Color online) Finite State machine where the outputs not only depend on the input but also rely on the state it is in. In a finite-state machine (FSM), the key components are typically denoted as follows. The input, represented as x(t), denotes the external signals or stimuli that influence the behavior and state transitions of the FSM. The output, denoted as z(t), represents the result or action produced… view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes using the time evolution of a two-level atom under the Liouville equation to realize classical Boolean logic gates in a finite-state-machine architecture. Information is encoded in the diagonal (population) and off-diagonal (coherence) elements of the density matrix; the output is asserted to depend on both the driving fields (inputs) and the initial state, with claims of parallel readout, noise tolerance for short-time computations, and straightforward extension to N-level systems.

Significance. If the central mapping from Liouville dynamics to deterministic Boolean truth tables were explicitly derived and verified, the work would offer a concrete link between open quantum-system evolution and classical logic, potentially useful for molecular-scale or hybrid quantum-classical devices. At present the absence of any Hamiltonian, differential equations, or numerical verification prevents evaluation of whether the scheme actually reproduces logic operations or merely restates the general fact that density-matrix elements can be manipulated.

major comments (2)
  1. [Abstract] Abstract and main text: the central claim that population and coherence observables realize Boolean operations is unsupported by any explicit Hamiltonian, Liouville superoperator, or analytic/numeric solution showing that the final values of these observables match a classical truth table for even a single gate (AND, OR, NOT, etc.). Without this mapping the FSM-like behavior remains an assertion rather than a demonstrated result.
  2. No section or equation: the manuscript states that 'fast computations can still be performed before [noise] dissipates' and that 'logic operations can be read in parallel,' yet supplies neither a decoherence model, a time-scale comparison, nor an error budget demonstrating that the required precision for deterministic Boolean outputs is achievable.
minor comments (2)
  1. [Abstract] The abstract refers to 'the selection of observables within the Liouville space' without defining the basis or the precise encoding of logical 0/1 values; a short table or paragraph clarifying the mapping would improve readability.
  2. The scaling claim to an 'N-level configuration' is stated without any indication of how the Liouville-space dimension or the number of controllable parameters grows with N.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful and constructive review of our manuscript. We address the major comments point by point below, indicating where revisions will be made to strengthen the presentation of the conceptual proposal.

read point-by-point responses

  1. Referee: [Abstract] Abstract and main text: the central claim that population and coherence observables realize Boolean operations is unsupported by any explicit Hamiltonian, Liouville superoperator, or analytic/numeric solution showing that the final values of these observables match a classical truth table for even a single gate (AND, OR, NOT, etc.). Without this mapping the FSM-like behavior remains an assertion rather than a demonstrated result.

    Authors: We agree that an explicit mapping is required to substantiate the central claim. In the revised manuscript we will add a dedicated section that specifies a Hamiltonian for a driven two-level system realizing a basic gate (for example the NOT operation), writes the corresponding Liouville superoperator, and solves the resulting differential equations to show that the population and coherence observables reproduce the classical truth table. This will also illustrate the dependence on both the driving fields (inputs) and the initial state, thereby demonstrating the finite-state-machine character. revision: yes

  2. Referee: [—] No section or equation: the manuscript states that 'fast computations can still be performed before [noise] dissipates' and that 'logic operations can be read in parallel,' yet supplies neither a decoherence model, a time-scale comparison, nor an error budget demonstrating that the required precision for deterministic Boolean outputs is achievable.

    Authors: The manuscript is framed as a conceptual proposal. We will revise the text to include a qualitative discussion based on the Lindblad master equation for a two-level atom, together with order-of-magnitude estimates comparing typical gate evolution times to standard atomic decoherence timescales. A full quantitative error budget for deterministic Boolean fidelity would require a concrete experimental platform and lies beyond the present scope; the added discussion will therefore remain at the level of supporting the feasibility of short-time operation before significant dissipation occurs. revision: partial

Circularity Check

0 steps flagged

No circularity: conceptual proposal with no load-bearing derivations or reductions

full rationale

The paper advances a forward-looking suggestion that two-level atom dynamics under the Liouville equation can realize classical Boolean operations and finite-state-machine behavior by encoding information in population and coherence observables. No explicit Hamiltonian, differential equations, analytic solutions, or numerical verifications are supplied that would map inputs to outputs in a way that reduces a claimed prediction to a fitted parameter or self-definition. The text invokes general properties of the Liouville space without deriving new results from self-citations, uniqueness theorems, or prior ansatzes by the same authors. Because the central claim remains a high-level encoding proposal rather than a closed derivation chain, it is self-contained against external benchmarks and exhibits no circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The proposal rests on standard quantum mechanics (Liouville equation for open systems) without introducing new free parameters, axioms, or invented entities in the provided abstract; any concrete implementation would require additional modeling choices for control fields and readout.

axioms (1)
  • standard math The Liouville equation accurately describes the evolution of the density matrix for the two-level system under the relevant conditions.
    Invoked when the authors state that population and coherence elements were analyzed using the Liouville equation.

pith-pipeline@v0.9.0 · 5736 in / 1400 out tokens · 40313 ms · 2026-05-20T06:29:00.691135+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

75 extracted references · 75 canonical work pages · 1 internal anchor

  1. [1]

    G. E. Moore, Cramming more components onto integrated circuits. electronics, 38 (8), april 1965, in: Electron Devices Meeting (IEDM), 2010, pp. 19–7

    work page 1965

  2. [2]

    M. A. Nielsen, I. L. Chuang, Quantum computation and quantum information, 10th Edition, Cambridge University Press, 2010

    work page 2010

  3. [3]

    Allen, J

    L. Allen, J. H. Eberly, Optical resonance and two-level atoms, Wiley, 1975

    work page 1975

  4. [4]

    D. H. Hailu,su(2)dynamics and logic machines – part ii (2019). arXiv:1909.02094

    work page arXiv 2019

  5. [5]

    J. Wei, E. Norman, Lie algebraic solution of linear differential equations, Journal of Mathematical Physics 4 (4) (1963) 575–581

    work page 1963

  6. [6]

    Fano, Description of states in quantum mechanics by density matrix and operator techniques, Reviews of Modern Physics 29 (1) (1957) 74–93

    U. Fano, Description of states in quantum mechanics by density matrix and operator techniques, Reviews of Modern Physics 29 (1) (1957) 74–93

    work page 1957

  7. [7]

    Dattoli, M

    G. Dattoli, M. Richetta, A. Torre, Evolution of su (2) and su (1, 1) states: A further mathematical analysis, Journal of mathematical physics 29 (12) (1988) 2586–2588

    work page 1988

  8. [8]

    A. Claudio, Use of wei-norman formulae and parametric differentiation in quantum computing, in: 15th International Symposium on Mathematical Theory of Networks and Systems, Notre Dame, IN, USA, University of Notre Dame, 2002, pp. 12–16

    work page 2002

  9. [9]

    F. Beil, T. Halfmann, F. Remacle, R. Levine, Logic operations in a doped solid driven by stimulated raman adiabatic passage, Physical Review A 83 (3) (2011) 033421

    work page 2011

  10. [10]

    Collini, Spectroscopic signatures of quantum-coherent energy transfer, Chem Soc Rev 42 (12) (2013) 4932–47

    E. Collini, Spectroscopic signatures of quantum-coherent energy transfer, Chem Soc Rev 42 (12) (2013) 4932–47. doi:10.1039/c3cs35444j

    work page doi:10.1039/c3cs35444j 2013

  11. [11]

    Klein, F

    J. Klein, F. Beil, T. Halfmann, Robust population transfer by stimulated raman adiabatic passage in a pr3+:y2sio5 crystal, Phys Rev Lett 99 (11) (2007) 113003

    work page 2007

  12. [12]

    Klein, G

    M. Klein, G. P. Lansbergen, J. A. Mol, S. Rogge, R. D. Levine, F. Remacle, Reconfigurable logic devices 36 on a single dopant atom - operation up to a full adder by using electrical spectroscopy, Chemphyschem 10 (1) (2009) 162–73. doi:10.1002/cphc.200800568

    work page doi:10.1002/cphc.200800568 2009

  13. [13]

    K. L. Kompa, R. D. Levine, A molecular logic gate, Proc. Natl. Acad. Sci. U. S. A. 98 (2) (2001) 410–414

    work page 2001

  14. [14]

    Klein, J

    M. Klein, J. Mol, J. Verduijn, G. Lansbergen, S. Rogge, R. Levine, F. Remacle, Ternary logic implemented on a single dopant atom field effect silicon transistor, Applied Physics Letters 96 (4) (2010) 043107

    work page 2010

  15. [15]

    Levine, F

    R. Levine, F. Remacle, Realization of complex logic operations at the nanoscale, in: Architecture and Design of Molecule Logic Gates and Atom Circuits, Springer, 2013, pp. 195–220

    work page 2013

  16. [16]

    J. Mol, J. Van der Heijden, J. Verduijn, M. Klein, F. Remacle, S. Rogge, Balanced ternary addition using a gated silicon nanowire, Applied Physics Letters 99 (26) (2011) 263109

    work page 2011

  17. [17]

    Remacle, Toward molecular logic machines using pump-probe spectroscopy., in: Proceedings Title, V ol

    F. Remacle, Toward molecular logic machines using pump-probe spectroscopy., in: Proceedings Title, V ol. 222, AMER CHEMICAL SOC, 1155 16TH ST, NW, W ASHINGTON, DC 20036 USA, 2001, pp. U193–U193

    work page 2001

  18. [18]

    Remacle, R

    F. Remacle, R. D. Levine, Towards a molecular logic machine, J. Chem. Phys. 114 (23) (2001) 10239– 10246

    work page 2001

  19. [19]

    Remacle, R

    F. Remacle, R. Weinkauf, R. D. Levine, Molecule-based photonically switched half and full adder, J Phys Chem A 110 (1) (2006) 177–84. doi:10.1021/jp0557417

    work page doi:10.1021/jp0557417 2006

  20. [20]

    Remacle, R

    F. Remacle, R. D. Levine, A quantum information processing machine for computing by observables, Proceedings of the National Academy of Sciences 120 (11) (2023) e2220069120

    work page 2023

  21. [21]

    Remacle, R

    F. Remacle, R. Levine, All-optical digital logic: Full addition or subtraction on a three-state system, Physical Review A 73 (3) (2006) 033820

    work page 2006

  22. [22]

    Remacle, R

    F. Remacle, R. Levine, Inter-and intra-molecular level logic devices, Information Technology IV 4 (2008) 213–248

    work page 2008

  23. [23]

    Fresch, J

    B. Fresch, J. Bocquel, D. Hiluf, S. Rogge, R. D. Levine, F. Remacle, Implementation of multivariable logic functions in parallel by electrically addressing a molecule of three dopants in silicon, ChemPhysChem 18 (13) (2017) 1790–1797

    work page 2017

  24. [24]

    Klein, F

    J. Klein, F. Beil, T. Halfmann, Experimental investigations of stimulated raman adiabatic passage in a doped solid, Physical Review A 78 (3) (2008) 033416

    work page 2008

  25. [25]

    F. Beil, J. Klein, G. Nikoghosyan, T. Halfmann, Electromagnetically induced transparency and retrieval of light pulses in aλ-type and a v-type level scheme in pr3+: Y2sio5, Journal of Physics B: Atomic, Molecular and Optical Physics 41 (7) (2008) 074001

    work page 2008

  26. [26]

    Dynamical Decoupling of Open Quantum Systems

    L. Viola, E. Knill, S. Lloyd, Dynamical decoupling of open quantum systems, Physical Review Letters 37 82 (12) (2005) 2417–2421. doi:10.1103/PhysRevLett.82.2417

    work page internal anchor Pith review doi:10.1103/physrevlett.82.2417 2005

  27. [27]

    D. A. Lidar, T. A. Brun, Quantum Error Correction and Decoherence, Cambridge University Press, 2013

    work page 2013

  28. [29]

    A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett. 77 (1996) 793–797. doi:10.1103/PhysRevLett.77.793. URLhttps://link.aps.org/doi/10.1103/PhysRevLett.77.793

    work page doi:10.1103/physrevlett.77.793 1996

  29. [30]

    S. J. Beale, J. J. Wallman, M. Guti ´errez, K. R. Brown, R. Laflamme, Quantum error correction decoheres noise, Phys. Rev. Lett. 121 (2018) 190501. doi:10.1103/PhysRevLett.121.190501. URLhttps://link.aps.org/doi/10.1103/PhysRevLett.121.190501

    work page doi:10.1103/physrevlett.121.190501 2018

  30. [31]

    F. Beil, J. Klein, T. Halfmann, Optically driven atomic coherences in a pr3+:y2sio5 crystal, Photonics Nanostruct. 7 (1) (2009) 32–38. doi:10.1016/j.photonics.2008.11.006

    work page doi:10.1016/j.photonics.2008.11.006 2009

  31. [32]

    N. V . Vitanov, T. Halfmann, B. W. Shore, K. Bergmann, Laser-induced population transfer by adiabatic passage techniques, Annu. Rev. Phys. Chem. 52 (2001) 763–809

    work page 2001

  32. [33]

    D. L. McAuslan, J. G. Bartholomew, M. J. Sellars, J. J. Longdell, Reducing decoherence in optical and spin transitions in rare-earth-metal-ion–doped materials, Phys. Rev. A 85 (2012) 032339. doi:10.1103/PhysRevA.85.032339. URLhttps://link.aps.org/doi/10.1103/PhysRevA.85.032339

    work page doi:10.1103/physreva.85.032339 2012

  33. [34]

    Vitanov, K

    N. Vitanov, K. Suominen, B. Shore, Creation of coherent atomic superpositions by fractional stimulated raman adiabatic passage, Journal of Physics B: Atomic, Molecular and Optical Physics 32 (18) (1999) 4535

    work page 1999

  34. [35]

    B. W. Shore, Manipulating quantum structures using laser pulses, Manipulating Quantum Structures Using Laser Pulses, by Bruce W. Shore, Cambridge, UK: Cambridge University Press, 2011 1 (2011)

    work page 2011

  35. [36]

    N. V . Viatnov, T. Halfmann, B. W. Shore, K. Bergmann, Laser induced population transfer by adiabatic passage techniques, Annual Review of Physical Chemistry 52 (2) (2001) 763–809

    work page 2001

  36. [37]

    Breuer, F

    H. Breuer, F. Petruccione, The Theory of Open Quantum Systems, OUP Oxford, 2007

    work page 2007

  37. [38]

    R. D. Levine, Quantum mechanics of molecular rate processes, Courier Dover Publications, 2011

    work page 2011

  38. [39]

    Cohen-Tannoudji, B

    C. Cohen-Tannoudji, B. Diu, F. Laloe, Quantum Mechanics, V olume 1, Wiley, 1991

    work page 1991

  39. [40]

    Alhassid, R

    Y . Alhassid, R. Levine, Entropy and chemical change. iii. the maximal entropy (subject to constraints) procedure as a dynamical theory, The Journal of Chemical Physics 67 (10) (1977) 4321–4339. 38

    work page 1977

  40. [41]

    F. T. HIOE, J. H. EBERLY , N-level coherence vector and higher conservation-laws in quantum optics and quantum-mechanics, Phys. Rev. Lett. 47 (12) (1981) 838–841

    work page 1981

  41. [42]

    F. Hioe, J. Eberly, Nonlinear constants of motion for three-level quantum systems, Physical Review A 25 (4) (1982) 2168

    work page 1982

  42. [43]

    Hioe, Dynamic symmetries in quantum electronics, Physical Review A 28 (2) (1983) 879

    F. Hioe, Dynamic symmetries in quantum electronics, Physical Review A 28 (2) (1983) 879

    work page 1983

  43. [44]

    B. W. Shore, Coherent manipulations of atoms using laser light, Acta Phys. Slovaca 58 (3) (2008) 243–486

    work page 2008

  44. [45]

    F. T. Hioe, J. H. Eberly, N-level coherence vector and higher conservation laws in quantum optics and quantum mechanics, Phys. Rev. Lett. 47 (12) (1981) 838–841

    work page 1981

  45. [46]

    Fresch, D

    B. Fresch, D. Hiluf, E. Collini, R. D. Levine, F. Remacle, Molecular decision trees realized by ultrafast electronic spectroscopy, Proc. Natl. Acad. Sci. U. S. A. 110 (43) (2013) 17183–17188. doi:10.1073/pnas.1314978110

    work page doi:10.1073/pnas.1314978110 2013

  46. [47]

    Hiluf, All optical programmable logic array (pla), Journal of Physics: Conference Series 987 (1) (2018) 012033

    D. Hiluf, All optical programmable logic array (pla), Journal of Physics: Conference Series 987 (1) (2018) 012033

    work page 2018

  47. [48]

    Alhassid, R

    Y . Alhassid, R. D. Levine, Connection between the maximal entropy and scattering theoretic analyses of collison processes, Phys. Rev. A 18 (1) (1978) 89–116

    work page 1978

  48. [49]

    Komarova, H

    K. Komarova, H. Gattuso, R. D. Levine, F. Remacle, Parallel quantum computation of vibrational dynamics, Frontiers in Physics 8 (2020)

    work page 2020

  49. [50]

    Komarova, H

    K. Komarova, H. Gattuso, R. D. Levine, F. Remacle, Quantum device emulates the dynamics of two coupled oscillators, The Journal of Physical Chemistry Letters 11 (17) (2020) 6990–6995

    work page 2020

  50. [51]

    Komarova, F

    K. Komarova, F. Remacle, R. D. Levine, Compacting the density matrix in quantum dynamics: Singular value decomposition of the surprisal and the dominant constraints for anharmonic systems, The Journal of Chemical Physics 155 (20) (2021) 204110

    work page 2021

  51. [52]

    Moler, C

    C. Moler, C. V . Loan, Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later, SIAM Review 45 (1) (2003) 1–49

    work page 2003

  52. [53]

    Magnus, On the exponential solution of differential equations for a linear operator, Communications on pure and applied mathematics 7 (4) (1954) 649–673

    W. Magnus, On the exponential solution of differential equations for a linear operator, Communications on pure and applied mathematics 7 (4) (1954) 649–673

    work page 1954

  53. [54]

    P. K. Aravind, Matrix solution of pseudospin equations for three-level systems, J. Opt. Soc. Am. B 3 (7) (1986) 1025–1032

    work page 1986

  54. [55]

    Wilcox, Exponential operators and parameter differentiation in quantum physics, Journal of Mathematical Physics 8 (4) (1967) 962–982

    R. Wilcox, Exponential operators and parameter differentiation in quantum physics, Journal of Mathematical Physics 8 (4) (1967) 962–982

    work page 1967

  55. [56]

    J. Wei, E. Norman, On global representations of the solutions of linear differential equations as a product 39 of exponentials, Proceedings of the American Mathematical Society 15 (2) (1964) 327–334

    work page 1964

  56. [57]

    M. Suzuki, Generalized trotter’s formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems, Communications in Mathematical Physics 51 (2) (1976) 183–190

    work page 1976

  57. [58]

    Moler, C

    C. Moler, C. Van Loan, Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later, SIAM review 45 (1) (2003) 3–49

    work page 2003

  58. [59]

    Tarantola, Elements for Physics: Quantities, Qualities, and Intrinsic Theories, Springer, 2006

    A. Tarantola, Elements for Physics: Quantities, Qualities, and Intrinsic Theories, Springer, 2006

    work page 2006

  59. [60]

    Kohavi, N

    Z. Kohavi, N. K. Jha, Switching and finite automata theory, Cambridge University Press, 2010

    work page 2010

  60. [61]

    Zhong, M

    M. Zhong, M. P. Hedges, R. L. Ahlefeldt, J. G. Bartholomew, S. E. Beavan, S. M. Wittig, J. J. Longdell, M. J. Sellars, Optically addressable nuclear spins in a solid with a six-hour coherence time, Nature 517 (7533) (2015) 177–180. doi:10.1038/nature14025. URLhttps://doi.org/10.1038/nature14025

    work page doi:10.1038/nature14025 2015

  61. [62]

    Alexander, G

    J. Alexander, G. Dold, O. W. Kennedy, M. ˇSim˙enas, J. O’Sullivan, C. W. Zollitsch, S. Welinski, A. Ferrier, E. Lafitte-Houssat, T. Lindstr ¨om, P. Goldner, J. J. L. Morton, Coherent spin dynamics of rare-earth doped crystals in the high-cooperativity regime, Phys. Rev. B 106 (2022) 245416. doi:10.1103/PhysRevB.106.245416. URLhttps://link.aps.org/doi/10.1...

    work page doi:10.1103/physrevb.106.245416 2022

  62. [63]

    J. J. Longdell, E. Fraval, M. J. Sellars, N. B. Manson, Stopped light with storage times greater than one second using electromagnetically induced transparency in a solid, Phys. Rev. Lett. 95 (2005) 063601. doi:10.1103/PhysRevLett.95.063601. URLhttps://link.aps.org/doi/10.1103/PhysRevLett.95.063601

    work page doi:10.1103/physrevlett.95.063601 2005

  63. [64]

    Y . Yan, D. Cheng, J.-E. Feng, H. Li, J. Yue, Survey on applications of algebraic state space theory of logical systems to finite state machines, Science China Information Sciences 66 (1) (2022) 111201. doi:10.1007/s11432-022-3538-4. URLhttps://doi.org/10.1007/s11432-022-3538-4

    work page doi:10.1007/s11432-022-3538-4 2022

  64. [65]

    Remacle, R

    F. Remacle, R. D. Levine, Towards parallel computing: Representation of a linear finite state digital logic machine by a molecular relaxation process, Eur. Phys. J. D 42 (2007) 49–59

    work page 2007

  65. [66]

    Gilmore, Lie Groups, Lie Algebras, and Some of Thier Spplications, Dover Publisher, 2006

    R. Gilmore, Lie Groups, Lie Algebras, and Some of Thier Spplications, Dover Publisher, 2006

    work page 2006

  66. [67]

    Sipser, Introduction to the Theory of Computation, 3rd Edition, Course Technology, Boston, MA, 2013

    M. Sipser, Introduction to the Theory of Computation, 3rd Edition, Course Technology, Boston, MA, 2013

    work page 2013

  67. [68]

    L. K. Grover, A fast quantum mechanical algorithm for database search, in: Proceedings of the Twenty- Eighth Annual ACM Symposium on Theory of Computing, STOC ’96, Association for Computing 40 Machinery, New York, NY , USA, 1996, p. 212–219. doi:10.1145/237814.237866. URLhttps://doi.org/10.1145/237814.237866

    work page doi:10.1145/237814.237866 1996

  68. [69]

    In: Pro- ceedings 35th Annual Symposium on Foundations of Computer Science, pp

    P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in: Pro- ceedings 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 124–134. doi:10.1109/SFCS.1994.365700

    work page doi:10.1109/sfcs.1994.365700 1994

  69. [70]

    Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2 (2018) 79

    J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2 (2018) 79. doi:10.22331/q-2018- 08-06-79. URLhttps://doi.org/10.22331/q-2018-08-06-79

    work page doi:10.22331/q-2018- 2018

  70. [71]

    Klein, S

    M. Klein, S. Rogge, F. Remacle, R. Levine, Transcending binary logic by gating three coupled quantum dots, Nano letters 7 (9) (2007) 2795–2799

    work page 2007

  71. [72]

    Viola, S

    L. Viola, S. Lloyd, Dynamical suppression of decoherence in two-state quantum systems, Phys. Rev. A 58 (1998) 2733–2744. doi:10.1103/PhysRevA.58.2733. URLhttps://link.aps.org/doi/10.1103/PhysRevA.58.2733

    work page doi:10.1103/physreva.58.2733 1998

  72. [73]

    G. S. Uhrig, Keeping a quantum bit alive by optimizedπ-pulse sequences, Phys. Rev. Lett. 98 (2007) 100504. doi:10.1103/PhysRevLett.98.100504. URLhttps://link.aps.org/doi/10.1103/PhysRevLett.98.100504

    work page doi:10.1103/physrevlett.98.100504 2007

  73. [74]

    P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A 52 (1995) R2493–R2496. doi:10.1103/PhysRevA.52.R2493. URLhttps://link.aps.org/doi/10.1103/PhysRevA.52.R2493

    work page doi:10.1103/physreva.52.r2493 1995

  74. [75]

    Cincio, K

    L. Cincio, K. Rudinger, M. Sarovar, P. J. Coles, Machine learning of noise-resilient quantum circuits, PRX Quantum 2 (2021) 010324. doi:10.1103/PRXQuantum.2.010324. URLhttps://link.aps.org/doi/10.1103/PRXQuantum.2.010324

    work page doi:10.1103/prxquantum.2.010324 2021

  75. [76]

    Optimal control of coupled spin dynamics: Design of nmr pulse sequences by gradient ascent algorithms,

    N. Khaneja, T. Reiss, C. Kehlet, T. Schulte-Herbr ¨uggen, S. J. Glaser, Optimal control of coupled spin dynamics: design of nmr pulse sequences by gradient ascent algorithms, Journal of Magnetic Resonance 172 (2) (2005) 296–305. doi:https://doi.org/10.1016/j.jmr.2004.11.004. URLhttps://www.sciencedirect.com/science/article/pii/S1090780704003696

    work page doi:10.1016/j.jmr.2004.11.004 2005