Quantum circuits from non-unitary sparse binary matrices
Abstract Quantum computing leverages unitary matrices to perform reversible computations while preserving probability norms. However, many real-world applications involve non-unitary sparse matrices, posing a challenge for quantum implementation. This paper introduces a novel method for transforming...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-07-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-025-03424-7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849334747841429504 |
|---|---|
| author | Krishnageetha Karuppasamy Varunteja Puram K. M. George Thomas P. Johnson |
| author_facet | Krishnageetha Karuppasamy Varunteja Puram K. M. George Thomas P. Johnson |
| author_sort | Krishnageetha Karuppasamy |
| collection | DOAJ |
| description | Abstract Quantum computing leverages unitary matrices to perform reversible computations while preserving probability norms. However, many real-world applications involve non-unitary sparse matrices, posing a challenge for quantum implementation. This paper introduces a novel method for transforming a class of non-unitary sparse binary matrices into higher-dimensional permutation matrices, ensuring unitarity. Our approach is efficient in both space and time, ensuring practical applicability to large-scale problems. We demonstrate the utility of this transformation in constructing quantum gates and apply the method to model quantum finite state machines (QFSMs) derived from classical deterministic finite automata (DFAs). This work offers a practical pathway for integrating non-unitary transformations into quantum systems, with implications for the many applications that are based on sparse, non-unitary matrices. The significance of this work for automata theory and quantum computation is outlined. |
| format | Article |
| id | doaj-art-3a09f70b53444f1b8e35fe1c040b8d5c |
| institution | Kabale University |
| issn | 2045-2322 |
| language | English |
| publishDate | 2025-07-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj-art-3a09f70b53444f1b8e35fe1c040b8d5c2025-08-20T03:45:28ZengNature PortfolioScientific Reports2045-23222025-07-0115111310.1038/s41598-025-03424-7Quantum circuits from non-unitary sparse binary matricesKrishnageetha Karuppasamy0Varunteja Puram1K. M. George2Thomas P. Johnson3Department of Computer Science, Oklahoma State UniversityDepartment of Computer Science, Oklahoma State UniversityDepartment of Computer Science, Oklahoma State UniversityDepartment of Computer Science, Oklahoma State UniversityAbstract Quantum computing leverages unitary matrices to perform reversible computations while preserving probability norms. However, many real-world applications involve non-unitary sparse matrices, posing a challenge for quantum implementation. This paper introduces a novel method for transforming a class of non-unitary sparse binary matrices into higher-dimensional permutation matrices, ensuring unitarity. Our approach is efficient in both space and time, ensuring practical applicability to large-scale problems. We demonstrate the utility of this transformation in constructing quantum gates and apply the method to model quantum finite state machines (QFSMs) derived from classical deterministic finite automata (DFAs). This work offers a practical pathway for integrating non-unitary transformations into quantum systems, with implications for the many applications that are based on sparse, non-unitary matrices. The significance of this work for automata theory and quantum computation is outlined.https://doi.org/10.1038/s41598-025-03424-7 |
| spellingShingle | Krishnageetha Karuppasamy Varunteja Puram K. M. George Thomas P. Johnson Quantum circuits from non-unitary sparse binary matrices Scientific Reports |
| title | Quantum circuits from non-unitary sparse binary matrices |
| title_full | Quantum circuits from non-unitary sparse binary matrices |
| title_fullStr | Quantum circuits from non-unitary sparse binary matrices |
| title_full_unstemmed | Quantum circuits from non-unitary sparse binary matrices |
| title_short | Quantum circuits from non-unitary sparse binary matrices |
| title_sort | quantum circuits from non unitary sparse binary matrices |
| url | https://doi.org/10.1038/s41598-025-03424-7 |
| work_keys_str_mv | AT krishnageethakaruppasamy quantumcircuitsfromnonunitarysparsebinarymatrices AT varuntejapuram quantumcircuitsfromnonunitarysparsebinarymatrices AT kmgeorge quantumcircuitsfromnonunitarysparsebinarymatrices AT thomaspjohnson quantumcircuitsfromnonunitarysparsebinarymatrices |