Non-Clifford and parallelizable fault-tolerant logical gates on constant
and almost-constant rate homological quantum LDPC codes via higher symmetries
- URL: http://arxiv.org/abs/2310.16982v1
- Date: Wed, 25 Oct 2023 20:33:59 GMT
- Title: Non-Clifford and parallelizable fault-tolerant logical gates on constant
and almost-constant rate homological quantum LDPC codes via higher symmetries
- Authors: Guanyu Zhu, Shehryar Sikander, Elia Portnoy, Andrew W. Cross, and
Benjamin J. Brown
- Abstract summary: We study fault-tolerant quantum computing for families of homological quantum low-density parity-check codes defined on 3-manifolds with constant or almost-constant encoding rate.
We have developed a generic formalism to compute the triple intersection invariants for 3-manifolds.
- Score: 1.3194391758295114
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study parallel fault-tolerant quantum computing for families of
homological quantum low-density parity-check (LDPC) codes defined on
3-manifolds with constant or almost-constant encoding rate. We derive generic
formula for a transversal $T$ gate of color codes on general 3-manifolds, which
acts as collective non-Clifford logical CCZ gates on any triplet of logical
qubits with their logical-$X$ membranes having a $\mathbb{Z}_2$ triple
intersection at a single point. The triple intersection number is a topological
invariant, which also arises in the path integral of the emergent higher
symmetry operator in a topological quantum field theory: the $\mathbb{Z}_2^3$
gauge theory. Moreover, the transversal $S$ gate of the color code corresponds
to a higher-form symmetry supported on a codimension-1 submanifold, giving rise
to exponentially many addressable and parallelizable logical CZ gates. We have
developed a generic formalism to compute the triple intersection invariants for
3-manifolds and also study the scaling of the Betti number and systoles with
volume for various 3-manifolds, which translates to the encoding rate and
distance. We further develop three types of LDPC codes supporting such logical
gates: (1) A quasi-hyperbolic code from the product of 2D hyperbolic surface
and a circle, with almost-constant rate $k/n=O(1/\log(n))$ and $O(\log(n))$
distance; (2) A homological fibre bundle code with $O(1/\log^{\frac{1}{2}}(n))$
rate and $O(\log^{\frac{1}{2}}(n))$ distance; (3) A specific family of 3D
hyperbolic codes: the Torelli mapping torus code, constructed from mapping tori
of a pseudo-Anosov element in the Torelli subgroup, which has constant rate
while the distance scaling is currently unknown. We then show a generic
constant-overhead scheme for applying a parallelizable universal gate set with
the aid of logical-$X$ measurements.
Related papers
- Genons, Double Covers and Fault-tolerant Clifford Gates [2.5866180357107242]
We show a construction that produces symplectic double code with naturally occurring fault-tolerant logical Clifford gates.
We demonstrate this experimentally on Quantinuum's H1-1 trapped-ion quantum computer.
arXiv Detail & Related papers (2024-06-14T11:57:51Z) - KPZ scaling from the Krylov space [83.88591755871734]
Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported.
Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
arXiv Detail & Related papers (2024-06-04T20:57:59Z) - Higher-group symmetry of (3+1)D fermionic $\mathbb{Z}_2$ gauge theory: logical CCZ, CS, and T gates from higher symmetry [0.0]
We study the higher-group structure in (3+1)D $mathbbZ$ gauge theory with an emergent fermion.
Our considerations also imply the possibility of a logical $T$ gate by placing the code on $mathbbRP3$ and pumping a $p+ip$ topological state.
arXiv Detail & Related papers (2023-11-09T19:00:00Z) - Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.
We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z) - Climbing the Diagonal Clifford Hierarchy [0.6445605125467572]
We introduce a method of synthesizing codes that realize a target logical diagonal gate at some level $l$ in the Clifford hierarchy.
The method combines three basic operations: concatenation, removal of $Z$-stabilizers, and addition of $X$-stabilizers.
For the coherent noise model, we describe how to switch between computation and storage of intermediate results in a decoherence-free subspace.
arXiv Detail & Related papers (2021-10-22T17:08:18Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Topological Order, Quantum Codes and Quantum Computation on Fractal
Geometries [0.0]
We prove a no-go theorem that $mathbbZ_N$ topological order cannot survive on any fractal embedded in 2D.
We construct fault-tolerant logical gates using their connection to global and higher-form topological symmetries.
arXiv Detail & Related papers (2021-07-30T18:00:03Z) - Quantum double aspects of surface code models [77.34726150561087]
We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry.
We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
arXiv Detail & Related papers (2021-06-25T17:03:38Z) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.