Implementing a Quantum Finite Automaton in IBMQ using Custom Control Pulses
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_ | 1866915055530934272 |
|---|---|
| author | Lussi, Eduardo Willwock de Sousa, Lucas Cavalcante Marchi, Jerusa de Santiago, Rafael Duzzioni, Eduardo Inacio |
| author_facet | Lussi, Eduardo Willwock de Sousa, Lucas Cavalcante Marchi, Jerusa de Santiago, Rafael Duzzioni, Eduardo Inacio |
| contents | Quantum finite automata can be used for pattern recognition. Present implementations on actual quantum devices face decoherence issues, which compromise the quality of long strings computation. In this work, we focus on the Measure Once 1-way Quantum Finite Automata (MO1QFA) model for addressing the MOD^p problem, investigating how quantum errors may affect the quality of the computation in this model when implemented in IBM-Q superconducting environment. To improve the performance of the implementation, we use pulse-level programming for calibrating a fast single-qubit gate designed specifically for the automaton implementation. The demonstrations conducted on the Jakarta quantum computer show that using custom pulses significantly reduces errors during extended word computations. While realizing improvements in error variations and predictability -- with a fourfold reduction in circuit latency -- the proposed solution demonstrates a substantial increase in the supported computation length of the automaton. When considering thresholds of 10% and 20% in absolute errors of acceptance probabilities, the solution has the potential to increase the maximum word length by 12 and 7+ times, respectively, compared to the default Qiskit gate. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06977 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Implementing a Quantum Finite Automaton in IBMQ using Custom Control Pulses Lussi, Eduardo Willwock de Sousa, Lucas Cavalcante Marchi, Jerusa de Santiago, Rafael Duzzioni, Eduardo Inacio Quantum Physics Formal Languages and Automata Theory Quantum finite automata can be used for pattern recognition. Present implementations on actual quantum devices face decoherence issues, which compromise the quality of long strings computation. In this work, we focus on the Measure Once 1-way Quantum Finite Automata (MO1QFA) model for addressing the MOD^p problem, investigating how quantum errors may affect the quality of the computation in this model when implemented in IBM-Q superconducting environment. To improve the performance of the implementation, we use pulse-level programming for calibrating a fast single-qubit gate designed specifically for the automaton implementation. The demonstrations conducted on the Jakarta quantum computer show that using custom pulses significantly reduces errors during extended word computations. While realizing improvements in error variations and predictability -- with a fourfold reduction in circuit latency -- the proposed solution demonstrates a substantial increase in the supported computation length of the automaton. When considering thresholds of 10% and 20% in absolute errors of acceptance probabilities, the solution has the potential to increase the maximum word length by 12 and 7+ times, respectively, compared to the default Qiskit gate. |
| title | Implementing a Quantum Finite Automaton in IBMQ using Custom Control Pulses |
| topic | Quantum Physics Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2412.06977 |