Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Information

A Unified Benchmark for Exact Dense Quantum State Preparation

Alexis A. Gomez, Artyom M. Grigoryan

Published Nov 13, 2026• 0 citations
Publisher

Abstract

Exact, deterministic preparation of an arbitrary dense n-qubit state is the data-loading step for quantum signal and image processing, and, without ancillae, a generic target needs at least ⌈(2n − n − 1)/2⌉ controlled-NOT (CNOT) gates. We evaluate the two new Quantum Signal-induced Heap Transform (QsiHT) syntheses, Real and Complex, built on the discrete signal-induced heap transform (DsiHT), inside a nine-configuration benchmark drawn from the uniformly controlled rotation, multiplexor, isometry, Schmidt, and Quantum Shannon Decomposition (QSD) families. Qiskit’s StatePreparation is the only method benchmarked as shipped rather than re-implemented. Every configuration reproduces its Haar-random targets to machine precision, with the Real Synthesis confined to sign-bearing targets. Under noise, one coarse tier is stable, set by the executed two-qubit count; the O(2n) frontier stays well below QSD’s O(4n), and no finer order reproduces across two IBM Heron r2 processors at n = 3. Both syntheses reach the 2n − n − 1 multiplexor-family floor. That count matches StatePreparation and, as built, undercuts every other from-scratch construction from n = 3 up. Under a uniform optimization-level-3 pass Plesch–Brukner falls below it at n = 4 and on real targets at n = 6, and as built, it keeps the lowest constant on complex data among the from-scratch methods above that floor. At large registers, the Real Synthesis has the cheapest build-time cost and the Complex Synthesis handles arbitrary targets.

DOI
10.3390/info17111148

Related papers

New Methods and Frameworks for Quantum State Preparation in Modern Quantum Systems

Alexis Gomez

This thesis studies exact, deterministic preparation of arbitrary dense n-qubit states, the data-loading step in quantum signal and image processing. It derives two syntheses built on the Digital Signal-induced Heap Transform (DsiHT): the QsiHT Fast Path Real Synthesis and the QsiHT Fast Path Complex Synthesis. Both are benchmarked against ten configurations spanning the UCR, isometry, multiplexor, Schmidt/SVD, QSD, and heap-transform families. Several of those are realizations through Qiskit builders or compiler optimization, not from-scratch reimplementations. The n=3 noisy comparison spans ibm_fez, ibm_kingston, and ibm_marrakesh, three 156-qubit IBM Heron r2 processors, where single-submission nine-method jobs permit within-session family-wide Benjamini-Hochberg-corrected comparisons. The frontier-versus-QSD separation reproduces within one calibration on every device, but the within-frontier order does not reproduce across devices or calibration days. A deep-circuit n=8 run on ibm_fez shows the executed-count ordering re-emerge outside the run-to-run spread on the complex target. Depth was not isolated from mapping, gate composition, calibration, or session effects. All methods are exact to machine precision and differ only in cost. Under noise the coarse error tier tracks the executed (routed) two-qubit count, separating the Theta(2^n) frontier from QSD's Theta(4^n) and nothing finer. Both syntheses realize the deployed Qiskit StatePreparation floor of 2^n-n-1 CNOTs, undercutting every other from-scratch method on the as-built CNOT axis. The Real Synthesis serves real (sign-bearing) targets and holds the lowest classical build cost among the exact loaders at large register sizes, through one fast Walsh-Hadamard pass. The Complex Synthesis serves arbitrary complex targets and ties Qiskit's StatePreparation for the lowest simulated sampled error.

quant-pharXiv:2608.16937•Aug 11, 2026•0 citations

A Novel Approach to State-to-State Transformation in Quantum Computing

Artyom M. Grigoryan, Alexis A. Gomez, Sos С. Agaian

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⟩ can be obtained from another r-qubit superposition |y⟩, by using only (2r−1) rotations, each presented by one controlled rotation gate. The quantum superpositions with real amplitudes are considered. The traditional two-stage approach Uy−1Ux:|x⟩→|0⟩⊕r→|y⟩ requires twice as many rotations. Here, both transformations to the conventual basis state, Ux: |x⟩→ |0⟩⊕r and Uy: |y⟩→ |0⟩⊕r, use (2r−1) 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≥2. 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.

Information•Aug 13, 2025•7 citations

New effective methods of preparation of states of quantum image representation

Artyom M. Grigoryan, Alexis A. Gomez, Sos С. Agaian

