On the Reachability Problem in Quantum Petri Nets

Quantum Physics arXiv:2608.21428 (quant-ph) [Submitted on 16 Aug 2026] Title:On the Reachability Problem in Quantum Petri Nets Authors:Syed Asad Shah, A.

Yavuz Oruc View a PDF of the paper titled On the Reachability Problem in Quantum Petri Nets, by Syed Asad Shah and A.

Yavuz Oruc View PDF HTML (experimental) Abstract: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. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2608.21428 [quant-ph] (or arXiv:2608.21428v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2608.21428 Focus to learn more arXiv-issued DOI via DataCite Submission history From: A. Yavuz Oruc [view email] [v1] Sun, 16 Aug 2026 21:36:59 UTC (644 KB) Full-text links: Access Paper: View a PDF of the paper titled On the Reachability Problem in Quantum Petri Nets, by Syed Asad Shah and A. Yavuz OrucView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-08 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)