Brauer–Clifford group of (S,G,H)-Azumaya comodule algebras

2020 ◽  
Vol 48 (10) ◽  
pp. 4483-4500
Author(s):  
T. Guédénon
Keyword(s):  
2020 ◽  
Vol 21 (1) ◽  
pp. 43
Author(s):  
Waldir S. Soares Jr ◽  
E. B. Silva ◽  
Emerson J. Vizentim ◽  
Franciele P. B. Soares

This current work propose a technique to generate polygonal color codes in the hyperbolic geometry environment. The color codes were introduced by Bombin and Martin-Delgado in 2007, and the called triangular color codes have a higher degree of interest because they allow the implementation of the Clifford group, but they encode only one qubit. In 2018 Soares e Silva extended the triangular codes to the polygonal codes, which encode more qubits. Using an approach through hyperbolic tessellations we show that it is possible to generate Hyperbolic Polygonal codes, which encode more than one qubit with the capacity to implement the entire Clifford group and also having a better coding rate than the previously mentioned codes, for the color codes on surfaces with boundary with minimum distance d = 3.


2018 ◽  
Vol 18 (1&2) ◽  
pp. 1-17
Author(s):  
Alex Bocharov

Metaplectic quantum basis is a universal multi-qutrit quantum basis, formed by the ternary Clifford group and the axial reflection gate R = |0ih0| + |1ih1| − |2ih2|. It is arguably, a ternary basis with the simplest geometry. Recently Cui, Kliuchnikov, Wang and the Author have proposed a compilation algorithm to approximate any twolevel Householder reflection to precision ε by a metaplectic circuit of R-count at most C log3 (1/ε) + O(log log 1/ε) with C = 8. A new result in this note takes the constant down to C = 5 for non-exceptional target reflections under a certain credible numbertheoretical conjecture. The new method increases the chances of obtaining a truly optimal circuit but may not guarantee the true optimality. Efficient approximations of an important ternary quantum gate proposed by Howard, Campbell and others is also discussed.


Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 581
Author(s):  
Seth T. Merkel ◽  
Emily J. Pritchett ◽  
Bryan H. Fong

We show that the Randomized Benchmarking (RB) protocol is a convolution amenable to Fourier space analysis. By adopting the mathematical framework of Fourier transforms of matrix-valued functions on groups established in recent work from Gowers and Hatami \cite{GH15}, we provide an alternative proof of Wallman's \cite{Wallman2018} and Proctor's \cite{Proctor17} bounds on the effect of gate-dependent noise on randomized benchmarking. We show explicitly that as long as our faulty gate-set is close to the targeted representation of the Clifford group, an RB sequence is described by the exponential decay of a process that has exactly two eigenvalues close to one and the rest close to zero. This framework also allows us to construct a gauge in which the average gate-set error is a depolarizing channel parameterized by the RB decay rates, as well as a gauge which maximizes the fidelity with respect to the ideal gate-set.


Quantum ◽  
2017 ◽  
Vol 1 ◽  
pp. 2 ◽  
Author(s):  
Theodore J. Yoder ◽  
Isaac H. Kim

The surface code is one of the most successful approaches to topological quantum error-correction. It boasts the smallest known syndrome extraction circuits and correspondingly largest thresholds. Defect-based logical encodings of a new variety called twists have made it possible to implement the full Clifford group without state distillation. Here we investigate a patch-based encoding involving a modified twist. In our modified formulation, the resulting codes, called triangle codes for the shape of their planar layout, have only weight-four checks and relatively simple syndrome extraction circuits that maintain a high, near surface-code-level threshold. They also use 25% fewer physical qubits per logical qubit than the surface code. Moreover, benefiting from the twist, we can implement all Clifford gates by lattice surgery without the need for state distillation. By a surgical transformation to the surface code, we also develop a scheme of doing all Clifford gates on surface code patches in an atypical planar layout, though with less qubit efficiency than the triangle code. Finally, we remark that logical qubits encoded in triangle codes are naturally amenable to logical tomography, and the smallest triangle code can demonstrate high-pseudothreshold fault-tolerance to depolarizing noise using just 13 physical qubits.


2002 ◽  
Vol 2 (6) ◽  
pp. 443-486
Author(s):  
R. Raussendorf ◽  
H. Briegel

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. {\bf{86}}, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step.


2011 ◽  
Vol 341 (1) ◽  
pp. 109-124 ◽  
Author(s):  
Alexandre Turull
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document