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

Quantum Information Processing

Quantum circuits of $$\texttt {CNOT}$$ gates: optimization and entanglement

Marc Bataille

Published Jul 29, 2022• 41 citations
Publisher
DOI
10.1007/s11128-022-03577-8

Related papers

Quantum circuits of c − Z and S W A P gates: optimization and entanglement

Marc Bataille, Jean-Gabriel Luque

Abstract We study the algebraic structure underlying the quantum circuits composed by and gates. Our results are applied to optimize the circuits and to understand the emergence of entanglement when a circuit acts on a fully factorized state.

arXiv:1810.01769•Journal of Physics A Mathematical and Theoretical•Jun 26, 2019•9 citations

QUANTUM CIRCUIT OPTIMIZATION (FOR 3 QUBITS)

International Journal of Advance Engineering and Research Development•Jun 30, 2015•0 citations

Quantum circuits of c − Z and SWAP gates optimization and entanglement

Marc Bataille, Jean-Gabriel Luque

We have studied the algebraic structure underlying the quantum circuits composed by $\cZ$ and $\Swap$ gates. Our results are applied to optimize the circuits and to understand the emergence of entanglement when a circuit acts on a fully factorized state.

•Jan 18, 2019•0 citations

Quantum gates and quantum circuits

Anirban Pathak

CRC Press eBooks•Jun 20, 2013•0 citations

Optimized Synthesis of Circuits for Diagonal Unitary Matrices with Reflection Symmetry

Xinchi Huang, Taichi Kosugi, Hirofumi Nishi +1 more

During the noisy intermediate-scale quantum (NISQ) era, it is important to optimize the quantum circuits in circuit depth and gate count, especially entanglement gates, including the CNOT gate. Among all the unitary operators, diagonal unitary matrices form a special class that plays a crucial role in many quantum algorithms/subroutines. Based on a natural gate set {CNOT, Rz}, quantum circuits for general diagonal unitary matrices were discussed in several previous works, and an optimal synthesis algorithm was proposed in terms of circuit depth. In this paper, we are interested in the implementation of diagonal unitary matrices with reflection symmetry, which has promising applications, including the realization of real-time evolution for first quantized Hamiltonians by quantum circuits. Owing to such a symmetric property, we show that the quantum circuit in the existing work can be further simplified and propose a constructive algorithm that optimizes the entanglement gate count. Compared to the previous synthesis methods for general diagonal unitary matrices, the quantum circuit by our proposed algorithm achieves nearly half the reduction in both the gate count and circuit depth.

arXiv:2310.06676•Journal of the Physical Society of Japan•Apr 11, 2024•4 citations

Quantum Gates and Circuits

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•3 citations
Quantum circuits of CNOT\texttt {CNOT}CNOT gates: optimization and entanglement
During the noisy intermediate-scale quantum (NISQ) era, it is important to optimize the quantum circuits in circuit depth and gate count, especially entanglement gates, including the CNOT gate. Among all the unitary operators, diagonal unitary matrices form a special class that plays a crucial role in many quantum algorithms/subroutines. Based on a natural gate set {CNOT, Rz}, quantum circuits for general diagonal unitary matrices were discussed in several previous works, and an optimal synthesis algorithm was proposed in terms of circuit depth. In this paper, we are interested in the implementation of diagonal unitary matrices with reflection symmetry, which has promising applications, including the realization of real-time evolution for first quantized Hamiltonians by quantum circuits. Owing to such a symmetric property, we show that the quantum circuit in the existing work can be further simplified and propose a constructive algorithm that optimizes the entanglement gate count. Compared to the previous synthesis methods for general diagonal unitary matrices, the quantum circuit by our proposed algorithm achieves nearly half the reduction in both the gate count and circuit depth.