Signal Processing

A Reasoning Method Using Quantum Petri Nets

Yang Xun

Published Jan 1, 2009• 0 citations

Abstract

To deal with the non-applicability of the thresh value in Petri Nets,a reasoning method based on the quantum superposition principle is proposed.The reasoning method provide the quantum Petri Nets(QPN).In the quantum petri nets,The ignition thresholds and the tokes of QPN is described by quantum superposition states.The reasoning method can deal with inconsistent inforamtion in parallel computation and get the inference results in quantum state.The quantum state of the results collapses in probability and a inference result set is obtained.The inference result set is analysed based on the designed optimization operators and the most reasonable result is oabtained.To increase the recognition rate of Morse code signal targets,a recognition algorithm of Morse code signal targets is proposed.The software developed based on the recognition algorithm has good stability and anti-noise ability.

Related papers

On the Reachability Problem in Quantum Petri Nets

Syed Asad Shah, A. Yavuz Oruc

In this paper, we propose a novel quantum solution to address the problem of reachability in bounded quantum Petri nets (QPNs), an advanced modeling framework that combines the classical Petri net model with quantum mechanical principles. The proposed approach exploits quantum parallelism to construct a superposition over all reachable markings from the initial marking. Grover's amplitude amplification algorithm is then applied to efficiently identify a desired target marking, while ancillary q-tokens used solely for transition control are excluded from the search space, significantly reducing its size. Theoretical analysis shows that our approach achieves a quadratic speed up over classical exhaustive algorithms. Experimental results also confirm the correctness and feasibility of the proposed quantum algorithm for solving the bounded reachability problem in Quantum Petri Nets.

quant-pharXiv:2608.21428Aug 18, 20260 citations

Quantum Petri Nets

Tiberiu Stefan Letia, Elenita Maria Durla-Pasca, Dahlia Al-Janabi

The development of quantum software applications requires models capable to describe quantum features (superposition, entanglement, reversibility etc.) as well as the software algorithm requirements. The newly proposed Quantum Petri Nets (QPNs) have the structure of the classical Petri Nets (PNs), but their tokens represent superposed quantum states fulfilling the Hilbert space features. Instead of the integer numerical values of the PN marking, QPNs use quantum marking describing an extreme huge space. New conditions for the transition enabling and new mappings for the transition executions are conceived. A PN based language is used for the structure analysis. Replacing the classical tokens with the probability distribution of the quantum vectors, the QPN simulation is possible as well as the construction of a reachability graph.

International Conference on System Theory, Control and Computing (ICSTCC)Oct 20, 20215 citations

Development of Evolutionary Systems Based on Quantum Petri Nets

Tiberiu Stefan Letia, Elenita Maria Durla-Pasca, Dahlia Al-Janabi +1 more

Evolutionary systems (ES) include software applications that solve problems using heuristic methods instead of the deterministic ones. The classical computing used for ES development involves random methods to improve different kinds of genomes. The mappings of these genomes lead to individuals that correspond to the searched solutions. The individual evaluations by simulations serve for the improvement of their genotypes. Quantum computations, unlike the classical computations, can describe and simulate a large set of individuals simultaneously. This feature is used to diminish the time for finding the solutions. Quantum Petri Nets (QPNs) can model dynamical systems with probabilistic features that make them appropriate for the development of ES. Some examples of ES applications using the QPNs are given to show the benefits of the current approach. The current research solves quantum evolutionary problems using quantum genetic algorithms conceived and improved based on QPN. They were tested on a dynamic system using a Quantum Discrete Controlled Walker (QDCW).

MathematicsNov 22, 20224 citations

Formal verification of quantum communication protocols using Petri nets

Sheng Zhang, Yonghui Ma, Chunning Meng +1 more

This paper presents a new formal method for verification of quantum communication protocols. By extending the symbolic system of Petri nets, we can define quantum pure states in Petri-net settings. Therefore, it is possible to emerge a framework from formalizing basic quantum phenomena, which are utilized to achieve communication tasks. We also present an example of applying this framework to the modeling and analyzing quantum communication protocols to show how it works.

arXiv:1704.07031Apr 24, 20172 citations

Modeling of Quantum Computer by using Quantum Petri Net

Ito Shinsuke, Atsushi Ohta, Kohkichi Tsuji

Petri Net that is an effective tool for concurrent systems, has been extended to Quantum Petri Net. The conventional modeling method of quantum computer using Quantum Petri Net, have several drawbacks. This paper defines new model and examines conditions to solve these drawbacks, and proposes new model from modeling quantum Turing machine, and shows that the model can simulate more general calculation processes than which the conventional model.

International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)Jul 1, 20083 citations

基于量子计算的符号推理算法

Jincheng Zhang

This paper introduces a novel quantum computing-based symbolic reasoning algorithm designed to enhance the efficiency and accuracy of symbolic reasoning. Traditional symbolic reasoning methods often struggle with computational complexity, particularly when dealing with large and complex knowledge bases. This work proposes a quantum algorithm leveraging quantum bit entanglement and superposition to accelerate the process of logical inference and knowledge retrieval. We explore a specific implementation of this algorithm using a simplified model of logical deduction, demonstrating its potential to outperform classical approaches in certain scenarios. The core mechanism centers on quantum state manipulation to facilitate the exploration of multiple possible reasoning paths concurrently. The paper concludes with a discussion of the challenges and future directions of this research, highlighting the potential for quantum computing to revolutionize symbolic reasoning. The primary goal is to provide a solid theoretical foundation and initial experimental results demonstrating the algorithm's efficacy.

Aug 31, 20260 citations