Aleksander Kubica

Unfolding the color code

The topological color code and the toric code are two leading candidates for realizing fault-tolerant quantum computation. Here we show that the color code on a d-dimensional closed manifold is equivalent to multiple decoupled copies of the d-dimensional toric code up to local unitary transformations and adding or removing ancilla qubits. Our result not only generalizes the proven equivalence for d = 2, but also provides an explicit recipe of how to decouple independent components of the color code, highlighting the importance of colorability in the construction of the code. Moreover, for the d-dimensional color code with d + 1 boundaries of d + 1 distinct colors, we find that the code is equivalent to multiple copies of the d-dimensional toric code which are attached along a (d - 1)-dimensional boundary. In particular, for d = 2, we show that the (triangular) color code with boundaries is equivalent to the (folded) toric code with boundaries. We also find that the d-dimensional toric code admits logical non-Pauli gates from the dth level of the Clifford hierarchy, and thus saturates the bound by Bravyi and Konig. In particular, we show that the logical d-qubit control-Z gate can be fault-tolerantly implemented on the stack of d copies of the toric code by a local unitary transformation.

Universal transversal gates with color codes: A simplified approach

We provide a simplified yet rigorous presentation of the ideas from Bombins paper (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 =diag(1,e^(2πi/2^n)), which deviates from the method in the aforementioned paper, 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 controlled-NOT (CNOT), a fault-tolerant universal gate set {H,cnot,R_3} without state distillation.

Symmetry-protected topological order at nonzero temperature

We address the question of whether symmetry-protected topological (SPT) order can persist at nonzero temperature, with a focus on understanding the thermal stability of several models studied in the theory of quantum computation. We present three results in this direction. First, we prove that nontrivial SPT order protected by a global onsite symmetry cannot persist at nonzero temperature, demonstrating that several quantum computational structures protected by such onsite symmetries are not thermally stable. Second, we prove that the three-dimensional (3D) cluster-state model used in the formulation of topological measurement-based quantum computation possesses a nontrivial SPT-ordered thermal phase when protected by a generalized (1-form) symmetry. The SPT order in this model is detected by long-range localizable entanglement in the thermal state, which compares with related results characterizing SPT order at zero temperature in spin chains using localizable entanglement as an order parameter. Our third result is to demonstrate that the high-error tolerance of this 3D cluster-state model for quantum computation, even without a protecting symmetry, can be understood as an application of quantum error correction to effectively enforce a 1-form symmetry.