Quantum buffer design using Petri nets
buir.contributor.author | Shah, Syed Asad | |
dc.citation.epage | 32 | |
dc.citation.spage | 1 | |
dc.contributor.author | Shah, Syed Asad | |
dc.contributor.author | Oruc, A. Yavuz | |
dc.date.accessioned | 2025-02-28T11:32:24Z | |
dc.date.available | 2025-02-28T11:32:24Z | |
dc.date.issued | 2024-12-10 | |
dc.department | Department of Computer Engineering | |
dc.description.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 and describes two different such flip-flop designs using quantum NOT, CNOT, CCNOT, and SWAP gates. Each of the quantum S-R flip-flops 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 2.0 and Qiskit programs on IBM quantum computers and simulators and the results validate their expected operations. | |
dc.identifier.doi | 10.1080/17445760.2024.2431879 | |
dc.identifier.eissn | 1744-5779 | |
dc.identifier.issn | 1744-5760 | |
dc.identifier.uri | https://hdl.handle.net/11693/117002 | |
dc.language.iso | English | |
dc.publisher | Taylor & Francis | |
dc.relation.isversionof | https://dx.doi.org/10.1080/17445760.2024.2431879 | |
dc.rights | CC BY 4.0 DEED (Attribution 4.0 International) | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.source.title | International Journal of Parallel, Emergent and Distributed Systems | |
dc.subject | Petri net | |
dc.subject | Quantum buffer | |
dc.subject | Quantum S-R flip-flop | |
dc.subject | Quantum register | |
dc.subject | Quantum information | |
dc.title | Quantum buffer design using Petri nets | |
dc.type | Article |