{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:35:58Z","timestamp":1760060158896,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T00:00:00Z","timestamp":1755043200000},"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 new approach to the problem of transforming one quantum state into another. It is shown that an r-qubit superposition |x\u27e9 can be obtained from another r-qubit superposition |y\u27e9, by using only (2r\u22121) rotations, each presented by one controlled rotation gate. The quantum superpositions with real amplitudes are considered. The traditional two-stage approach Uy\u22121Ux:|x\u27e9\u2192|0\u27e9\u2295r\u2192|y\u27e9 requires twice as many rotations. Here, both transformations to the conventual basis state, Ux:\u00a0|x\u27e9\u2192\u00a0|0\u27e9\u2295r and Uy:\u00a0|y\u27e9\u2192\u00a0|0\u27e9\u2295r, use (2r\u22121) rotations each on two binary planes, and many of these rotations require additional sets of CNOTs to be represented as 1- or 2-qubit-controlled gates. The proposed method is based on the concept of the discrete signal-induced heap transform (DsiHT) which is unitary and generated by a vector and a set of angular equations with given parameters. The quantum analog of this transform is described. The main characteristic of the DsiHT is the path of processing the data. It is shown that there exist such fast paths that allow for effective computing of the DsiHT, which leads to the simple quantum circuits for state preparation and transformation. Examples of such paths are given and quantum circuits for preparation and transformation of 2-, 3-, and 4-qubits are described in detail. CNOT gates are not used, but only controlled gates of elementary rotations around the y-axis. It is shown that the transformation and, in particular, only rotation gates with control qubits are required for initialization of 2-, 3-, and 4-qubits. The quantum circuits are simple and have a recursive form, which makes them easy to implement for arbitrary r-qubit superposition, with r\u22652. This approach significantly reduces the complexity of quantum state transformations, paving the way for more efficient quantum algorithms and practical implementations on near-term quantum devices.<\/jats:p>","DOI":"10.3390\/info16080689","type":"journal-article","created":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T15:53:27Z","timestamp":1755100407000},"page":"689","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Approach to State-to-State Transformation in Quantum Computing"],"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 A.","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":"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,8,13]]},"reference":[{"key":"ref_1","first-page":"73","article-title":"Quantum computational networks","volume":"425","author":"Deutsch","year":"1989","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Sci."},{"key":"ref_2","first-page":"669","article-title":"Universality in quantum computation","volume":"449","author":"Deutsch","year":"1995","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Sci."},{"key":"ref_3","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_4","unstructured":"Knill, E. (1995). Approximation by Quantum Circuits, Los Alamos National Laboratory. LANL Rep. LAUR-95-2225."},{"key":"ref_5","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_6","doi-asserted-by":"crossref","unstructured":"B\u00e4rtschi, A., and Eidenbenz, S. (2019). Deterministic preparation of Dicke states. International Symposium on Fundamentals of Computation Theory, Springer International Publishing.","DOI":"10.1007\/978-3-030-25027-0_9"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Plesch, M., and Brukner, C. (2010). Quantum state preparation with universal gate decompositions. arXiv.","DOI":"10.1103\/PhysRevA.83.032302"},{"key":"ref_8","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_9","doi-asserted-by":"crossref","unstructured":"Wang, H., Bochen, T.D., and Cong, J. (2024). Quantum state preparation circuit optimization exploiting don\u2019t cares. arXiv.","DOI":"10.1145\/3676536.3676646"},{"key":"ref_10","unstructured":"Pinto, D.F., Friedrich, L., and Maziero, J. (2024). Preparing general mixed quantum states on quantum computers. arXiv."},{"key":"ref_11","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_12","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_13","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_14","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_15","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_16","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_17","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_18","unstructured":"Nielsen, M.A., and Chuang, I.L. (2000). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_19","unstructured":"Rieffel, E.G., and Polak, W.H. (2011). Quantum Computing: A Gentle Introduction, The MIT Press."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/B:QINP.0000020076.36114.13","article-title":"Visualization of the quantum Fourier transform using a quantum computer simulator","volume":"2","author":"Karafyllidis","year":"2003","journal-title":"Quantum Inf. Process."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"4955","DOI":"10.1007\/s11128-016-1439-0","article-title":"Discrete quantum Fourier transform using weak cross-Kerr nonlinearity and displacement operator and photon-number-resolving measurement under the decoherence effect","volume":"15","author":"Heo","year":"2016","journal-title":"Quantum Inf. Process."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"042321","DOI":"10.1103\/PhysRevA.76.042321","article-title":"Efficient classical simulation of the approximate quantum Fourier transform","volume":"76","author":"Yoran","year":"2007","journal-title":"Phys. Rev. A"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_24","first-page":"175","article-title":"Circuit for Shor\u2019s algorithm using 2n + 3 qubits","volume":"3","author":"Beauregard","year":"2003","journal-title":"Quantum Inf. Comput."},{"key":"ref_25","unstructured":"Coppersmith, D. (1994). An Approximate Fourier Transform Useful in Quantum Factoring, IBM. IBM Research Report RC19642."},{"key":"ref_26","unstructured":"Cheung, D. (2003). Using Generalized Quantum Fourier Transforms in Quantum Phase Estimation Algorithms. [Master\u2019s Thesis, University of Waterloo]."},{"key":"ref_27","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_28","unstructured":"Bracewell, R.N. (1986). The Hartley Transform, Oxford University Press."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1109\/TCOM.1974.1092335","article-title":"Slant transform image coding","volume":"22","author":"Pratt","year":"1974","journal-title":"IEEE Trans. Commun."},{"key":"ref_30","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_31","doi-asserted-by":"crossref","unstructured":"Grigoryan, A.M., and Grigoryan, M.M. (2007, January 28\u201330). Discrete unitary transforms generated by moving waves. Proceedings of the SPIE Optics + Photonics 2007, Wavelets XII, San Diego, CA, USA.","DOI":"10.1117\/12.728383"},{"key":"ref_32","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"},{"key":"ref_33","unstructured":"Qiskit Development Team (2019). Qiskit: An Open-Source Framework for Quantum Computing (Version 1.3.2) [Computer Software], IBM Quantum."},{"key":"ref_34","unstructured":"Mykhailova, M. (2025). Quantum Programming in Depth Solving Problems with Q# and Qiskit, Manning."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine calculation of complex Fourier series","volume":"19","author":"Cooley","year":"1965","journal-title":"Math. Comput."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Grigoryan, A.M. (2025). New Permutation-Free Quantum Circuits for Implementing 3- and 4-Qubit Unitary Operations. Information, 16.","DOI":"10.3390\/info16070621"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"M\u00f6tt\u00f6nen, M., and Vartiainen, J.J. (2005). Decompositions of general quantum gates. arXiv.","DOI":"10.1103\/PhysRevLett.92.177902"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/8\/689\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:26:50Z","timestamp":1760034410000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/8\/689"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,13]]},"references-count":37,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,8]]}},"alternative-id":["info16080689"],"URL":"https:\/\/doi.org\/10.3390\/info16080689","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2025,8,13]]}}}