Quantum Physics

The color code is a topological quantum code with many valuable fault-tolerant logical gates. Its two-dimensional version may soon be realized with currently available superconducting hardware despite constrained qubit connectivity. In the talk, I will focus on how to perform error correction with the color code in d ≥ 2 dimensions. I will describe an efficient color code decoder, the Restriction Decoder, which uses as a subroutine any toric code decoder. I will also present numerical estimates of the storage threshold of the Restriction Decoder for the triangular color code against circuit-level depolarizing noise. Based on arXiv:1905.07393 and arXiv:1911.00355.

In the AdS/CFT correspondence, global symmetries of the CFT are realized as local symmetries of AdS; this feature underlies the error-correcting property of AdS. I will explain how this allows AdS3 to realize multiple redundant computations of any CFT2 correlation function in the form of networks of Wilson lines. The main motivation is to rigorously define the CFT at a cutoff and study it as a model of computational complexity; in that regard we will find agreement with the holographic "Complexity = Volume" proposal. But the framework might be useful more generally.

In a continuum field theory the Hilbert space does not factorize into local tensor products. How then can we define entanglement and the basic protocols of quantum information theory? In this talk we will show how the factorization problem can be solved in a class of 2D conformal field theories by directly appealing to the fusion rules. The solution suggests a tensor network description of a CFT path integral using the OPE data.

I will report on an ongoing project to work out and exploit an analogue of Schur-Weyl duality for the Clifford group. Schur-Weyl establishes a one-one correspondence between irreps of the unitary group and those of the symmetric group. A similar program can be carried out for Cliffords. The permutations are then replaced by certain discrete orthogonal maps. As is the case for Schur-Weyl, this duality has many applications for problems in quantum information. It can be used, e.g., to derive quantum property tests for stabilizerness and Cliffordness, a new direct interpretation of the sum-negativity of Wigner functions, bounds on stabilizer rank, the construction of designs using few non-Clifford resources, etc. [arXiv:1609.08172, arXiv:1712.08628, arXiv:1906.07230, arXiv:out.soon].

Affleck, Kennedy, Lieb, and Tasaki (AKLT) constructed one-dimensional and two-dimensional spin models invariant under spin rotation. These are recognized as paradigmatic examples of symmetry-protected topological phases, including the spin-1 AKLT chain with a provable nonzero spectral gap that strongly supports Haldane’s conjecture on the spectral gap of integer chains. These states were shown to provide universal resource for quantum computation, in the framework of the measurement-based approach, including the spin-3/2 AKLT state on the honeycomb lattice and the spin-2 one on the square lattice, both of which display exponential decay in the correlation functions. However, the nonzero spectral in these 2D models had not been proved analytically for over 30 years, until very recently. I will review briefly our understanding of the quantum computational universality in the AKLT family. Then I will focus on demonstrating the nonzero spectral gap for several 2D AKLT models, including decorated honeycomb and decorated square lattices, and the undecorated degree-3 Archimedean lattices. In brief, we now have universal resource states that are ground states of provable gapped local Hamiltonians. Such a feature may be useful in creating the resource states by cooling the system and might further help the exploration into the quantum computational phases in generalized AKLT-Haldane phases.

The manipulation of quantum "resources" such as entanglement and coherence lies at the heart of quantum advantages and technologies. In practice, a particularly important kind of manipulation is to "purify" the quantum resources, since they are inevitably contaminated by noises and thus often lost their power or become unreliable for direct usage. Here we derive fundamental limitations on how effectively generic noisy resources can be purified enforced by the laws of quantum mechanics, which universally apply to any reasonable kind of quantum resource. Remarkably, it is impossible to achieve perfect resource purification, even probabilistically. Our theorems indicate strong limits on the efficiency of distillation, a widely-used type of resource purification routine that underpins many key applications of quantum information science. In particular, we present explicit lower bounds on the resource cost of magic state distillation, a leading scheme for realizing scalable fault-tolerant quantum computation

There is a standard generalization of stabilizer codes to work with qudits which have prime dimension, and a slightly less standard generalization for qudits whose dimension is a prime power. However, for prime power dimensions, the usual generalization effectively treats the qudit as multiple prime-dimensional qudits instead of one larger object. There is a finite field GF(q) with size equal to any prime power, and it makes sense to label the qudit basis states with elements of the finite field, but the usual stabilizer codes do not make use of the structure of the finite field. I introduce the true GF(q) stabilizer codes, a subset of the usual prime power stabilizer codes which do make full use of the finite field structure. The true GF(q) stabilizer codes have nicer properties than the usual stabilizer codes over prime power qudits and work with a lifted Pauli group, which has some interesting mathematical aspects to it.

A self-correcting quantum memory can store and protect quantum information for a time that increases without bound in the system size, without the need for active error correction. Unfortunately, the landscape of Hamiltonians based on stabilizer (subspace) codes is heavily constrained by numerous no-go results and it is not known if they can exist in three dimensions or less. In this talk, we will discuss the role of symmetry in self-correcting memories. Firstly, we will demonstrate that codes given by 2D symmetry-enriched topological (SET) phases that appear naturally on the boundary of 3D symmetry-protected topological (SPT) phases can be self-correcting -- provided that they are protected by an appropriate subsystem symmetry. Secondly, we discuss the feasibility of self-correction in Hamiltonians based on subsystem codes, guided by the concept of emergent symmetries. We present ongoing work on a new exactly solvable candidate model in this direction based on the 3D gauge color code. The model is a non-commuting, frustrated lattice model which we prove to have an energy barrier to all bulk errors. Finding boundary conditions that encode logical qubits and retain the bulk energy barrier remains an open question.

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the p-faces of the n-cube (for n>p) and stabilizer constraints with faces of dimension (p±1). The quantum code obtained by identifying antipodal faces of the resulting complex encodes one logical qubit into N=2n−p−1(np) physical qubits and displays local testability with a soundness of Ω(log−2(N)) beating the current state-of-the-art of log−3(N) due to Hastings. We exploit this local testability to devise an efficient decoding algorithm that corrects arbitrary errors of size less than the minimum distance, up to polylog factors. We then extend this code family by considering the quotient of the n-cube by arbitrary linear classical codes of length n. We establish the parameters of these generalized hemicubic codes. Interestingly, if the soundness of the hemicubic code could be shown to be 1/log(N), similarly to the ordinary n-cube, then the generalized hemicubic codes could yield quantum locally testable codes of length not exceeding an exponential or even polynomial function of the code dimension. (joint work with Vivien Londe and Gilles Zémor)