Related papers: Diagonal gates in the Clifford hierarchy
Steane's 7-qubit quantum error-correcting code admits a set of fault-tolerant gates that generate the Clifford group, which in itself is not universal for quantum computation. The 15-qubit Reed-Muller code also does not admit a universal…
Transversal Pauli $Z$ rotations provide a natural route to fault-tolerant logical diagonal gates in quantum CSS codes, but their capability is inherently constrained. We develop a homological framework that organizes transversal diagonal…
Topological subsystem color codes add to the advantages of topological codes an important feature: error tracking only involves measuring 2-local operators in a two dimensional setting. Unfortunately, known methods to compute with them were…
Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be…
We introduce a class of 3D color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into stacked codes and back. The stacked code allows…
The geometric calculus based on Clifford algebra is a very useful tool for geometry and physics. It describes a geometric structure which is much richer than the ordinary geometry of spacetime. A Clifford manifold ($C$-space) consists not…
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…
We explore the implementation of pseudo-random single-qubit rotations and multi-qubit pseudo-random circuits constructed only from Clifford gates and the T-gate, a phase rotation of pi/4. Such a gate set would be appropriate for…
We investigate the action of the first three levels of the Clifford hierarchy on sets of mutually unbiased bases comprising the Ivanovic MUB and the Alltop MUBs. Vectors in the Alltop MUBs exhibit additional symmetries when the dimension is…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
Transversal gates are the simplest form of fault-tolerant gates and are relatively easy to implement in practice. Yet designing codes that support useful transversal operations -- especially non-Clifford or addressable gates -- remains…
We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the controlled-phase gate CS=diag(1,1,1,i). The Clifford+CS gate set is universal for quantum computation and its elements can be…
Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…
Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford…
We study a general family of quantum protocols for position verification and present a new class of attacks based on the Clifford hierarchy. These attacks outperform current strategies based on port-based teleportation for a large class of…
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It…
We introduce a characterisation scheme for a universal qutrit gate set. Motivated by the rising interest in qutrit systems, we apply our criteria to establish that our hyperdihedral group underpins a scheme to characterise the performance…
In this paper we present an approach to quadratic structures in derived algebraic geometry. We define derived n-shifted quadratic complexes, over derived affine stacks and over general derived stacks, and give several examples of those. We…
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…
It is shown that ternary qubit trees with the same number of nodes can be transformed by the naturally defined sequence of Clifford gates into each other or into standard representation as 1D chain corresponding to Jordan-Wigner transform.