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

On Quantum Codes and Networks

Colin Wilmott

Published Jan 1, 2009• 1 citation
OpenAlex

Abstract

The concern of quantum computation is the computation of\nquantum phenomena as observed in Nature. A prerequisite for the\nattainment of such computation is a set of unitary\ntransformations that describe the operational process within\nthe quantum system. Since operational transformations\ninevitably interact with elements outside of the quantum\nsystem, we therefore have quantum gate evolutions determined\nwith less than absolute precision. Consequently, the theory of\nquantum error-correction has developed to meet this difficulty.\nFurther, it is increasingly evident that much effort is being\nmade into finding efficient quantum circuits in the sense that\nfor a library of realisable quantum gates there is no smaller\ncircuit that achieves the same task with the same library of\ngates. A reason for this concerted effort is primarily due to\nthe principle of decoherence. I give the construction for the\nset of unitary transformations that describe an error model\nthat acts on a d-dimensional quantum system. I also give an\noverview of the theoretical framework associated with such\nunitary transformations and generalise results to cater for\nd-dimensional quantum states. I introduce two quantum gate\nconstructions that generalise the qubit SWAP gate to higher\ndimensions. The first of these constructions is the WilNOT gate\nand the second is an efficient design also based on binomial\nsummations. Both of these constructions yield a quantum qudit\nSWAP gate determined only in the CNOT gate. Furthermore, the\ntask of constructing generalised SWAP gates based on\ntranspositions of qudit states is argued in terms of the\nsignature of a permutation. Based on this argument, we show\nthat circuit architectures completely described by instances of\nthe CNOT gate cannot implement a transposition of a pair of\nqudits over dimensions d = 3 mod 4. Consequently, our quantum\ncircuits are of interest because it is not possible to\nimplement a SWAP of qutrits by a sequence of transpositions of\nqutrits if only CNOT gates are used. I also give bounds on\nnumbers of quantum codes predicated on d-dimensional quantum\nsystems, and generalise the encoding and decoding architectures\nfor qudit codes.\n

Related papers

On Binomial Summations and a Generalised Quantum SWAP Gate

Colin Wilmott, Peter Wild

We give a quantum gate construction - composed entirely from incidents of the CNOT gate - that generalises the qubit SWAP gate to higher dimensions. This new construction is more regular than and is an improvement on the WilNOT quantum gate construction.

arXiv:0811.1879•Nov 12, 2008•0 citations

On interchanging the states of a pair of qudits

Colin Wilmott, Peter Wild

The qubit SWAP gate has been shown to be an integral component of quantum circuitry design. It permutes the states of two qubits and allows for the storage quantum information, teleportation of atomic or ionic states, and is a fundamental element in the circuit implementation of Shor's algorithm. We consider the problem of generalising the SWAP gate beyond the qubit setting. We show that quantum circuit architectures completely described by instances of the CNOT gate can not implement a transposition of a pair of qudits for dimensions $d \equiv 3 (mod 4)$. The task of constructing generalised SWAP gates based on transpositions of qudit states is argued in terms of the signature of a permutation.

arXiv:0811.1545•Nov 10, 2008•3 citations

Models of fault-tolerant quantum computation

Christopher M. Dawson

This thesis is concerned with certain theoretical problems that arise naturally in the context of fault-tolerant quantum computation. Fault-tolerance can be defined as the art of building reliable devices from unreliable components, and is of particular importance for quantum computers that aim to precisely control the dynamics of extremely sensitive quantum systems. A model of quantum computation is a specification of the basic building blocks by which a quantum computation is implemented. The best known model is the quantum circuit model, where computations are implemented by means of unitary quantum gates that are applied to two-level quantum systems known as qubits. In a physical implementation of a quantum circuit, the gates and qubits will inevitably be affected by noise. Fault-tolerant quantum circuits are designed to be resilient against the effects of this noise, provided that it is not too strong. Fault-tolerance in the quantum circuit model is well developed thanks to the theory of quantum error-correcting codes. These codes allow for the correction of small numbers of errors introduced by a variety of noise processes. In a fault-tolerant quantum circuit, qubits are replaced with encoded qubits, and quantum gates with encoded gates that are immediately followed by special quantum circuits for error correction. Provided the rate at which errors occur is below a constant threshold value, the accumulation of errors can be checked so that the correct output of the computation correctly determined. The threshold acts as both a measure of how good the design of a quantum circuit is, and also as a target for experimenters aiming to implement quantum circuits. Much current research in quantum computation is aimed at designing quantum circuits that increase the noise threshold, hopefully to the point where it becomes within the reach of experimenters. A fault-tolerant encoded quantum gate must limit the propagation of errors so that the code’s corrective capabilities are not overwhelmed. It is not so easy to design encoded gates that satisfy this property, and to date only a finite handful of such gates are known. In a faulttolerant quantum circuit, all quantum gates must be decomposed or compiled in terms of those that may be implemented fault-tolerantly. In the first part of this thesis, we present two results that may be applied to this problem of gate compilation. The first is a generic method based on the Solovay-Kitaev theorem that may be applied to all quantum gates, but is most effective for those that act on single qubits. We present the Solovay-Kitaev theorem in its simples known form as an algorithm, together with novel constructions that can be used to implement it. Following this we give a two specialized methods for two-qubit gate decomposition, based on the Cartan decomposition of the Lie group SU(4). The cluster-state model of computation is an alternative to the quantum circuit model, and makes use of quantum measurements and highly entangled cluster-states to implement a quantum computation. The fault-tolerant techniques developed for quantum circuits are not immediately applicable in this model, so in order for it to be a realistic candidate for performing computations we prove that such techniques are possible. In the second part of the thesis we prove that constant fault-tolerance thresholds may be achieved in the cluster-state model, and in particular in an adaption to an optical implementation. Following this we design a complete error correction scheme for optical cluster-state computation, and numerically determine the threshold of this model in the face of the dominant noise models likely to affect such an implementation.

