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 circuits of c − Z and SWAP gates optimization and entanglement

Marc Bataille, Jean-Gabriel Luque

Published Jan 18, 2019• 0 citations
OpenAlex

Abstract

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.

Related papers

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

Bataille, Marc, 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.

arXiv:1810.01769•Oct 2, 2018•4 citations

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.

Journal of Physics A Mathematical and Theoretical•Jun 26, 2019•4 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•10 citations

Maximally entangling states and dynamics in one dimensional nearest neighbor Floquet systems

David E Berenstein, Daniel Teixeira

We describe conditions for generating entanglement between two regions at the optimal rate in a class of one-dimensional quantum circuits with Floquet dynamics. The optimal value follows from subadditivity and Araki-Lieb inequalities. A quantum circuit composed of parallel SWAP gates that act periodically on entangled pairs is a simple system that saturates the bound. We show that any other system that entangles at this maximal rate must act as a generalized SWAP gate dynamics on the relevant states of the Hilbert space. We further discuss some characterizations of states according to entropy generation. States with multipartite entanglement generically fail to entangle efficiently as time evolves. This suggests that chaos, which tend to produce such entanglement patterns, is expected to work against the process of spreading information efficiently. It also provides a simple intuition for why the entangling tsunami velocity must be slower than the Lieb-Robinson velocity.

arXiv:1901.02944•Jan 9, 2019•2 citations

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

Marc Bataille

Quantum Information Processing•Jul 29, 2022•29 citations

Logical Structures Underlying Quantum Computing

Federico Holik, Giuseppe Sergioli, Hector Freytes +1 more

In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.

arXiv:1811.06808•Entropy•Jan 16, 2019•6 citations
We have studied the algebraic structure underlying the quantum circuits composed by \cZ\cZ\cZ and \Swap\Swap\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.
We describe conditions for generating entanglement between two regions at the optimal rate in a class of one-dimensional quantum circuits with Floquet dynamics. The optimal value follows from subadditivity and Araki-Lieb inequalities. A quantum circuit composed of parallel SWAP gates that act periodically on entangled pairs is a simple system that saturates the bound. We show that any other system that entangles at this maximal rate must act as a generalized SWAP gate dynamics on the relevant states of the Hilbert space. We further discuss some characterizations of states according to entropy generation. States with multipartite entanglement generically fail to entangle efficiently as time evolves. This suggests that chaos, which tend to produce such entanglement patterns, is expected to work against the process of spreading information efficiently. It also provides a simple intuition for why the entangling tsunami velocity must be slower than the Lieb-Robinson velocity.
Quantum circuits of CNOT\texttt {CNOT}CNOT gates: optimization and entanglement