量子Petri网中的可达性问题
On the Reachability Problem in Quantum Petri Nets
浏览论文内容
中文总结 AI 辅助
本文针对有界量子Petri网的可达性问题，提出基于量子并行性与Grover振幅放大算法的量子解决方案，实现二次加速，验证了算法的正确性与可行性。
中文摘要 AI 辅助
本文提出一种新颖的量子解决方案，以解决有界量子Petri网（QPNs）中的可达性问题，QPNs是结合经典Petri网模型与量子力学原理的高级建模框架。该方法利用量子并行性，从初始标识出发构造所有可达标识的叠加态；随后应用Grover振幅放大算法高效识别期望的目标标识，同时将仅用于迁移控制的辅助量子令牌排除在搜索空间外，大幅缩减搜索规模。理论分析表明，该方法相较经典穷举算法实现了二次加速；实验结果也证实了所提量子算法求解量子Petri网有界可达性问题的正确性与可行性。
英文摘要
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.
