Realization of a General Three-Qubit Quantum Gate
classification
🪐 quant-ph
keywords
cnotgategatesquantumthree-qubitaxesbeatingbound
read the original abstract
We prove that a generic three-qubit quantum logic gate can be implemented using at most 98 one-qubit rotations about the $y$- and $z$-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Cartan-Khaneja-Glaser decomposition of $SU(2^n)$ via involutive automorphisms
Reformulation of Cartan-Khaneja-Glaser decomposition for SU(2^n) via involutive automorphisms and symmetric Lie algebra decompositions yields a stable recursive factorization with open-source Python code validated on ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.