The multi-qubit transformation is the important step in quantum computation in many applications. In recent works, this problem is addressed by solving by using the QR decomposition with elementary rotations with one- and two-qubit CNOT gates. Reducing the number of these gates is critical since operations on three or more qubits are difficult to implement on the current quantum computers. The quantum signal induced heap transform (QsiHT) provides an efficient method for state preparation in the realm of quantum image representation by amplitudes. This paper presents a detailed analysis of how the QsiHT, particularly through the strong path, is utilized to construct quantum states to represent images. The algorithm behind this method and the realization of the corresponding quantum circuits is outlined. Practical examples of the QsiHT on 2 and 3-qubit systems are given using the Qiskit Framework for quantum circuit simulation.

Multimodal Image Exploitation and Learning•May 28, 2025•0 citations

Quantum Signal‐Induced Heap Transform

Artyom M. Grigoryan, Sos S. Agaian

This chapter briefly describes the quantum signal-induced heap transform (QsiHT) related to the so-called discrete signal-induced heap transform (DsiHT), which was successfully used for image enhancement, classification, compression, and filtration. This transform is generated by any signal of arbitrary length. This transform is also used for different QR-decompositions of square matrices, real and complex. The chapter discusses applying DsiHT-based factorization techniques for real matrices, detailing how these methods can be implemented within quantum circuits to perform essential computations efficiently. It explores the extension of DsiHT to complex matrices, expanding its utility and effectiveness in handling a more comprehensive range of quantum computing tasks. The chapter provides a foundation for understanding how DsiHT and QR-decompositions can be leveraged to improve quantum algorithms' performance and accuracy, paving the way for more sophisticated applications in quantum image processing and other computational domains.

Wiley eBooks•Feb 10, 2025•0 citations

New Permutation-Free Quantum Circuits for Implementing 3- and 4-Qubit Unitary Operations

Artyom M. Grigoryan

The article presents the quantum signal-induced heap transform (QsiHT) method of the QR-decomposition of multi-qubit operations. This transform can be generated by a given signal, by using different paths, or orders, of processing the data. We propose using the concept of the fast path of calculation of the QsiHT and applying such transforms on each stage of the matrix decomposition. This allows us to build quantum circuits for multi-qubit unitary operation without permutations. Unitary operations with real and complex matrices are considered. The cases of 3- and 4-qubit operations are described in detail with quantum circuits. These circuits use a maximum of 28 and 120 Givens rotation gates for 3- and 4-qubit real operations, respectively. All rotations are performing only on adjacent bit planes. For complex unitary operation, each of the Givens gates is used in pairs with two Z-rotation gates. These two types of rotations and the global phase gate are the universal gate set for multi-qubit operations. The presented approach can be used for implementing quantum circuits for n-qubits when n≥2, with a maximum of (4n/2−2n−1) Givens rotations and no permutations.

Information•Jul 21, 2025•5 citations

Signal-Induced Heap Transform-Based QR-Decomposition and Quantum Circuit for Implementing 3-Qubit Operations

Artyom M. Grigoryan, Alexis A. Gomez, Isaac Espinoza +1 more

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.

