Quantum Buffer Design Using Petri Nets
Syed Asad Shah, A. Yavuz Oru\c{c}

TL;DR
This paper presents a novel quantum buffer design framework using simplified Petri nets, including a quantum S-R flip-flop, validated through IBM quantum computing platforms.
Contribution
It introduces a simplified quantum Petri net model and designs quantum buffers and flip-flops, extending classical buffer concepts to quantum computing.
Findings
Quantum S-R flip-flop designed with CNOT and SWAP gates
Quantum buffers implemented and validated on IBM quantum hardware
Designs are scalable for multiple qubits
Abstract
This paper introduces a simplified quantum Petri net (QPN) model and uses this model to generalize classical SISO, SIMO, MISO, MIMO and priority buffers to their quantum counterparts. It provides a primitive storage element, namely a quantum S-R flip-flop design using quantum CNOT and SWAP gates that can be replicated to obtain a quantum register for any given number of qubits. The aforementioned quantum buffers are then obtained using the simplified QPN model and quantum registers. The quantum S-R flip-flop and quantum buffer designs have been tested using OpenQASM and Qiskit on IBM quantum computers and simulators and the results validate the presented quantum S-R flip-flop and buffer designs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
