arXiv subjects

Benjamin J. Brown

Publications and source records attributed to Benjamin J. Brown.

52 records · Page 3Linked to original sources

arXiv2021

A fault-tolerant non-Clifford gate for the surface code in two dimensions

Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum error-correcting code now under intensive development. This alleviates the need for distillation or higher-dimensional components to complete a universal gate set. The operation uses both local transversal gates and code deformations over a time that scales with the size of the qubit array. An important component of the gate is a just-in-time decoder. These decoding algorithms allow us to draw upon the advantages of three-dimensional models using only a two-dimensional array of live qubits. Our gate is completed using parity checks of weight no greater than four. We therefore expect it to be amenable with near-future technology. As the gate circumvents the need for magic-state distillation, it may reduce the resource overhead of surface-code quantum computation considerably.

quant-ph↗

arXiv2020

Universal fault-tolerant measurement-based quantum computation

Certain physical systems that one might consider for fault-tolerant quantum computing where qubits do not readily interact, for instance photons, are better suited for measurement-based quantum-computational protocols. Here we propose a measurement-based model for universal quantum computation that simulates the braiding and fusion of Majorana modes. To derive our model we develop a general framework that maps any scheme of fault-tolerant quantum computation with stabilizer codes into the measurement-based picture. As such, our framework gives an explicit way of producing fault-tolerant models of universal quantum computation with linear optics using protocols developed using the stabilizer formalism. Given the remarkable fault-tolerant properties that Majorana modes promise, the main example we present offers a robust and resource efficient proposal for photonic quantum computation.

quant-ph↗

arXiv2020

Fault-tolerant thresholds for the surface code in excess of 5% under biased noise

Noise in quantum computing is countered with quantum error correction. Achieving optimal performance will require tailoring codes and decoding algorithms to account for features of realistic noise, such as the common situation where the noise is biased towards dephasing. Here we introduce an efficient high-threshold decoder for a noise-tailored surface code based on minimum-weight perfect matching. The decoder exploits the symmetries of its syndrome under the action of biased noise and generalises to the fault-tolerant regime where measurements are unreliable. Using this decoder, we obtain fault-tolerant thresholds in excess of $6\%$ for a phenomenological noise model in the limit where dephasing dominates. These gains persist even for modest noise biases: we find a threshold of $\sim 5\%$ in an experimentally relevant regime where dephasing errors occur at a rate one hundred times greater than bit-flip errors.

quant-ph↗

arXiv2020

Parallelized quantum error correction with fracton topological codes

Fracton topological phases have a large number of materialized symmetries that enforce a rigid structure on their excitations. Remarkably, we find that the symmetries of a quantum error-correcting code based on a fracton phase enable us to design decoding algorithms. Here we propose and implement decoding algorithms for the three-dimensional X-cube model. In our example, decoding is parallelized into a series of two-dimensional matching problems, thus significantly simplifying the most time consuming component of the decoder. We also find that the rigid structure of its point excitations enable us to obtain high threshold error rates. Our decoding algorithms bring to light some key ideas that we expect to be useful in the design of decoders for general topological stabilizer codes. Moreover, the notion of parallelization unifies several concepts in quantum error correction. We conclude by discussing the broad applicability of our methods, and we explain the connection between parallelizable codes and other methods of quantum error correction. In particular we propose that the new concept represents a generalization of single-shot error correction.

quant-ph↗

arXiv2019

Analysing correlated noise on the surface code using adaptive decoding algorithms

Laboratory hardware is rapidly progressing towards a state where quantum error-correcting codes can be realised. As such, we must learn how to deal with the complex nature of the noise that may occur in real physical systems. Single qubit Pauli errors are commonly used to study the behaviour of error-correcting codes, but in general we might expect the environment to introduce correlated errors to a system. Given some knowledge of structures that errors commonly take, it may be possible to adapt the error-correction procedure to compensate for this noise, but performing full state tomography on a physical system to analyse this structure quickly becomes impossible as the size increases beyond a few qubits. Here we develop and test new methods to analyse blue a particular class of spatially correlated errors by making use of parametrised families of decoding algorithms. We demonstrate our method numerically using a diffusive noise model. We show that information can be learnt about the parameters of the noise model, and additionally that the logical error rates can be improved. We conclude by discussing how our method could be utilised in a practical setting blue and propose extensions of our work to study more general error models.

quant-ph↗

arXiv2018

The role of entropy in topological quantum error correction

