Related papers: Unitary reflection groups for quantum fault tolera…
We use our Clifford algebra technique, that is nilpotents and projectors which are binomials of the Clifford algebra objects $\gamma^a$ with the property $\{\gamma^a,\gamma^b\}_+ = 2 \eta^{ab}$, for representing quantum gates and quantum…
Errors in the control of quantum systems may be classified as unitary, decoherent and incoherent. Unitary errors are systematic, and result in a density matrix that differs from the desired one by a unitary operation. Decoherent errors…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
Quantum key distribution (QKD) promises provably secure cryptography, even to attacks from an all-powerful adversary. However, with quantum computing development lagging behind QKD, the assumption that there exists an adversary equipped…
We give a fault tolerant construction for error correction and computation using two punctured quantum Reed-Muller (PQRM) codes. In particular, we consider the $[[127,1,15]]$ self-dual doubly-even code that has transversal Clifford gates…
This contribution to the Proceedings of the Workshop on Integrable Theories, Solitons and Duality in Sao Paulo in July 2002 summarizes results from the papers hep-th/0112023 and math.QA/0208043. We derive the non-local conserved charges in…
Recent advances in quantum error-correction (QEC) have shown that it is often beneficial to understand fault-tolerance as a dynamical process, a circuit with redundant measurements that help correct errors, rather than as a static code…
We take initial steps towards a general framework for constructing logical gates in general quantum CSS codes. Viewing CSS codes as cochain complexes, we observe that cohomology invariants naturally give rise to diagonal logical gates. We…
Optical continuous-variable cluster states (CVCSs) in combination with Gottesman-Kitaev-Preskill~(GKP) qubits enable fault-tolerant quantum computation so long as these resources are of high enough quality. Previous studies concluded that a…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
The first part of this thesis deals with certain properties of the quantum symmetric and exterior algebras of Type 1 representations of $U_q(g)$ defined by Berenstein and Zwicknagl. We define a notion of a commutative algebra object in a…
As quantum computing advances toward the late-NISQ and early fault-tolerant eras, scalable and platform-independent benchmarks are essential for quantifying computational capacity in a classically verifiable manner. We introduce two…
Quantum groups in general and the quantum Anti-de Sitter group $U_q(so(2,3))$ in particular are studied from the point of view of quantum field theory. We show that if $q$ is a suitable root of unity, there exist finite-dimensional, unitary…
It is a well known fact from the group theory that irreducible tensor representations of classical groups are suitably characterized by irreducible representations of the symmetric groups. However, due to their different nature, vector and…
We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…
The exceptional Lie group E8 plays a prominent role in both mathematics and theoretical physics. It is the largest symmetry group associated with the most general possible normed division algebra, namely, that of the non-associative real…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
A major challenge in developing quantum computing technologies is to accomplish high precision tasks by utilizing multiplex optimization approaches, on both the physical system and algorithm levels. Loss functions assessing the overall…
We analyse a model for fault-tolerant quantum computation with low overhead suitable for situations where the noise is biased. The basis for this scheme is a gadget for the fault-tolerant preparation of magic states that enable universal…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…