Related papers: Diagonal gates in the Clifford hierarchy

In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with…

There have been significant recent advances in constructing theoretical and practical quantum error correcting codes that function well as quantum memories; however, performing fault-tolerant logical gates on these codes is less studied,…

Second-order ordinary linear differential equations appear ubiquitously across physics, describing the behavior of systems from the quantum world of atoms to the classical world of gravitating bodies. We present a unified symmetry-based…

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…

Farinholt gives a characterization of Clifford operators for qudits; d both odd and even. In this comment it is shown that the necessary gates for the construction of Clifford operators; N both odd and even, are obtained directly from…

We give an algebraic formulation based on Clifford algebras and algebraic spinors for quantum information. In this context, logic gates and concepts such as chirality, charge conjugation, parity and time reversal are introduced and explored…

Checking whether two quantum circuits are equivalent is important for the design and optimization of quantum-computer applications with real-world devices. We consider quantum circuits consisting of Clifford gates, a practically-relevant…

In this paper, we define and study Clifford quadratic complete intersections. After showing some properties of Clifford quantum polynomial algebras, we show that there is a natural one-to-one correspondence between Clifford quadratic…

The Gottesman-Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. This theorem hinges on the fact that Clifford gates map Pauli strings to other Pauli strings, thereby…

Instead of a quantum computer where the fundamental units are 2-dimensional qubits, we can consider a quantum computer made up of d-dimensional systems. There is a straightforward generalization of the class of stabilizer codes to…

A unitary t-design is a set of unitaries that is "evenly distributed" in the sense that the average of any t-th order polynomial over the design equals the average over the entire unitary group. In various fields -- e.g. quantum information…

We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are…

In the framework of Clifford analysis, a chain of harmonic and monogenic potentials is constructed in the upper half of Euclidean space $\mR^{m+1}$, including a higher dimensional generalization of the complex logarithmic function. Their…

Prevailing proposals for the first generation of quantum computers make use of 2-level systems, or qubits, as the fundamental unit of quantum information. However, recent innovations in quantum error correction and magic state distillation…

Quantum data locking is a quantum communication primitive that allows the use of a short secret key to encrypt a much longer message. It guarantees information-theoretical security against an adversary with limited quantum memory. Here we…

We introduce a fault-tolerant construction to implement a composite quantum operation of four overlapping Toffoli gates. The same construction can produce two independent Toffoli gates. This result lowers resource overheads in designs for…

Reliable qubits are difficult to engineer, but standard fault-tolerance schemes use seven or more physical qubits to encode each logical qubit, with still more qubits required for error correction. The large overhead makes it hard to…

Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, d-level quantum systems, as the basic carrier of quantum information. We show that color codes, a class of topological…

In this paper, we focus on the problem of computing the set of diagonal transversal gates fixing a CSS code. We determine the logical actions of the gates as well as the groups of transversal gates that induce non-trivial logical gates and…

We prove that quadratic regular algebras of global dimension three on degree-one generators are related to graded skew Clifford algebras. In particular, we prove that almost all such algebras may be constructed as a twist of either a…