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

Strutture Algebriche nella Computazione Quantistica

Maria L. Dalla Chiara, Giuseppe Sergioli

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. We study the basic algebraic properties of this system by introducing the notion of Shi-Abaronov quantum computational structure. Finally, we investigate the possibility of an algebraic abstraction from Hilbert-space structures, by proposing the notion of Toffoli-Hadamard algebra. From an intuitive point of view, such abstract algebras represent a natural quantum generalization of both classical and fuzzy-like structures.

Related papers

A Simple Proof that Toffoli and Hadamard are Quantum Universal

Dorit Aharonov

Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a 'classical' set of gates quantum universal. In this note we give a few lines proof of this fact relying on Kitaev's universal set of gates, and discuss the meaning of the result.

arXiv:quant-ph/0301040•Jan 9, 2003•293 citations

Probability in quantum computation and quantum computational logics: a survey

María Luisa Dalla Chiara, Roberto Giuntini, Giuseppe Sergioli

Quantum computation and quantum computational logics give rise to some non-standard probability spaces that are interesting from a formal point of view. In this framework, events represent quantum pieces of information (qubits, quregisters, mixtures of quregisters), while operations on events are identified with quantum logic gates (which correspond to dynamic reversible quantum processes). We investigate the notion of Shi–Aharonov quantum computational algebra. This structure plays the role for quantum computation that is played by σ-complete Boolean algebras in classical probability theory.

Mathematical Structures in Computer Science•Mar 28, 2014•5 citations

The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality

Patrick Roy, John van de Wetering, Lia Yeh

We introduce the qudit ZH-calculus and show how to generalise the phase-free qubit rules to qudits.We prove that for prime dimensions d, the phase-free qudit ZH-calculus is universal for matrices over the ring Z[e 2πi/d ].For qubits, there is a strong connection between phase-free ZH-diagrams and Toffoli+Hadamard circuits, a computationally universal fragment of quantum circuits.We generalise this connection to qudits, by finding that the two-qudit |0 -controlled X gate can be used to construct all classical reversible qudit logic circuits in any odd qudit dimension, which for qubits requires the three-qubit Toffoli gate.We prove that our construction is asymptotically optimal up to a logarithmic term.Twenty years after the celebrated result by Shi proving universality of Toffoli+Hadamard for qubits, we prove that circuits of |0 -controlled X and Hadamard gates are approximately universal for qudit quantum computing for any odd prime d, and moreover that phase-free ZH-diagrams correspond precisely to such circuits allowing postselections.

arXiv:2307.10095•Electronic Proceedings in Theoretical Computer Science•Aug 23, 2023•15 citations

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

Algebraic and Mathematical Foundations of Quantum Computation: Hilbert Spaces, Group Structures, and Quantum Algorithms

Bhavesh B. Prajapati

Quantum computation is, at bottom, a branch of applied algebra and functional analysis: the state of a quantum register is a unit vector in a finite-dimensional complex Hilbert space, computation is the action of the unitary group on that space, and the structure of the most important quantum algorithms is dictated by the representation theory of finite and continuous groups. This paper develops the mathematical scaffolding of the field from first principles and uses it to explain why quantum computers can outperform classical ones. We review complex inner-product spaces, self-adjoint and unitary operators, the spectral theorem, and the tensor-product construction that gives rise to entanglement and the exponential dimension of the state space. We then describe the qubit and its geometry, the group-theoretic classification of quantum gates (the special unitary groups, the Pauli and Clifford groups, and their Lie-algebraic generators), and the universality results that justify finite gate sets together with the Solovay–Kitaev theorem. With this apparatus we analyse the quantum Fourier transform, phase estimation, and the hidden subgroup problem, showing how Shor’s factoring algorithm, Grover’s search, and the quantum linear-systems algorithm arise as instances of a small number of algebraic templates. Finally we treat the stabilizer formalism of quantum error correction—where finite abelian groups over GF(2) play the central role—and the variational, near-term (NISQ) algorithms that dominate current practice. Throughout, the emphasis is on the algebraic invariants that make quantum speed-ups possible.

Communications on Applied Nonlinear Analysis•Jan 24, 2025•0 citations

Completeness of the ZH-calculus

Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell +2 more

