Quick Navigation
Topics
Trapped Ion Quantum Computing
A Representative Framework for Implementing Quantum Finite Automata on Real Devices
arXiv
Authors: Aliya Khadieva, Özlem Salehi, Abuzer Yakaryılmaz
Year
2024
Paper ID
66450
Status
Preprint
Abstract Read
~2 min
Abstract Words
90
Citations
N/A
Abstract
We present a framework for the implementation of quantum finite automata algorithms designed for the language MODp = \{ aicdot 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.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2024 reference point for readers tracking recent quantum research.
- We present a framework for the implementation of quantum finite automata algorithms designed for the language MODp = a^icdot p mid i geq 0 on gate-based quantum computers.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.