pith. sign in

arxiv: quant-ph/0401178 · v2 · submitted 2004-01-29 · 🪐 quant-ph

Realization of a General Three-Qubit Quantum Gate

classification 🪐 quant-ph
keywords cnotgategatesquantumthree-qubitaxesbeatingbound
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Cartan-Khaneja-Glaser decomposition of $SU(2^n)$ via involutive automorphisms

    quant-ph 2025-09 conditional novelty 6.0

    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 ...