{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:19:54Z","timestamp":1760059194971,"version":"build-2065373602"},"reference-count":42,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T00:00:00Z","timestamp":1748563200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>This article presents a novel approach to the decomposition of unitary operations for 3-qubit systems by 28 controlled rotations and no permutations. The QR decomposition is described, which is based on the concept of the discrete signal-induced heap transform (DsiHT) and its quantum analogue. This transform is generated by a given signal and may use different paths, or orders, of processing the data, and, among them, one can find paths that allow one to construct efficient quantum circuits for implementing multi-qubit unitary gates. The case of real unitary matrices is considered. The proposed approach is described in detail, and quantum circuits are presented for computing 3-qubit operations. This approach allowed us to write simple Qiskit codes to implement the decomposition of 3-qubit operations. Examples with quantum circuits for the quantum 3-qubit quantum cosine and Hartley transforms are described.<\/jats:p>","DOI":"10.3390\/info16060466","type":"journal-article","created":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T10:21:49Z","timestamp":1748859709000},"page":"466","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Signal-Induced Heap Transform-Based QR-Decomposition and Quantum Circuit for Implementing 3-Qubit Operations"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6683-0064","authenticated-orcid":false,"given":"Artyom M.","family":"Grigoryan","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of Texas at San Antonio, San Antonio, TX 78249, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0592-8553","authenticated-orcid":false,"given":"Alexis","family":"Gomez","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of Texas at San Antonio, San Antonio, TX 78249, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isaac","family":"Espinoza","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of Texas at San Antonio, San Antonio, TX 78249, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4601-4507","authenticated-orcid":false,"given":"Sos S.","family":"Agaian","sequence":"additional","affiliation":[{"name":"Department of Computer Science, School of Engineering, City University of New York (CUNY), New York, NY 10031, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,5,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/320941.320947","article-title":"Unitary Triangulation of a Nonsymmetric Matrix","volume":"5","author":"Householder","year":"1958","journal-title":"J. ACM"},{"key":"ref_2","unstructured":"Bindel, D., Demmel, J., Kahan, W., and Marques, O. (2001). On Computing Givens Rotations Reliably and Efficiently, University of Tennessee. LAPACK Working Note 148; UT-CS-00-449."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/080731992","article-title":"Communication-optimal parallel and sequential QR and LU factorizations","volume":"34","author":"Demmel","year":"2012","journal-title":"SIAM J. Sci. Comp."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.4236\/alamt.2014.42004","article-title":"New method of Givens rotations for triangularization of square matrices","volume":"4","author":"Grigoryan","year":"2014","journal-title":"J. Adv. Linear Algebra Matrix Theory (ALAMT)"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01934122","article-title":"Solving Linear Least Squares Problems by Gram-Schmidt Orthogonalization","volume":"7","year":"1967","journal-title":"BIT"},{"key":"ref_6","unstructured":"Bauer, F.L. (2017). Simultaneous Iteration Method for Symmetric Matrices. Linear Algebra. Handbook for Automatic Computation, Springer."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1098\/rspa.1989.0099","article-title":"Quantum computational networks","volume":"425","author":"Deutsch","year":"1989","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1098\/rspa.1995.0065","article-title":"Universality in quantum computation","volume":"449","author":"Deutsch","year":"1995","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","article-title":"Elementary gates for quantum computation","volume":"52","author":"Barenco","year":"1995","journal-title":"Phys. Rev. A"},{"key":"ref_10","unstructured":"Knill, E. (1995). Approximation by Quantum Circuits."},{"key":"ref_11","first-page":"49","article-title":"Quantum circuits for incompletely specified two-qubit operators","volume":"5","author":"Shende","year":"2005","journal-title":"Quantum Inf. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TCAD.2005.855930","article-title":"Synthesis of quantum logic circuits","volume":"25","author":"Shende","year":"2006","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Plesch, N., and Brukner, C. (2010). Quantum state preparation with universal gate decompositions. arXiv.","DOI":"10.1103\/PhysRevA.83.032302"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"177902","DOI":"10.1103\/PhysRevLett.92.177902","article-title":"Efficient decomposition of quantum gates","volume":"92","author":"Vartiainen","year":"2004","journal-title":"Phys. Rev. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"130502","DOI":"10.1103\/PhysRevLett.93.130502","article-title":"Quantum circuits for general multiqubit gates","volume":"93","author":"Vartiainen","year":"2004","journal-title":"Phys. Rev. Lett."},{"key":"ref_16","unstructured":"Mikko, M., and Vartiainen, J.J. (2005). Decompositions of general quantum gates. arXiv."},{"key":"ref_17","unstructured":"Nielsen, M.A., and Chuang, I.L. (2000). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Bergholm, V., Vartiainen, J.J., M\u00f6tt\u00f6nen, M., and Salomaa, M.M. (2004). Quantum circuits with uniformly controlled one-qubit gates. arXiv.","DOI":"10.1103\/PhysRevA.71.052330"},{"key":"ref_19","unstructured":"Frdoriaka, D. (2025). Decomposition of unitary matrix into quantum gates. arXiv."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Ahmed, N., and Rao, K.R. (1975). Orthogonal Transforms for Digital Signal Processing, Springer.","DOI":"10.1007\/978-3-642-45450-9"},{"key":"ref_21","unstructured":"Elliot, D.F., and Rao, K.R. (1982). Fast Transforms\u2014Algorithms, Analyzes, and Applications, Academic."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Blahut, R.E. (1985). Fast Algorithms for Digital Signal Processing, Addison-Wesley.","DOI":"10.1007\/978-94-009-5113-6_8"},{"key":"ref_23","unstructured":"Bracewell, R.N. (1986). The Hartley Transform, Oxford University Press."},{"key":"ref_24","unstructured":"Grigoryan, A.M., and Grigoryan, M.M. (2009). Brief Notes in Advanced DSP: Fourier Analysis with MATLAB, CRC Press, Taylor, and Francis Group."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/JSAC.1986.1146289","article-title":"A Discrete Fourier-cosine Transform Chip","volume":"4","author":"Vetterli","year":"1986","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_26","unstructured":"Tseng, C.C., and Hwang, T.M. (2005, January 23\u201326). Quantum circuit design of 8\u00d78 discrete cosine transform using its fast computation flow graph. Proceedings of the 2005 IEEE International Symposium on Circuits and Systems (ISCAS), Kobe, Japan."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Rao, K.R., and Yip, R. (1990). Discrete cosine transform: Algorithms, Advantages, and Applications, Academic Press.","DOI":"10.1016\/B978-0-08-092534-9.50007-2"},{"key":"ref_28","unstructured":"R\u00f6tteler, M., P\u00fcschel, M., and Beth, T. (2025, March 31). Fast Signal Transforms for Quantum Computers. Available online: https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/11\/Fast-Signal-Transforms-for-Quantum-Computers.pdf."},{"key":"ref_29","unstructured":"Bracewell, R.N. (2001). The Fourier Transform and Its Applications, McGraw-Hill. [3rd ed.]."},{"key":"ref_30","unstructured":"Tseng, C.C., and Hwang, T.M. (2004, January 23\u201326). Quantum circuit design of 8\u00d78 discrete Hartley transform. Proceedings of the 2004 IEEE International Symposium on Circuits and Systems (ISCAS), Vancouver, BC, Canada."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/78.902116","article-title":"2-D and 1-D multi-paired transforms: Frequency-time type wavelets","volume":"49","author":"Grigoryan","year":"2001","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s11128-019-2322-6","article-title":"Paired quantum Fourier transform with log2N Hadamard gates","volume":"18","author":"Grigoryan","year":"2019","journal-title":"Quantum Inf. Process."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/5992.908999","article-title":"Reducing quantum computations to elementary unitary operations","volume":"3","author":"Cybenko","year":"2001","journal-title":"Comput. Sci. Eng."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Grigoryan, A.M. (2015, January 10\u201311). Fast Heap transform-based QR-decomposition of real and complex matrices: Algorithms and codes, [9411-21]. Proceedings of the SPIE vol. 9411, 2015 Electronic Imaging: Mobile Devices and Multimedia: Enabling Technologies, Algorithms, and Applications 2015, San Francisco, CA, USA.","DOI":"10.1117\/12.2083404"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Grigoryan, A.M., and Grigoryan, M.M. (2006, January 22\u201324). Nonlinear approach of construction of fast unitary transforms. Proceedings of the 2006 40th Annual Conference on Information Sciences and Systems, Princeton, NJ, USA.","DOI":"10.1109\/CISS.2006.286625"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Grigoryan, A.M., and Agaian, S.S. (2025). Quantum Image Processing in Practice: A Mathematical Toolbox, Wiley.","DOI":"10.1002\/9781394265183"},{"key":"ref_37","unstructured":"Qiskit Development Team (Qiskit: An Open-Source Framework for Quantum Computing, 2019). Qiskit: An Open-Source Framework for Quantum Computing, Computer software."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"B\u00e4rtschi, A., and Eidenbenz, S. (2019). Deterministic preparation of Dicke states. arXiv.","DOI":"10.1007\/978-3-030-25027-0_9"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Zhang, X.M., Li, T., and Yuan, X. (2023). Quantum state preparation with optimal circuit depth: Implementations and applications. arXiv.","DOI":"10.1103\/PhysRevLett.129.230504"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Volya, D., and Mishra, P. (2023). State preparation on quantum computers via quantum steering. arXiv.","DOI":"10.1109\/TQE.2024.3358193"},{"key":"ref_41","unstructured":"Pinto, D.F., Friedrich, L., and Maziero, J. (2024). Preparing general mixed quantum states on quantum computers. arXiv."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"87","DOI":"10.4236\/alamt.2022.124005","article-title":"Effective methods of QR-decompositions of square complex matrices by fast discrete signal-induced heap transforms","volume":"12","author":"Grigoryan","year":"2023","journal-title":"Adv. Linear Algebra Matrix Theory (ALAMT)"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/6\/466\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:44:18Z","timestamp":1760031858000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/6\/466"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,30]]},"references-count":42,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["info16060466"],"URL":"https:\/\/doi.org\/10.3390\/info16060466","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2025,5,30]]}}}