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

Emergence, complexity and computation

The Group Zoo of Classical Reversible Computing and Quantum Computing

Alexis De Vos, Stijn De Baerdemacker

Published Jul 18, 2016• 1 citation
Publisher
DOI
10.1007/978-3-319-33924-5_18

Related papers

A Unified Approach to Quantum Computation and Classical Reversible Computation

Alexis De Vos, Stijn De Baerdemacker

Lecture notes in computer science•Jan 1, 2018•1 citation

Evolution: the quantum computer paradigm

Michel R. P. Planat

Quantum computing has developed with the goal of classically simulating any unitary time evolution. The Clifford group model deals about stabilizing the time evolution of any Pauli operator, the latter accounting for environmental errors and measurements as well. The size of Clifford group increases drastically with the number of qubits, being related to the allowed symmetries of permutation groups. The zoo of subgroups includes: - the well known gate generators (Hadamard, Phase and Controlled NOT), - entangling (dihedral) teleportation groups, and – in the two-qubit case, a maximal subgroup of the large Mathieu groups. The six-fold peculiar symmetry of the two-qubit system corresponds to an outer property which one may associate to quantum entanglement (see M Planat, Clifford quantum computer and the Mathieu groups, 0711.1733 [quant-ph]).

•Jan 21, 2008•0 citations

A Study Of Quantum And Reversible Computing

Arnab Kumar Paul

•Jul 1, 1998•0 citations

Matrix Calculus for Classical and Quantum Circuits

Alexis De Vos, Stijn De Baerdemacker

Quantum computation on w qubits is represented by the infinite unitary group U(2 w ); classical reversible computation on w bits is represented by the finite symmetric group S 2 w . In order to establish the relationship between classical reversible computing and quantum computing, we introduce two Lie subgroups XU( n ) and ZU( n ) of the unitary group U( n ). The former consists of all unitary n × n matrices with all line sums equal to 1; the latter consists of all unitary diagonal n × n matrices with first entry equal to 1. Such a group structure also reveals the relationship between matrix calculus and diagrammatic zx-calculus of quantum circuits.

ACM Journal on Emerging Technologies in Computing Systems•Nov 18, 2014•7 citations

Handbook of Error-Correcting Codes

Victor V. Albert, Philippe Faist

Barcode scans, clear phone calls, reliable data storage, satellite communication, and large-scale quantum computation are all made possible by error correction. We present a handbook version of The Error Correction Zoo, a curated reference of methods for protecting classical or quantum information from errors during storage and transmission. The handbook includes descriptions of these error-correcting codes and a classification according to the symbols they use. It also catalogues relations among codes and related objects such as sphere packings, lattices, designs, groups, and classical and quantum phases of matter. The collection is intended both as a rigorous reference and as a practical aid for tracing the web of code relationships and uncovering new connections.

quant-pharXiv:2606.11484•Jun 11, 2026•8 citations

What's Next in Computing: When Classical & Quantum Computing Meet

Mukesh V. Khare

International Conference on Solid State Devices and Materials (SSDM)•Sep 27, 2022•1 citation
Quantum computing has developed with the goal of classically simulating any unitary time evolution. The Clifford group model deals about stabilizing the time evolution of any Pauli operator, the latter accounting for environmental errors and measurements as well. The size of Clifford group increases drastically with the number of qubits, being related to the allowed symmetries of permutation groups. The zoo of subgroups includes: - the well known gate generators (Hadamard, Phase and Controlled NOT), - entangling (dihedral) teleportation groups, and – in the two-qubit case, a maximal subgroup of the large Mathieu groups. The six-fold peculiar symmetry of the two-qubit system corresponds to an outer property which one may associate to quantum entanglement (see M Planat, Clifford quantum computer and the Mathieu groups, 0711.1733 [quant-ph]).
Quantum computation on w qubits is represented by the infinite unitary group U(2 w ); classical reversible computation on w bits is represented by the finite symmetric group S 2 w . In order to establish the relationship between classical reversible computing and quantum computing, we introduce two Lie subgroups XU( n ) and ZU( n ) of the unitary group U( n ). The former consists of all unitary n × n matrices with all line sums equal to 1; the latter consists of all unitary diagonal n × n matrices with first entry equal to 1. Such a group structure also reveals the relationship between matrix calculus and diagrammatic zx-calculus of quantum circuits.
Barcode scans, clear phone calls, reliable data storage, satellite communication, and large-scale quantum computation are all made possible by error correction. We present a handbook version of The Error Correction Zoo, a curated reference of methods for protecting classical or quantum information from errors during storage and transmission. The handbook includes descriptions of these error-correcting codes and a classification according to the symbols they use. It also catalogues relations among codes and related objects such as sphere packings, lattices, designs, groups, and classical and quantum phases of matter. The collection is intended both as a rigorous reference and as a practical aid for tracing the web of code relationships and uncovering new connections.