arXiv subjects

Michael E. Beverland

Publications and source records attributed to Michael E. Beverland.

23 records · Page 2Linked to original sources

arXiv2018

Flag fault-tolerant error correction with arbitrary distance codes

In this paper we introduce a general fault-tolerant quantum error correction protocol using flag circuits for measuring stabilizers of arbitrary distance codes. In addition to extending flag error correction beyond distance-three codes for the first time, our protocol also applies to a broader class of distance-three codes than was previously known. Flag circuits use extra ancilla qubits to signal when errors resulting from $v$ faults in the circuit have weight greater than $v$. The flag error correction protocol is applicable to stabilizer codes of arbitrary distance which satisfy a set of conditions and uses fewer qubits than other schemes such as Shor, Steane and Knill error correction. We give examples of infinite code families which satisfy these conditions and analyze the behaviour of distance-three and -five examples numerically. Requiring fewer resources than Shor error correction, flag error correction could potentially be used in low-overhead fault-tolerant error correction protocols using low density parity check quantum codes of large code length.

quant-ph↗

arXiv2017

Three-dimensional color code thresholds via statistical-mechanical mapping

Three-dimensional (3D) color codes have advantages for fault-tolerant quantum computing, such as protected quantum gates with relatively low overhead and robustness against imperfect measurement of error syndromes. Here we investigate the storage threshold error rates for bit-flip and phase-flip noise in the 3D color code on the body-centererd cubic lattice, assuming perfect syndrome measurements. In particular, by exploiting a connection between error correction and statistical mechanics, we estimate the threshold for 1D string-like and 2D sheet-like logical operators to be $p^{(1)}_\mathrm{3DCC} \simeq 1.9\%$ and $p^{(2)}_\mathrm{3DCC} \simeq 27.6\%$. We obtain these results by using parallel tempering Monte Carlo simulations to study the disorder-temperature phase diagrams of two new 3D statistical-mechanical models: the 4- and 6-body random coupling Ising models.

quant-ph↗

arXiv2016

Realizing Exactly Solvable SU(N) Magnets with Thermal Atoms

We show that $n$ thermal fermionic alkaline-earth atoms in a flat-bottom trap allow one to robustly implement a spin model displaying two symmetries: the $S_n$ symmetry that permutes atoms occupying different vibrational levels of the trap and the SU($N$) symmetry associated with $N$ nuclear spin states. The high symmetry makes the model exactly solvable, which, in turn, enables the analytic study of dynamical processes such as spin diffusion in this SU($N$) system. We also show how to use this system to generate entangled states that allow for Heisenberg-limited metrology. This highly symmetric spin model should be experimentally realizable even when the vibrational levels are occupied according to a high-temperature thermal or an arbitrary non-thermal distribution.

cond-mat.quant-gas↗

arXiv2016

Protected gates for topological quantum field theories

We study restrictions on locality-preserving unitary logical gates for topological quantum codes in two spatial dimensions. A locality-preserving operation is one which maps local operators to local operators --- for example, a constant-depth quantum circuit of geometrically local gates, or evolution for a constant time governed by a geometrically-local bounded-strength Hamiltonian. Locality-preserving logical gates of topological codes are intrinsically fault tolerant because spatially localized errors remain localized, and hence sufficiently dilute errors remain correctable. By invoking general properties of two-dimensional topological field theories, we find that the locality-preserving logical gates are severely limited for codes which admit non-abelian anyons; in particular, there are no locality-preserving logical gates on the torus or the sphere with M punctures if the braiding of anyons is computationally universal. Furthermore, for Ising anyons on the M-punctured sphere, locality-preserving gates must be elements of the logical Pauli group. We derive these results by relating logical gates of a topological code to automorphisms of the Verlinde algebra of the corresponding anyon model, and by requiring the logical gates to be compatible with basis changes in the logical Hilbert space arising from local F-moves and the mapping class group.

quant-ph↗

arXiv2014

Universal transversal gates with color codes - a simplified approach

We provide a simplified, yet rigorous presentation of the ideas from Bombín's paper "Gauge Color Codes" [arXiv:1311.0879v3]. Our presentation is self-contained, and assumes only basic concepts from quantum error correction. We provide an explicit construction of a family of color codes in arbitrary dimensions and describe some of their crucial properties. Within this framework, we explicitly show how to transversally implement the generalized phase gate $R_n=\text{diag}(1,e^{2πi/2^n})$, which deviates from the method in "Gauge Color Codes", allowing an arguably simpler proof. We describe how to implement the Hadamard gate $H$ fault-tolerantly using code switching. In three dimensions, this yields, together with the transversal $CNOT$, a fault-tolerant universal gate set $\{H,CNOT,R_3\}$ without state-distillation.

quant-ph↗