The performance of a quantum error-correction process is determined by the likelihood that a random configuration of errors introduced to the system will lead to the corruption of encoded logical information. In this work we compare two different variants of the surface code with a comparable number of qubits: the surface code defined on a square lattice and the same model on a lattice that is rotated by $π/ 4$. This seemingly innocuous change increases the distance of the code by a factor of $\sqrt{2}$.However, as we show, this gain can come at the expense of significantly increasing the number of different failure mechanisms that are likely to occur. We use a number of different methods to explore this tradeoff over a large range of parameter space under an independent and identically distributed noise model. We rigorously analyze the leading order performance for low error rates, where the larger distance code performs best for all system sizes. Using an analytical model and Monte Carlo sampling, we find that this improvement persists for fixed sub-threshold error rates for large system size, but that the improvement vanishes close to threshold. Remarkably, intensive numerics uncover a region of system sizes and sub-threshold error rates where the square lattice surface code marginally outperforms the rotated model.

quant-ph↗

arXiv2018

The boundaries and twist defects of the color code and their applications to topological quantum computation

The color code is both an interesting example of an exactly solved topologically ordered phase of matter and also among the most promising candidate models to realize fault-tolerant quantum computation with minimal resource overhead. The contributions of this work are threefold. First of all, we build upon the abstract theory of boundaries and domain walls of topological phases of matter to comprehensively catalog the objects realizable in color codes. Together with our classification we also provide lattice representations of these objects which include three new types of boundaries as well as a generating set for all 72 color code twist defects. Our work thus provides an explicit toy model that will help to better understand the abstract theory of domain walls. Secondly, we discover a number of interesting new applications of the cataloged objects for quantum information protocols. These include improved methods for performing quantum computations by code deformation, a new four-qubit error-detecting code, as well as families of new quantum error-correcting codes we call stellated color codes, which encode logical qubits at the same distance as the next best color code, but using approximately half the number of physical qubits. To the best of our knowledge, our new topological codes have the highest encoding rate of local stabilizer codes with bounded-weight stabilizers in two dimensions. Finally, we show how the boundaries and twist defects of the color code are represented by multiple copies of other phases. Indeed, in addition to the well studied comparison between the color code and two copies of the surface code, we also compare the color code to two copies of the three-fermion model. In particular, we find that this analogy offers a very clear lens through which we can view the symmetries of the color code which gives rise to its multitude of domain walls.

quant-ph↗

arXiv2017

Poking holes and cutting corners to achieve Clifford gates with the surface code

The surface code is currently the leading proposal to achieve fault-tolerant quantum computation. Among its strengths are the plethora of known ways in which fault-tolerant Clifford operations can be performed, namely, by deforming the topology of the surface, by the fusion and splitting of codes and even by braiding engineered Majorana modes using twist defects. Here we present a unified framework to describe these methods, which can be used to better compare different schemes, and to facilitate the design of hybrid schemes. Our unification includes the identification of twist defects with the corners of the planar code. This identification enables us to perform single-qubit Clifford gates by exchanging the corners of the planar code via code deformation. We analyse ways in which different schemes can be combined, and propose a new logical encoding. We also show how all of the Clifford gates can be implemented with the planar code without loss of distance using code deformations, thus offering an attractive alternative to ancilla-mediated schemes to complete the Clifford group with lattice surgery.

quant-ph↗

arXiv2016

Quantum memories at finite temperature

To use quantum systems for technological applications we first need to preserve their coherence for macroscopic timescales, even at finite temperature. Quantum error correction has made it possible to actively correct errors that affect a quantum memory. An attractive scenario is the construction of passive storage of quantum information with minimal active support. Indeed, passive protection is the basis of robust and scalable classical technology, physically realized in the form of the transistor and the ferromagnetic hard disk. The discovery of an analogous quantum system is a challenging open problem, plagued with a variety of no-go theorems. Several approaches have been devised to overcome these theorems by taking advantage of their loopholes. Here we review the state-of-the-art developments in this field in an informative and pedagogical way. We give the main principles of self-correcting quantum memories and we analyze several milestone examples from the literature of two-, three- and higher-dimensional quantum memories.

quant-ph↗

arXiv2016

Fault-tolerant error correction with the gauge color code

The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a universal set of computational operations with the minimal cost in quantum resources remains an important and ongoing challenge. One proposal of significant recent interest is the gauge color code. Notably, this code may offer a reduced resource cost over other well-studied fault-tolerant architectures using a new method, known as gauge fixing, for performing the non-Clifford logical operations that are essential for universal quantum computation. Here we examine the gauge color code when it is subject to noise. Specifically we make use of single-shot error correction to develop a simple decoding algorithm for the gauge color code, and we numerically analyse its performance. Remarkably, we find threshold error rates comparable to those of other leading proposals. Our results thus provide encouraging preliminary data of a comparative study between the gauge color code and other promising computational architectures.

