Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (3)
  • Open Access

    PROCEEDINGS

    The Biomimetic Turing Machine

    Jiahao Li1, Yinbo Zhu1,*

    The International Conference on Computational & Experimental Engineering and Sciences, Vol.30, No.3, pp. 1-1, 2024, DOI:10.32604/icces.2024.011955

    Abstract Movements actuated by the moisture in plant tissues are prevalent in nature. Different microstructures of plants determine the various patterns of moisture-actuated movements. For instance, the graded lignin fraction of Selaginella lepidophylla leads to the a graded curvature morphology, while the fiber orientation angles determine the helical chirality of chiral seed pods. Inspired by these two types of plant microstructures, a theoretical framework for a biomimetic Turing machine is constructed. Similar to the Turing machine introduced by Alan Turing in 1936, the biomimetic Turing machine has a ribbon-like bilayer structure composed of numerous units, whose More >

  • Open Access

    ARTICLE

    Comparison among Classical, Probabilistic and Quantum Algorithms for Hamiltonian Cycle Problem

    Giuseppe Corrente1,2,*, Carlo Vincenzo Stanzione3,4, Vittoria Stanzione5

    Journal of Quantum Computing, Vol.5, pp. 55-70, 2023, DOI:10.32604/jqc.2023.044786 - 14 December 2023

    Abstract The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a Hamiltonian cycle problem, using different models of computations and especially the probabilistic and quantum ones. Starting from the classical probabilistic approach of random walks, we take a step to the quantum direction by involving an ad hoc designed Quantum Turing Machine (QTM), which can be a useful conceptual project tool for quantum algorithms. Introducing several More >

  • Open Access

    ARTICLE

    Translation of Quantum Circuits into Quantum Turing Machines for Deutsch and Deutsch-Jozsa Problems

    Giuseppe Corrente*

    Journal of Quantum Computing, Vol.2, No.3, pp. 137-145, 2020, DOI:10.32604/jqc.2020.014586 - 31 December 2020

    Abstract We want in this article to show the usefulness of Quantum Turing Machine (QTM) in a high-level didactic context as well as in theoretical studies. We use QTM to show its equivalence with quantum circuit model for Deutsch and Deutsch-Jozsa algorithms. Further we introduce a strategy of translation from Quantum Circuit to Quantum Turing models by these examples. Moreover we illustrate some features of Quantum Computing such as superposition from a QTM point of view and starting with few simple examples very known in Quantum Circuit form. More >

Displaying 1-10 on page 1 of 3. Per Page