Information•May 30, 2025•2 citations
Exact, deterministic preparation of an arbitrary dense n-qubit state is the data-loading step for quantum signal and image processing, and, without ancillae, a generic target needs at least ⌈(2n − n − 1)/2⌉ controlled-NOT (CNOT) gates. We evaluate the two new Quantum Signal-induced Heap Transform (QsiHT) syntheses, Real and Complex, built on the discrete signal-induced heap transform (DsiHT), inside a nine-configuration benchmark drawn from the uniformly controlled rotation, multiplexor, isometry, Schmidt, and Quantum Shannon Decomposition (QSD) families. Qiskit’s StatePreparation is the only method benchmarked as shipped rather than re-implemented. Every configuration reproduces its Haar-random targets to machine precision, with the Real Synthesis confined to sign-bearing targets. Under noise, one coarse tier is stable, set by the executed two-qubit count; the O(2n) frontier stays well below QSD’s O(4n), and no finer order reproduces across two IBM Heron r2 processors at n = 3. Both syntheses reach the 2n − n − 1 multiplexor-family floor. That count matches StatePreparation and, as built, undercuts every other from-scratch construction from n = 3 up. Under a uniform optimization-level-3 pass Plesch–Brukner falls below it at n = 4 and on real targets at n = 6, and as built, it keeps the lowest constant on complex data among the from-scratch methods above that floor. At large registers, the Real Synthesis has the cheapest build-time cost and the Complex Synthesis handles arbitrary targets.
This thesis studies exact, deterministic preparation of arbitrary dense n-qubit states, the data-loading step in quantum signal and image processing. It derives two syntheses built on the Digital Signal-induced Heap Transform (DsiHT): the QsiHT Fast Path Real Synthesis and the QsiHT Fast Path Complex Synthesis. Both are benchmarked against ten configurations spanning the UCR, isometry, multiplexor, Schmidt/SVD, QSD, and heap-transform families. Several of those are realizations through Qiskit builders or compiler optimization, not from-scratch reimplementations. The n=3 noisy comparison spans ibm_fez, ibm_kingston, and ibm_marrakesh, three 156-qubit IBM Heron r2 processors, where single-submission nine-method jobs permit within-session family-wide Benjamini-Hochberg-corrected comparisons. The frontier-versus-QSD separation reproduces within one calibration on every device, but the within-frontier order does not reproduce across devices or calibration days. A deep-circuit n=8 run on ibm_fez shows the executed-count ordering re-emerge outside the run-to-run spread on the complex target. Depth was not isolated from mapping, gate composition, calibration, or session effects. All methods are exact to machine precision and differ only in cost. Under noise the coarse error tier tracks the executed (routed) two-qubit count, separating the Theta(2^n) frontier from QSD's Theta(4^n) and nothing finer. Both syntheses realize the deployed Qiskit StatePreparation floor of 2^n-n-1 CNOTs, undercutting every other from-scratch method on the as-built CNOT axis. The Real Synthesis serves real (sign-bearing) targets and holds the lowest classical build cost among the exact loaders at large register sizes, through one fast Walsh-Hadamard pass. The Complex Synthesis serves arbitrary complex targets and ties Qiskit's StatePreparation for the lowest simulated sampled error.
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⟩ can be obtained from another r-qubit superposition |y⟩, by using only (2r−1) rotations, each presented by one controlled rotation gate. The quantum superpositions with real amplitudes are considered. The traditional two-stage approach Uy−1Ux:|x⟩→|0⟩⊕r→|y⟩ requires twice as many rotations. Here, both transformations to the conventual basis state, Ux: |x⟩→ |0⟩⊕r and Uy: |y⟩→ |0⟩⊕r, use (2r−1) 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≥2. 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.
The multi-qubit transformation is the important step in quantum computation in many applications. In recent works, this problem is addressed by solving by using the QR decomposition with elementary rotations with one- and two-qubit CNOT gates. Reducing the number of these gates is critical since operations on three or more qubits are difficult to implement on the current quantum computers. The quantum signal induced heap transform (QsiHT) provides an efficient method for state preparation in the realm of quantum image representation by amplitudes. This paper presents a detailed analysis of how the QsiHT, particularly through the strong path, is utilized to construct quantum states to represent images. The algorithm behind this method and the realization of the corresponding quantum circuits is outlined. Practical examples of the QsiHT on 2 and 3-qubit systems are given using the Qiskit Framework for quantum circuit simulation.
This chapter briefly describes the quantum signal-induced heap transform (QsiHT) related to the so-called discrete signal-induced heap transform (DsiHT), which was successfully used for image enhancement, classification, compression, and filtration. This transform is generated by any signal of arbitrary length. This transform is also used for different QR-decompositions of square matrices, real and complex. The chapter discusses applying DsiHT-based factorization techniques for real matrices, detailing how these methods can be implemented within quantum circuits to perform essential computations efficiently. It explores the extension of DsiHT to complex matrices, expanding its utility and effectiveness in handling a more comprehensive range of quantum computing tasks. The chapter provides a foundation for understanding how DsiHT and QR-decompositions can be leveraged to improve quantum algorithms' performance and accuracy, paving the way for more sophisticated applications in quantum image processing and other computational domains.
The article presents the quantum signal-induced heap transform (QsiHT) method of the QR-decomposition of multi-qubit operations. This transform can be generated by a given signal, by using different paths, or orders, of processing the data. We propose using the concept of the fast path of calculation of the QsiHT and applying such transforms on each stage of the matrix decomposition. This allows us to build quantum circuits for multi-qubit unitary operation without permutations. Unitary operations with real and complex matrices are considered. The cases of 3- and 4-qubit operations are described in detail with quantum circuits. These circuits use a maximum of 28 and 120 Givens rotation gates for 3- and 4-qubit real operations, respectively. All rotations are performing only on adjacent bit planes. For complex unitary operation, each of the Givens gates is used in pairs with two Z-rotation gates. These two types of rotations and the global phase gate are the universal gate set for multi-qubit operations. The presented approach can be used for implementing quantum circuits for n-qubits when n≥2, with a maximum of (4n/2−2n−1) Givens rotations and no permutations.
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.