constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
quantum algorithms:
In quantum computing and quantum information theory, the controlled Z gates are controlled quantum gate versions of the Z gate.
Where the Z gate acts on a single qbit, being the unitary operator
the -controlled Z gates for are the unitary operators on the tensor product of qbits given by
where .
(cf. Beverland, Campbell, Howard & Kliuchnikov 2020).
Since the exponential expression in (1) is
we equivalently have:
(cf. Gühne et al. 2014 (1)).
The CCZ quantum gate is the doubly-controlled form of the Pauli -gate, which plays a role as a non-Clifford gate alternative to the T-gate in the discussion of Takagi, Yoder & Chuang 2017.
O. Gühne, M. Cuquet, F.E.S. Steinhoff, T. Moroder, M. Rossi, D. Bruß, B. Kraus, C. Macchiavello; eq (1) in: Entanglement and nonclassical properties of hypergraph states, J. Phys. A: Math. Theor. 47 (2014) 335303 [doi:10.1088/1751-8113/47/33/335303, arXiv:1404.6492]
Ryuji Takagi, Theodore J. Yoder, Isaac L. Chuang: Error rates and resource overheads of encoded three-qubit gates, Phys. Rev. A 96 (2017) 042302 [arXiv:10.1103/PhysRevA.96.042302, arXiv:1707.00012]
Michael Beverland, Earl Campbell, Mark Howard, Vadym Kliuchnikov; §4.1 of: Lower bounds on the non-Clifford resources for quantum computations, Quantum Sci. Technol. 5 (2020) 035009 [doi:10.1088/2058-9565/ab8963, arXiv:1904.01124]
Last revised on October 10, 2026 at 12:10:29. See the history of this page for a list of all contributions to it.