•Jan 1, 2006•0 citations

A generalized quantum SWAP gate

Colin Wilmott

The SWAP gate plays a central role in network designs for qubit quantum computation. However, there is a view to generalize qubit quantum computing to higher dimensional quantum systems. In this paper we construct a generalized SWAP gate using only instances of the generalized controlled-NOT gate to cyclically permute the states of $d$ qudits for $d$ prime.

arXiv:0811.1684•Nov 11, 2008•2 citations

Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform

Francesco Pudda, Mario Chizzini, Crippa, Luca

Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels $d$, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary $d$, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.

arXiv:2410.05122•Oct 7, 2024•17 citations

Quantum error correction and quantum computation

G. Alber, A. Delgado, M. Mussinger

In order to stabilize quantum algorithms against decoherence one has to fulfill two requirements. Firstly, one has to develop an appropriate quantum error correcting code. Secondly, one has to find a set of suitable unitary quantum transformations acting on the physical qubits which preserve the properties of this error correcting quantum code and which allow the implementation of a universal set of quantum gates. This is a challenging task in particular if we restrict ourselves to a limited class of two-particle interactions by which the physical qubits can be controlled. For the special cases of four and six physical qubits we discuss a set of such quantum gates which satisfy these two conditions for the recently developed detected-jump correcting quantum codes [1]. These quantum codes are capable of stabilizing distinguishable qubits against decoherence arising from spontaneous decay processes.

