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

IEEE Global Conference on Consumer Electronics (GCCE)

A General Quantum Circuit Design Method for Preparation of W State

Su‐Ling Lee, Chien‐Cheng Tseng

Published Sep 23, 2025• 0 citations
Publisher

Abstract

State preparation is a fundamental task in quantum computation and quantum communication, as it initializes a quantum circuit into a desired quantum state. Notable examples of quantum states include the W state, Greenberger–Horne–Zeilinger (GHZ) state, and Dicke state. In this article, we propose a general method for designing quantum circuits to generate the W state. The approach begins by replacing the second column of the identity matrix with the target W state vector, forming an initial matrix. This matrix is then factorized using QR decomposition into a unitary matrix Q and an upper triangular matrix R. A quantum circuit that realizes the unitary matrix Q is subsequently obtained using the IBM Qiskit transpiler. The transformation performed by the circuit corresponds to matrix-vector multiplication with Q, and the desired W state emerges as the output when the input is the all-zero quantum state. Experimental results for W state generation with three qubits are presented to demonstrate the effectiveness of the proposed method.

DOI
10.1109/gcce65946.2025.11275181

Related papers

A Quantum State Preparation Method Based on Gram-Schmidt Decomposition

Su‐Ling Lee, Chien‐Cheng Tseng

Quantum state preparation (QSP) refers to the process of initializing a quantum circuit into a specific quantum state, which serves as the starting point for several quantum algorithms. In this article, a Gram-Schmidt decomposition (GSD) method is proposed to address the QSP problem. The method involves the following five steps: First, the first column vector of the identity matrix is replaced with the unit-norm data vector to construct an initial matrix. Second, the initial matrix is decomposed into the product of a unitary matrix and an upper triangular matrix using the GSD method. Third, the transpile tool from IBM Qiskit is employed to design a quantum circuit, ensuring that the input and output state vectors correspond to the relationship defined by the obtained unitary matrix. Fourth, when the input state vector of the quantum circuit is set as the zero vector, the output state vector corresponds to the desired data vector to be prepared. Finally, a numerical example using the Iris flower dataset is provided to demonstrate the effectiveness of the proposed method.

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan)•Jul 16, 2025•0 citations

Numerical Circuit Synthesis and Compilation for Multi-State Preparation

Aaron Szasz, Ed Younis, Wibe Albert de Jong

Near-term quantum computers have significant error rates and short coherence times, so compilation of circuits to be as short as possible is essential. Two types of compilation problems are typically considered: circuits to prepare a given state from a fixed input state, called “state preparation”; and circuits to implement a given unitary operation, for example by “unitary synthesis”. In this paper we solve a more general problem: the transformation of a set of m states to another set of$m$states, which we call “multi-state preparation”. State preparation and unitary synthesis are special cases; for state preparation, m=1, while for unitary synthesis, m is the dimension of the full Hilbert space. We generate and optimize circuits for multi-state preparation numerically. In cases where a top-down approach based on matrix decompositions is also possible, our method finds circuits with substantially (up to 40 %) fewer two-qubit gates. We discuss possible applications, including efficient preparation of macroscopic superposition (“cat”) states and synthesis of quantum channels.

arXiv:2305.01816•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•7 citations

QFlux: Quantum Circuit Implementations of Molecular Dynamics. Part III - State Initialization and Unitary Decomposition

Alexander V. Soudackov, Delmar G. A. Cabral, Brandon Allen +7 more

This tutorial builds upon the foundations established in Part~II to present a unified, implementation-oriented overview of quantum state initialization and unitary decomposition for n -qubit systems, available in QFlux . We begin with the preparation of arbitrary quantum states and develop two complementary constructions: (i) a recursive multiplexor method (after Shende et al.) that disentangles qubits via multiplexed R y and R z rotations, and (ii) an algebraic scheme based on uniformly controlled rotations (UCRs) (after Möttönen et al.) that realizes the same mapping through analytically defined rotation networks with predictable gate counts. We then extend these state-preparation tools to generic unitary synthesis through Givens-rotation, column-by-column, and recursive cosine-sine (CSD) and quantum Shannon (QSD) decompositions, explicitly linking linear-algebraic factorizations to executable circuits while tracking CNOT complexity. Finally, we introduce the Walsh decomposition for diagonal unitaries and show how Gray-code ordering and local CNOT cancellations yield an O(2^n) entangling-gate cost, providing shallow, NISQ-friendly implementations. Taken together, these techniques form a pedagogical bridge from matrix analysis to hardware-efficient circuit constructions, offering clear design rules, closed-form parameters, and scalable synthesis pathways for simulation and experiment.

