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

Construction of Maximally Multiqubit Entangled State by Using CNOT Gates

Xin-Wei Zha, Junling Che

Published Jan 12, 2018• 0 citations
Publisher

Abstract

We propose a novel protocol to build a maximally entangled state based on controlled-not (CNOT) gates. In particular, we give detailed steps to construct maximally entangled state for 4-, 5-, and 6-qubit systems. The advantage of our method is the simple algebraic structure which can be realized via current experimental technology.
DOI
10.20944/preprints201801.0118.v1

Related papers

Construction of the Complete Set of Maximally Entangled Basis Vectors for N-Qubit Systems

Chi‐Chuan Hwang

In this study, we first use a three-qubit system as an example to demonstrate the construction of quantum circuits for the eight maximally entangled basis vectors, subsequently extending the approach to N-qubit systems. We employ a random-number approach to generate maximally entangled basis vectors and their corresponding circuits, while also detailing the required number of single-qubit and CNOT gates. This approach not only provides a solid theoretical foundation but also establishes a practical technique for technological applications, bypassing the difficulty of storing large-scale encoding data.

arXiv:2510.02685•Oct 3, 2025•0 citations

Multiparticle entanglement with quantum logic networks: Application to cold trapped ions

Marek Šašura, Vladimír Bužek

We show how to construct a multiqubit control gate on a quantum register of an arbitrary size N. This gate performs a single-qubit operation on a specific qubit conditioned by the state of other $N\ensuremath{-}1$ qubits. We provide an algorithm how to build up an array of networks consisting of single-qubit rotations and multiqubit control-NOT (CNOT) gates for the synthesis of an arbitrary entangled quantum state of N qubits. We illustrate the algorithm on a system of cold trapped ions. This example illuminates the efficiency of the direct implementation of the multiqubit CNOT gate compared to its decomposition into a network of two-qubit CNOT gates.

arXiv:quant-ph/0103067•Physical Review A•Jun 4, 2001•65 citations

Quantum circuits of CNOT gates

Marc Bataille

We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give algorithms to optimize this type of circuits in some particular cases. Finally we show how to create some usefull entangled states when a CNOT circuit acts on a fully factorized state.

arXiv:2009.13247•Sep 24, 2020•26 citations

Quantum Dialogue Based on Non-maximally Entangled Bell States

Huayang Li, Min Jiang

We propose a new quantum dialogue protocol based on non-maximally entangled Bell states. With single-qubit unitary operation, CNOT gate and the Positive Operator Valued Measure (POVM) technology, a quantum dialogue with certain capacity, can be implemented between two users Alice and Bob. This protocol firstly generalizes the quantum dialogue to a more general scenario which uses non-maximally entangled states as the quantum channel. Security analysis shows that our protocol can resist several well-known security issues. Moreover, it is simple and feasible with current techniques, and it demonstrates a good scalability.

Chinese Control Conference (CCC)•Jul 1, 2020•0 citations

Quantum-state preparation with universal gate decompositions

Martin Plesch, Časlav Brukner

In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of $2$. It also reduces the total number of cnot gates from ${2}^{n}$ to $\frac{23}{24}{2}^{n}$ in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from $11$ cnot gates to $9$ and the depth from $11$ to $5$ steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

arXiv:1003.5760•Physical Review A•Mar 3, 2011•387 citations

Preparation of the entanglement states by realizing the Hadamard and CNOT quantum gates

Nourallah Ghaeminezhad, Shuang Cong

The preparation of the maximum entangled states, i.e., the Bell states is studied in this paper. The Cartan decomposition and the Lyapunov control methods are used to design the control laws for some operations in realizing the Hadamard and CNOT gates to prepare the Bell states. The numerical simulation experiments show that for some proper control parameters in the designed control laws, the Hadamard and CNOT gates are realized and the stable Bell states are prepared in a short time.

IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)•Mar 1, 2019•1 citation
In this study, we first use a three-qubit system as an example to demonstrate the construction of quantum circuits for the eight maximally entangled basis vectors, subsequently extending the approach to N-qubit systems. We employ a random-number approach to generate maximally entangled basis vectors and their corresponding circuits, while also detailing the required number of single-qubit and CNOT gates. This approach not only provides a solid theoretical foundation but also establishes a practical technique for technological applications, bypassing the difficulty of storing large-scale encoding data.
We show how to construct a multiqubit control gate on a quantum register of an arbitrary size N. This gate performs a single-qubit operation on a specific qubit conditioned by the state of other $N\ensuremath{-}1$ qubits. We provide an algorithm how to build up an array of networks consisting of single-qubit rotations and multiqubit control-NOT (CNOT) gates for the synthesis of an arbitrary entangled quantum state of N qubits. We illustrate the algorithm on a system of cold trapped ions. This example illuminates the efficiency of the direct implementation of the multiqubit CNOT gate compared to its decomposition into a network of two-qubit CNOT gates.
We propose a new quantum dialogue protocol based on non-maximally entangled Bell states. With single-qubit unitary operation, CNOT gate and the Positive Operator Valued Measure (POVM) technology, a quantum dialogue with certain capacity, can be implemented between two users Alice and Bob. This protocol firstly generalizes the quantum dialogue to a more general scenario which uses non-maximally entangled states as the quantum channel. Security analysis shows that our protocol can resist several well-known security issues. Moreover, it is simple and feasible with current techniques, and it demonstrates a good scalability.
In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 222. It also reduces the total number of cnot gates from 2n{2}^{n}2n to 23242n\frac{23}{24}{2}^{n}2423​2n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 111111 cnot gates to 999 and the depth from 111111 to 555 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.