Laser Physics•Jan 1, 2002•0 citations
The concern of quantum computation is the computation of\nquantum phenomena as observed in Nature. A prerequisite for the\nattainment of such computation is a set of unitary\ntransformations that describe the operational process within\nthe quantum system. Since operational transformations\ninevitably interact with elements outside of the quantum\nsystem, we therefore have quantum gate evolutions determined\nwith less than absolute precision. Consequently, the theory of\nquantum error-correction has developed to meet this difficulty.\nFurther, it is increasingly evident that much effort is being\nmade into finding efficient quantum circuits in the sense that\nfor a library of realisable quantum gates there is no smaller\ncircuit that achieves the same task with the same library of\ngates. A reason for this concerted effort is primarily due to\nthe principle of decoherence. I give the construction for the\nset of unitary transformations that describe an error model\nthat acts on a d-dimensional quantum system. I also give an\noverview of the theoretical framework associated with such\nunitary transformations and generalise results to cater for\nd-dimensional quantum states. I introduce two quantum gate\nconstructions that generalise the qubit SWAP gate to higher\ndimensions. The first of these constructions is the WilNOT gate\nand the second is an efficient design also based on binomial\nsummations. Both of these constructions yield a quantum qudit\nSWAP gate determined only in the CNOT gate. Furthermore, the\ntask of constructing generalised SWAP gates based on\ntranspositions of qudit states is argued in terms of the\nsignature of a permutation. Based on this argument, we show\nthat circuit architectures completely described by instances of\nthe CNOT gate cannot implement a transposition of a pair of\nqudits over dimensions d = 3 mod 4. Consequently, our quantum\ncircuits are of interest because it is not possible to\nimplement a SWAP of qutrits by a sequence of transpositions of\nqutrits if only CNOT gates are used. I also give bounds on\nnumbers of quantum codes predicated on d-dimensional quantum\nsystems, and generalise the encoding and decoding architectures\nfor qudit codes.\n
The qubit SWAP gate has been shown to be an integral component of quantum circuitry design. It permutes the states of two qubits and allows for the storage quantum information, teleportation of atomic or ionic states, and is a fundamental element in the circuit implementation of Shor's algorithm. We consider the problem of generalising the SWAP gate beyond the qubit setting. We show that quantum circuit architectures completely described by instances of the CNOT gate can not implement a transposition of a pair of qudits for dimensions d≡3(mod4)d \equiv 3 (mod 4)d≡3(mod4). The task of constructing generalised SWAP gates based on transpositions of qudit states is argued in terms of the signature of a permutation.
This thesis is concerned with certain theoretical problems that arise naturally in the context of fault-tolerant quantum computation. Fault-tolerance can be defined as the art of building reliable devices from unreliable components, and is of particular importance for quantum computers that aim to precisely control the dynamics of extremely sensitive quantum systems. A model of quantum computation is a specification of the basic building blocks by which a quantum computation is implemented. The best known model is the quantum circuit model, where computations are implemented by means of unitary quantum gates that are applied to two-level quantum systems known as qubits. In a physical implementation of a quantum circuit, the gates and qubits will inevitably be affected by noise. Fault-tolerant quantum circuits are designed to be resilient against the effects of this noise, provided that it is not too strong. Fault-tolerance in the quantum circuit model is well developed thanks to the theory of quantum error-correcting codes. These codes allow for the correction of small numbers of errors introduced by a variety of noise processes. In a fault-tolerant quantum circuit, qubits are replaced with encoded qubits, and quantum gates with encoded gates that are immediately followed by special quantum circuits for error correction. Provided the rate at which errors occur is below a constant threshold value, the accumulation of errors can be checked so that the correct output of the computation correctly determined. The threshold acts as both a measure of how good the design of a quantum circuit is, and also as a target for experimenters aiming to implement quantum circuits. Much current research in quantum computation is aimed at designing quantum circuits that increase the noise threshold, hopefully to the point where it becomes within the reach of experimenters. A fault-tolerant encoded quantum gate must limit the propagation of errors so that the code’s corrective capabilities are not overwhelmed. It is not so easy to design encoded gates that satisfy this property, and to date only a finite handful of such gates are known. In a faulttolerant quantum circuit, all quantum gates must be decomposed or compiled in terms of those that may be implemented fault-tolerantly. In the first part of this thesis, we present two results that may be applied to this problem of gate compilation. The first is a generic method based on the Solovay-Kitaev theorem that may be applied to all quantum gates, but is most effective for those that act on single qubits. We present the Solovay-Kitaev theorem in its simples known form as an algorithm, together with novel constructions that can be used to implement it. Following this we give a two specialized methods for two-qubit gate decomposition, based on the Cartan decomposition of the Lie group SU(4). The cluster-state model of computation is an alternative to the quantum circuit model, and makes use of quantum measurements and highly entangled cluster-states to implement a quantum computation. The fault-tolerant techniques developed for quantum circuits are not immediately applicable in this model, so in order for it to be a realistic candidate for performing computations we prove that such techniques are possible. In the second part of the thesis we prove that constant fault-tolerance thresholds may be achieved in the cluster-state model, and in particular in an adaption to an optical implementation. Following this we design a complete error correction scheme for optical cluster-state computation, and numerically determine the threshold of this model in the face of the dominant noise models likely to affect such an implementation.
The SWAP gate plays a central role in network designs for qubit quantum computation. However, there is a view to generalize qubit quantum computing to higher dimensional quantum systems. In this paper we construct a generalized SWAP gate using only instances of the generalized controlled-NOT gate to cyclically permute the states of ddd qudits for ddd prime.
Quantum computing with qudits, quantum systems with d>2d > 2d>2 levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels ddd, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary ddd, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.
In order to stabilize quantum algorithms against decoherence one has to fulfill two requirements. Firstly, one has to develop an appropriate quantum error correcting code. Secondly, one has to find a set of suitable unitary quantum transformations acting on the physical qubits which preserve the properties of this error correcting quantum code and which allow the implementation of a universal set of quantum gates. This is a challenging task in particular if we restrict ourselves to a limited class of two-particle interactions by which the physical qubits can be controlled. For the special cases of four and six physical qubits we discuss a set of such quantum gates which satisfy these two conditions for the recently developed detected-jump correcting quantum codes [1]. These quantum codes are capable of stabilizing distinguishable qubits against decoherence arising from spontaneous decay processes.