There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus, a graphical language for a class of string diagrams describing linear maps between qubits. The ZX-calculus has proven useful in a variety of areas of quantum information, but is less suitable for reasoning about operations outside its natural gate set such as multi-linear Boolean operations like the Toffoli gate. In this paper we study the ZH-calculus, an alternative graphical language of string diagrams that does allow straightforward encoding of Toffoli gates and other more complicated Boolean logic circuits. We find a set of simple rewrite rules for this calculus and show it is complete with respect to matrices over Z[12] , which correspond to the approximately universal Toffoli+Hadamard gateset. Furthermore, we construct an extended version of the ZH-calculus that is complete with respect to matrices over any ring R where 1+1 is not a zero-divisor.

arXiv:2103.06610•Compositionality•Jul 12, 2023•22 citations
Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. We study the basic algebraic properties of this system by introducing the notion of Shi-Abaronov quantum computational structure. Finally, we investigate the possibility of an algebraic abstraction from Hilbert-space structures, by proposing the notion of Toffoli-Hadamard algebra. From an intuitive point of view, such abstract algebras represent a natural quantum generalization of both classical and fuzzy-like structures.
Quantum computation and quantum computational logics give rise to some non-standard probability spaces that are interesting from a formal point of view. In this framework, events represent quantum pieces of information (qubits, quregisters, mixtures of quregisters), while operations on events are identified with quantum logic gates (which correspond to dynamic reversible quantum processes). We investigate the notion of Shi–Aharonov quantum computational algebra. This structure plays the role for quantum computation that is played by σ-complete Boolean algebras in classical probability theory.
We introduce the qudit ZH-calculus and show how to generalise the phase-free qubit rules to qudits.We prove that for prime dimensions d, the phase-free qudit ZH-calculus is universal for matrices over the ring Z[e 2πi/d ].For qubits, there is a strong connection between phase-free ZH-diagrams and Toffoli+Hadamard circuits, a computationally universal fragment of quantum circuits.We generalise this connection to qudits, by finding that the two-qudit |0 -controlled X gate can be used to construct all classical reversible qudit logic circuits in any odd qudit dimension, which for qubits requires the three-qubit Toffoli gate.We prove that our construction is asymptotically optimal up to a logarithmic term.Twenty years after the celebrated result by Shi proving universality of Toffoli+Hadamard for qubits, we prove that circuits of |0 -controlled X and Hadamard gates are approximately universal for qudit quantum computing for any odd prime d, and moreover that phase-free ZH-diagrams correspond precisely to such circuits allowing postselections.
Quantum computation is, at bottom, a branch of applied algebra and functional analysis: the state of a quantum register is a unit vector in a finite-dimensional complex Hilbert space, computation is the action of the unitary group on that space, and the structure of the most important quantum algorithms is dictated by the representation theory of finite and continuous groups. This paper develops the mathematical scaffolding of the field from first principles and uses it to explain why quantum computers can outperform classical ones. We review complex inner-product spaces, self-adjoint and unitary operators, the spectral theorem, and the tensor-product construction that gives rise to entanglement and the exponential dimension of the state space. We then describe the qubit and its geometry, the group-theoretic classification of quantum gates (the special unitary groups, the Pauli and Clifford groups, and their Lie-algebraic generators), and the universality results that justify finite gate sets together with the Solovay–Kitaev theorem. With this apparatus we analyse the quantum Fourier transform, phase estimation, and the hidden subgroup problem, showing how Shor’s factoring algorithm, Grover’s search, and the quantum linear-systems algorithm arise as instances of a small number of algebraic templates. Finally we treat the stabilizer formalism of quantum error correction—where finite abelian groups over GF(2) play the central role—and the variational, near-term (NISQ) algorithms that dominate current practice. Throughout, the emphasis is on the algebraic invariants that make quantum speed-ups possible.
There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus, a graphical language for a class of string diagrams describing linear maps between qubits. The ZX-calculus has proven useful in a variety of areas of quantum information, but is less suitable for reasoning about operations outside its natural gate set such as multi-linear Boolean operations like the Toffoli gate. In this paper we study the ZH-calculus, an alternative graphical language of string diagrams that does allow straightforward encoding of Toffoli gates and other more complicated Boolean logic circuits. We find a set of simple rewrite rules for this calculus and show it is complete with respect to matrices over Z[12] , which correspond to the approximately universal Toffoli+Hadamard gateset. Furthermore, we construct an extended version of the ZH-calculus that is complete with respect to matrices over any ring R where 1+1 is not a zero-divisor.