Benjamin J. Brown

Quantum memories at finite temperature

To use quantum systems for technological applications one first needs to preserve their coherence for macroscopic time scales, 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. The state-of-the-art developments in this field are reviewed in an informative and pedagogical way. The main principles of self-correcting quantum memories are given and several milestone examples from the literature of two-, three- and higher-dimensional quantum memories are analyzed.

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 by using a new method, known as gauge fixing, for performing the non-Clifford 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 the first steps of a comparative study between the gauge color code and other promising computational architectures.

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.

Fast decoders for qudit topological codes

Qudit toric codes are a natural higher-dimensional generalization of the wellstudied 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 analyse 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 many-level quantum systems. The second decoder is a generalization of a ‘soft-decisions’ decoder due to Poulin and Duclos-Cianci (2010 Phys. Rev. Lett. 104 050504), 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.

Generating topological order from a two-dimensional cluster state using a duality mapping

In this paper, we prove, extend and review possible mappings between the two-dimensional (2D) cluster state, Wens model, the 2D Ising chain and Kitaevs toric code model. We introduce a 2D duality transformation to map the 2D lattice cluster state into the topologically ordered Wen model. Then, we investigate 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, Wens model is mapped into a series of 1D Ising interactions. Considering the boundary terms with this mapping then reveals how the Ising chains interact with one another. The duality of these models can be taken as a starting point to address questions as to how their gate operations in different quantum computational models can be related to each other.

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 time scales. 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 Kitaevs 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 superexponential 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.

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.