A Representative Framework for Implementing Quantum Finite Automata on Real Devices
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911920398794752 |
|---|---|
| author | Khadieva, Aliya Salehi, Özlem Yakaryılmaz, Abuzer |
| author_facet | Khadieva, Aliya Salehi, Özlem Yakaryılmaz, Abuzer |
| contents | We present a framework for the implementation of quantum finite automata algorithms designed for the language $ MOD_p = \{ a^{i\cdot p } \mid i \geq 0 \}$ on gate-based quantum computers. First, we compile the known theoretical results from the literature to reduce the number of CNOT gates. Second, we demonstrate techniques for modifying the algorithms based on the basis gates of available quantum hardware in order to reduce circuit depth. Lastly, we explore how the number of CNOT gates may be reduced further if the topology of the qubits is known. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_11360 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Representative Framework for Implementing Quantum Finite Automata on Real Devices Khadieva, Aliya Salehi, Özlem Yakaryılmaz, Abuzer Quantum Physics Formal Languages and Automata Theory We present a framework for the implementation of quantum finite automata algorithms designed for the language $ MOD_p = \{ a^{i\cdot p } \mid i \geq 0 \}$ on gate-based quantum computers. First, we compile the known theoretical results from the literature to reduce the number of CNOT gates. Second, we demonstrate techniques for modifying the algorithms based on the basis gates of available quantum hardware in order to reduce circuit depth. Lastly, we explore how the number of CNOT gates may be reduced further if the topology of the qubits is known. |
| title | A Representative Framework for Implementing Quantum Finite Automata on Real Devices |
| topic | Quantum Physics Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2406.11360 |