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 Information Processing

Toffoli gate and quantum correlations: a geometrical approach

Federico Holik, Giuseppe Sergioli, Héctor Freytes, Roberto Giuntini, Angelo Plastino

Published Jan 18, 2017• 6 citations
Publisher
DOI
10.1007/s11128-016-1509-3

Related papers

Geometry of quantum correlations

Marek Kuś

•Sep 1, 2014•1 citation

Elementary gates for cartoon computation

Marek Czachor

The basic one-bit gates ( X , Y , Z , Hadamard, phase, π/8) as well as the controlled CNOT and Toffoli gates are reformulated in the language of geometric-algebra quantum-like computation. Thus, all the quantum algorithms can be reformulated in purely geometric terms without any need of tensor products.

arXiv:0706.0967•Journal of Physics A Mathematical and Theoretical•Jul 19, 2007•10 citations

Practical Guide to Quantum Computing: CCX Gate (Toffoli Gate)

Mikhail Pavlov

The CCX gate (Toffoli gate) is a three-qubit quantum gate that flips the target qubit if and only if both control qubits are in the ∣1⟩|1\rangle∣1⟩ state. It is a key operator for implementing conditional logic in quantum circuits, enabling the construction of complex computational structures. The Toffoli gate is widely used in reversible computing and as a fundamental component in quantum algorithms for search, optimization, and error correction. Its ability to implement multi-qubit conditional operations makes it indispensable for designing intricate quantum circuits and realizing advanced algorithmic logic on platforms such as IBM Q. Understanding the CCX gate is essential for building practical, scalable quantum computation architectures.

•Mar 4, 2026•0 citations

Efficient Toffoli Gate in Circuit Quantum Electrodynamics

Matthew Reed, L. DiCarlo, Luyan Sun +2 more

Bulletin of the American Physical Society•Mar 21, 2011•0 citations

The Toffoli-Hadamard Gate System: an Algebraic Approach

M. L. Dalla Chiara, Antonio Ledda, Giuseppe Sergioli +1 more

Journal of Philosophical Logic•Apr 5, 2013•4 citations

A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits

Matthew Amy, Neil J. Ross, Scott Wesley

We give a sound and complete equational theory for 3-qubit quantum circuits over the Toffoli-Hadamard gate set { X, CX, CCX, H }. That is, we introduce a collection of true equations among Toffoli-Hadamard circuits on three qubits that is sufficient to derive any other true equation between such circuits. To obtain this equational theory, we first consider circuits over the Toffoli-K gate set { X, CX, CCX, K }, where K = HxH. The Toffoli-Hadamard and Toffoli-K gate sets appear similar, but they are crucially different on exactly three qubits. Indeed, in this case, the former generates an infinite group of operators, while the latter generates the finite group of automorphisms of the well-known E8 lattice. We take advantage of this fact, and of the theory of automorphism groups of lattices, to obtain a sound and complete collection of equations for Toffoli-K circuits. We then extend this equational theory to one for Toffoli-Hadamard circuits by leveraging prior work of Li et al. on Toffoli-Hadamard operators.

arXiv:2407.11152•Electronic Proceedings in Theoretical Computer Science•Aug 9, 2024•0 citations
The CCX gate (Toffoli gate) is a three-qubit quantum gate that flips the target qubit if and only if both control qubits are in the ∣1⟩|1\rangle∣1⟩ state. It is a key operator for implementing conditional logic in quantum circuits, enabling the construction of complex computational structures. The Toffoli gate is widely used in reversible computing and as a fundamental component in quantum algorithms for search, optimization, and error correction. Its ability to implement multi-qubit conditional operations makes it indispensable for designing intricate quantum circuits and realizing advanced algorithmic logic on platforms such as IBM Q. Understanding the CCX gate is essential for building practical, scalable quantum computation architectures.
We give a sound and complete equational theory for 3-qubit quantum circuits over the Toffoli-Hadamard gate set { X, CX, CCX, H }. That is, we introduce a collection of true equations among Toffoli-Hadamard circuits on three qubits that is sufficient to derive any other true equation between such circuits. To obtain this equational theory, we first consider circuits over the Toffoli-K gate set { X, CX, CCX, K }, where K = HxH. The Toffoli-Hadamard and Toffoli-K gate sets appear similar, but they are crucially different on exactly three qubits. Indeed, in this case, the former generates an infinite group of operators, while the latter generates the finite group of automorphisms of the well-known E8 lattice. We take advantage of this fact, and of the theory of automorphism groups of lattices, to obtain a sound and complete collection of equations for Toffoli-K circuits. We then extend this equational theory to one for Toffoli-Hadamard circuits by leveraging prior work of Li et al. on Toffoli-Hadamard operators.