quant-ph↗

arXiv2015

Ground state entanglement constrains low-energy excitations

For a general quantum many-body system, we show that its ground-state entanglement imposes a fundamental constraint on the low-energy excitations. For two-dimensional systems, our result implies that any system that supports anyons must have a nonvanishing topological entanglement entropy. We demonstrate the generality of this argument by applying it to three-dimensional quantum many-body systems, and showing that there is a pair of ground state topological invariants that are associated to their physical boundaries. From the pair, one can determine whether the given boundary can or cannot absorb point-like or line-like excitations.

quant-ph↗

arXiv2015

Trapped-ion quantum error-correcting protocols using only global operations

Quantum error-correcting codes are many-body entangled states that are prepared and measured using complex sequences of entangling operations. Each element of such an entangling sequence introduces noise to delicate quantum information during the encoding or reading out of the code. It is important therefore to find efficient entangling protocols to avoid the loss of information. Here we propose an experiment that uses only global entangling operations to encode an arbitrary logical qubit to either the five-qubit repetition code or the five-qubit code, with a six-ion Coulomb crystal architecture in a Penning trap. We show that the use of global operations enables us to prepare and read out these codes using only six and ten global entangling pulses, respectively. The proposed experiment also allows the acquisition of syndrome information during readout. We provide a noise analysis for the presented protocols, estimating that we can achieve a six-fold improvement in coherence time with noise as high as $\sim 1\%$ on each entangling operation.

quant-ph↗

arXiv2013

Entropic Barriers for Two-Dimensional Quantum Memories

Comprehensive no-go theorems show that information encoded over local two-dimensional topologically ordered systems cannot support macroscopic energy barriers, and hence will not maintain stable quantum information at finite temperatures for macroscopic timescales. However, it is still well motivated to study low-dimensional quantum memories due to their experimental amenability. Here we introduce a grid of defect lines to Kitaev's quantum double model where different anyonic excitations carry different masses. This setting produces a complex energy landscape which entropically suppresses the diffusion of excitations that cause logical errors. We show numerically that entropically suppressed errors give rise to super-exponential inverse temperature scaling and polynomial system size scaling for small system sizes over a low-temperature regime. Curiously, these entropic effects are not present below a certain low temperature. We show that we can vary the system to modify this bound and potentially extend the described effects to zero temperature.

quant-ph↗

arXiv2013

Topological Entanglement Entropy with a Twist

Defects in topologically ordered models have interesting properties that are reminiscent of the anyonic excitations of the models themselves. For example, dislocations in the toric code model are known as twists and possess properties that are analogous to Ising anyons. We strengthen this analogy by using the topological entanglement entropy as a diagnostic tool to identify properties of both defects and excitations in the toric code. Specifically, we show, through explicit calculation, that the toric code model including twists and dyon excitations has the same quantum dimensions, the same total quantum dimension, and the same fusion rules as an Ising anyon model.

quant-ph↗

arXiv2013

Efficient Decoders for Qudit Topological Codes

Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyze their error correction thresholds and efficiency. The first decoder is a generalization of a "hard-decisions" decoder due to Bravyi and Haah [arXiv:1112.3252]. We modify this decoder to overcome a percolation effect which limits its threshold performance for high dimensions. The second decoder is a generalization of a "soft-decisions" decoder due to Poulin and Duclos-Cianci [Phys. Rev. Lett. 104, 050504 (2010)], with a small cell size to optimize the efficiency of implementation in the high dimensional case. In each case, we estimate thresholds for the uncorrelated bit-flip error model and provide a comparative analysis of the performance of both these approaches to error correction of qudit toric codes.

quant-ph↗

arXiv2011

Generating topological order from a 2D cluster state using a duality mapping

In this paper we prove, extend and review possible mappings between the two-dimensional Cluster state, Wen's model, the two-dimensional Ising chain and Kitaev's toric code model. We introduce a two-dimensional duality transformation to map the two-dimensional lattice cluster state into the topologically-ordered Wen model. Then, we subsequently investigates how this mapping could be achieved physically, which allows us to discuss the rate at which a topologically ordered system can be achieved. Next, using a lattice fermionization method, Wen's model is mapped into a series of one-dimensional Ising interactions. Considering the boundary terms with this mapping then reveals how the Ising chains interact with one another. The relationships discussed in this paper allow us to consider these models from two different perspectives: From the perspective of condensed matter physics these mappings allow us to learn more about the relation between the ground state properties of the four different models, such as their entanglement or topological structure. On the other hand, we take the duality of these models as a starting point to address questions related to the universality of their ground states for quantum computation.

quant-ph↗