•Jan 30, 2026•0 citations

Synthesis of Hybrid and d-valued Quantum Logic Circuits

Faisal Shah Khan, Marek A. Perkowski

Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A further generalization leads to quantum computing with hybrid qudits where two or more qudits have different finite dimensions. In both cases, a quantum computation is performed when a unitary evolution operator, acting as a quantum logic gate, transforms the state of qudits in a quantum system. Unitary operators can be represented by unitary matrices, and therefore for a quantum system consists of multiple qudits, a gate may be synthesized by matrix decomposition techniques such as QR factorization and the Cosine-sine Decomposition (CSD). In this article, we present a CSD based synthesis method for n qudit hybrid and d-valued quantum circuits.

IEEE Congress on Evolutionary Computation (CEC)•Sep 22, 2006•0 citations

Efficient preparation of high-dimensional hybrid entangled states in circuit quantum electrodynamics

Wang-Chu Lv, Wentao Zhao, Yu Wang +6 more

High-dimensional quantum systems, known as qudits with dimension $d>2$, possess the capability to encode and process more information than traditional two-dimensional qubits. Entangled states serve as crucial resources for both quantum computation and quantum communication. On the basis of circuit quantum electrodynamics (QED) systems, we introduce an efficient scheme to deterministically generate high-dimensional multipartite entangled states of hybrid qutrits ($d=3$). Assuming a simple initial state has already been prepared with the use of local operations, our method requires only a single step to produce hybrid Greenberger-Horne-Zeilinger (GHZ) entangled states among circuit QED systems consisting of superconducting qutrits and a superconducting cavity. Remarkably, the number of steps and the operational time remain constant as the number of qutrits increases, highlighting the efficiency and scalability of our approach. Using numerical simulations for a three-dimensional hybrid GHZ state of seven qutrits, we demonstrate the feasibility of our scheme and study the effects of various parameters on the fidelity. The importance of this research is in directing the experimental creation of multipartite, high-dimensional, and hybrid GHZ states, which can then be used to enhance quantum communication protocols and computational processes.

Physical Review Applied•May 14, 2025•5 citations

A General Method for Designing n-Qubits Entanglement Creating Circuits and its Application in Different 4-qubits Entanglement Creating Circuits

Mohammed J. Mohammed, Mezher B. Saleh, Ismaeel Al-Baidhany

Abstract One of the most important aspects of quantum computation is quantum entanglement, it is an interesting feature of quantum physics, and has many important applications such as quantum teleportation, cryptography, quantum computation, and dense coding. It is an essential task in quantum computing to design circuits that create an entangled system, and many circuits were implied in the quantum computers that generate the desired entangled state of a system. In this paper, we suggest a general method to design different quantum circuits that produce an entangled system for any number of qubits in different manners. Also, we apply the suggested method in order to design different 4-qubits entanglement creating circuits. The results show that it is possible to design different entanglement creating circuits for any number of qubits by following certain method that will be discussed in the paper, and in the case of 4-qubits system we are going to look only at two circuits, the first creates a “GHZ” like state and the second creates a four-basis entanglement state.

