Quantum circuits of CNOT gates
arXiv:2009.13247
Abstract
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 comment40 pages, 19 figures
References in corpus (17)
- Three qubits can be entangled in two inequivalent ways
- Quantum secret sharing
- How to share a quantum secret
- Advances in Quantum Teleportation
- Teleportation of Quantum States
- Four qubits can be entangled in nine different ways
- Experimental Comparison of Two Quantum Computing Architectures
- Benchmarking an 11-qubit quantum computer
- Scalable gate architecture for densely packed semiconductor spin qubits
- Classification of multipartite entangled states by multidimensional determinants
- How entangled can two couples get?
- The polynomial invariants of four qubits
- Coherent states, entanglement, and geometric invariant theory
- Entanglement of four qubit systems: a geometric atlas with polynomial compass I (the finite world)
- Proof of the Gour-Wallach conjecture
- Quantum circuits of c -- Z and SWAP gates optimization and entanglement
- Multipartite Entanglement under Stochastic Local Operations and Classical Communication