A Representative Framework for Implementing Quantum Finite Automata on Real Devices

Abstract

We present a framework for the implementation of quantum finite automata algorithms designed for the language $MO{D}_p=\{a^{i\cdot p}\mid i\ge 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.

Proceedings of UCNC 2024

References in corpus (8)

• Quantum Computing in the NISQ era and beyond
• Elementary gates for quantum computation
• Quantum fingerprinting
• Efficient Z-Gates for Quantum Computing
• Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
• Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
• Error rate reduction of single-qubit gates via noise-aware decomposition into native gates
• GAPs for Shallow Implementation of Quantum Finite Automata

Cited by in corpus (2)

• Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata
• Implementation of Quantum Fourier Transform and Quantum Hashing for a Quantum Device with Arbitrary Qubits Connection Graphs