Journal of Physics Conference Series•Sep 1, 2021•2 citations
State preparation is a fundamental task in quantum computation and quantum communication, as it initializes a quantum circuit into a desired quantum state. Notable examples of quantum states include the W state, Greenberger–Horne–Zeilinger (GHZ) state, and Dicke state. In this article, we propose a general method for designing quantum circuits to generate the W state. The approach begins by replacing the second column of the identity matrix with the target W state vector, forming an initial matrix. This matrix is then factorized using QR decomposition into a unitary matrix Q and an upper triangular matrix R. A quantum circuit that realizes the unitary matrix Q is subsequently obtained using the IBM Qiskit transpiler. The transformation performed by the circuit corresponds to matrix-vector multiplication with Q, and the desired W state emerges as the output when the input is the all-zero quantum state. Experimental results for W state generation with three qubits are presented to demonstrate the effectiveness of the proposed method.
Quantum state preparation (QSP) refers to the process of initializing a quantum circuit into a specific quantum state, which serves as the starting point for several quantum algorithms. In this article, a Gram-Schmidt decomposition (GSD) method is proposed to address the QSP problem. The method involves the following five steps: First, the first column vector of the identity matrix is replaced with the unit-norm data vector to construct an initial matrix. Second, the initial matrix is decomposed into the product of a unitary matrix and an upper triangular matrix using the GSD method. Third, the transpile tool from IBM Qiskit is employed to design a quantum circuit, ensuring that the input and output state vectors correspond to the relationship defined by the obtained unitary matrix. Fourth, when the input state vector of the quantum circuit is set as the zero vector, the output state vector corresponds to the desired data vector to be prepared. Finally, a numerical example using the Iris flower dataset is provided to demonstrate the effectiveness of the proposed method.
Near-term quantum computers have significant error rates and short coherence times, so compilation of circuits to be as short as possible is essential. Two types of compilation problems are typically considered: circuits to prepare a given state from a fixed input state, called “state preparation”; and circuits to implement a given unitary operation, for example by “unitary synthesis”. In this paper we solve a more general problem: the transformation of a set of m states to another set ofmmmstates, which we call “multi-state preparation”. State preparation and unitary synthesis are special cases; for state preparation, m=1, while for unitary synthesis, m is the dimension of the full Hilbert space. We generate and optimize circuits for multi-state preparation numerically. In cases where a top-down approach based on matrix decompositions is also possible, our method finds circuits with substantially (up to 40 %) fewer two-qubit gates. We discuss possible applications, including efficient preparation of macroscopic superposition (“cat”) states and synthesis of quantum channels.
This tutorial builds upon the foundations established in Part~II to present a unified, implementation-oriented overview of quantum state initialization and unitary decomposition for n -qubit systems, available in QFlux . We begin with the preparation of arbitrary quantum states and develop two complementary constructions: (i) a recursive multiplexor method (after Shende et al.) that disentangles qubits via multiplexed R y and R z rotations, and (ii) an algebraic scheme based on uniformly controlled rotations (UCRs) (after Möttönen et al.) that realizes the same mapping through analytically defined rotation networks with predictable gate counts. We then extend these state-preparation tools to generic unitary synthesis through Givens-rotation, column-by-column, and recursive cosine-sine (CSD) and quantum Shannon (QSD) decompositions, explicitly linking linear-algebraic factorizations to executable circuits while tracking CNOT complexity. Finally, we introduce the Walsh decomposition for diagonal unitaries and show how Gray-code ordering and local CNOT cancellations yield an O(2^n) entangling-gate cost, providing shallow, NISQ-friendly implementations. Taken together, these techniques form a pedagogical bridge from matrix analysis to hardware-efficient circuit constructions, offering clear design rules, closed-form parameters, and scalable synthesis pathways for simulation and experiment.
Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A further generalization leads to quantum computing with hybrid qudits where two or more qudits have different finite dimensions. In both cases, a quantum computation is performed when a unitary evolution operator, acting as a quantum logic gate, transforms the state of qudits in a quantum system. Unitary operators can be represented by unitary matrices, and therefore for a quantum system consists of multiple qudits, a gate may be synthesized by matrix decomposition techniques such as QR factorization and the Cosine-sine Decomposition (CSD). In this article, we present a CSD based synthesis method for n qudit hybrid and d-valued quantum circuits.
High-dimensional quantum systems, known as qudits with dimension d>2d>2d>2, possess the capability to encode and process more information than traditional two-dimensional qubits. Entangled states serve as crucial resources for both quantum computation and quantum communication. On the basis of circuit quantum electrodynamics (QED) systems, we introduce an efficient scheme to deterministically generate high-dimensional multipartite entangled states of hybrid qutrits (d=3d=3d=3). Assuming a simple initial state has already been prepared with the use of local operations, our method requires only a single step to produce hybrid Greenberger-Horne-Zeilinger (GHZ) entangled states among circuit QED systems consisting of superconducting qutrits and a superconducting cavity. Remarkably, the number of steps and the operational time remain constant as the number of qutrits increases, highlighting the efficiency and scalability of our approach. Using numerical simulations for a three-dimensional hybrid GHZ state of seven qutrits, we demonstrate the feasibility of our scheme and study the effects of various parameters on the fidelity. The importance of this research is in directing the experimental creation of multipartite, high-dimensional, and hybrid GHZ states, which can then be used to enhance quantum communication protocols and computational processes.
Abstract One of the most important aspects of quantum computation is quantum entanglement, it is an interesting feature of quantum physics, and has many important applications such as quantum teleportation, cryptography, quantum computation, and dense coding. It is an essential task in quantum computing to design circuits that create an entangled system, and many circuits were implied in the quantum computers that generate the desired entangled state of a system. In this paper, we suggest a general method to design different quantum circuits that produce an entangled system for any number of qubits in different manners. Also, we apply the suggested method in order to design different 4-qubits entanglement creating circuits. The results show that it is possible to design different entanglement creating circuits for any number of qubits by following certain method that will be discussed in the paper, and in the case of 4-qubits system we are going to look only at two circuits, the first creates a “GHZ” like state and the second creates a four-basis entanglement state.