39 research outputs found

    Code properties from holographic geometries

    Get PDF
    Almheiri, Dong, and Harlow [arXiv:1411.7041] proposed a highly illuminating connection between the AdS/CFT holographic correspondence and operator algebra quantum error correction (OAQEC). Here we explore this connection further. We derive some general results about OAQEC, as well as results that apply specifically to quantum codes which admit a holographic interpretation. We introduce a new quantity called `price', which characterizes the support of a protected logical system, and find constraints on the price and the distance for logical subalgebras of quantum codes. We show that holographic codes defined on bulk manifolds with asymptotically negative curvature exhibit `uberholography', meaning that a bulk logical algebra can be supported on a boundary region with a fractal structure. We argue that, for holographic codes defined on bulk manifolds with asymptotically flat or positive curvature, the boundary physics must be highly nonlocal, an observation with potential implications for black holes and for quantum gravity in AdS space at distance scales small compared to the AdS curvature radius.Comment: 17 pages, 5 figure

    Generating topological order: no speedup by dissipation

    Get PDF
    We consider the problem of preparing topologically ordered states using unitary and non-unitary circuits, as well as local time-dependent Hamiltonian and Liouvillian evolutions. We prove that for any topological code in DD dimensions, the time required to encode logical information into the ground space is at least Ω(d1/(D−1))\Omega(d^{1/(D-1)}), where dd is the code distance. This result is tight for the toric code, giving a scaling with the linear system size. More generally, we show that the linear scaling is necessary even when dropping the requirement of encoding: preparing any state close to the ground space using dissipation takes an amount of time proportional to the diameter of the system in typical 2D topologically ordered systems, as well as for example the 3D and 4D toric codes.Comment: 7 pages, 1 figur

    Fault-tolerant logical gates in quantum error-correcting codes

    Get PDF
    Recently, Bravyi and K\"onig have shown that there is a tradeoff between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant depth geometrically local circuit and are thus fault-tolerant by construction. In particular, they shown that, for local stabilizer codes in D spatial dimensions, locality preserving gates are restricted to a set of unitary gates known as the D-th level of the Clifford hierarchy. In this paper, we elaborate this idea and provide several extensions and applications of their characterization in various directions. First, we present a new no-go theorem for self-correcting quantum memory. Namely, we prove that a three-dimensional stabilizer Hamiltonian with a locality-preserving implementation of a non-Clifford gate cannot have a macroscopic energy barrier. Second, we prove that the code distance of a D-dimensional local stabilizer code with non-trivial locality-preserving m-th level Clifford logical gate is upper bounded by O(LD+1−m)O(L^{D+1-m}). For codes with non-Clifford gates (m>2), this improves the previous best bound by Bravyi and Terhal. Third we prove that a qubit loss threshold of codes with non-trivial transversal m-th level Clifford logical gate is upper bounded by 1/m. As such, no family of fault-tolerant codes with transversal gates in increasing level of the Clifford hierarchy may exist. This result applies to arbitrary stabilizer and subsystem codes, and is not restricted to geometrically-local codes. Fourth we extend the result of Bravyi and K\"onig to subsystem codes. A technical difficulty is that, unlike stabilizer codes, the so-called union lemma does not apply to subsystem codes. This problem is avoided by assuming the presence of error threshold in a subsystem code, and the same conclusion as Bravyi-K\"onig is recovered.Comment: 13 pages, 4 figure

    Unfolding the color code

    Get PDF
    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 dd-dimensional closed manifold is equivalent to multiple decoupled copies of the dd-dimensional toric code up to local unitary transformations and adding or removing ancilla qubits. Our result not only generalizes the proven equivalence for d=2d=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 dd-dimensional color code with d+1d+1 boundaries of d+1d+1 distinct colors, we find that the code is equivalent to multiple copies of the dd-dimensional toric code which are attached along a (d−1)(d-1)-dimensional boundary. In particular, for d=2d=2, we show that the (triangular) color code with boundaries is equivalent to the (folded) toric code with boundaries. We also find that the dd-dimensional toric code admits logical non-Pauli gates from the dd-th level of the Clifford hierarchy, and thus saturates the bound by Bravyi and K\"{o}nig. In particular, we show that the dd-qubit control-ZZ logical gate can be fault-tolerantly implemented on the stack of dd copies of the toric code by a local unitary transformation.Comment: 46 pages, 15 figure

    Limitations of Passive Protection of Quantum Information

    Full text link
    The ability to protect quantum information from the effect of noise is one of the major goals of quantum information processing. In this article, we study limitations on the asymptotic stability of quantum information stored in passive N-qubit systems. We consider the effect of small imperfections in the implementation of the protecting Hamiltonian in the form of perturbations or weak coupling to a ground state environment. We prove that, regardless of the protecting Hamiltonian, there exists a perturbed evolution that necessitates a final error correcting step when the state of the memory is read. Such an error correction step is shown to require a finite error threshold, the lack thereof being exemplified by the 3D compass model. We go on to present explicit weak Hamiltonian perturbations which destroy the logical information stored in the 2D toric code in a time O(log(N)).Comment: 17 pages and appendice

    Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence

    Get PDF
    We propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum error-correcting codes with a tensor network structure. Our building block is a special type of tensor with maximal entanglement along any bipartition, which gives rise to an isometry from the bulk Hilbert space to the boundary Hilbert space. The entire tensor network is an encoder for a quantum error-correcting code, where the bulk and boundary degrees of freedom may be identified as logical and physical degrees of freedom respectively. These models capture key features of entanglement in the AdS/CFT correspondence; in particular, the Ryu-Takayanagi formula and the negativity of tripartite information are obeyed exactly in many cases. That bulk logical operators can be represented on multiple boundary regions mimics the Rindler-wedge reconstruction of boundary operators from bulk operators, realizing explicitly the quantum error-correcting features of AdS/CFT recently proposed by Almheiri et. al in arXiv:1411.7041.Comment: 40 Pages + 25 Pages of Appendices. 38 figures. Typos and bibliographic amendments and minor correction

    Error correction for encoded quantum annealing

    Get PDF
    Recently, W. Lechner, P. Hauke, and P. Zoller [Sci. Adv. 1, e1500838 (2015)] have proposed a quantum annealing architecture, in which a classical spin glass with all-to-all pairwise connectivity is simulated by a spin glass with geometrically local interactions. We interpret this architecture as a classical error-correcting code, which is highly robust against weakly correlated bit-flip noise, and we analyze the code's performance using a belief-propagation decoding algorithm. Our observations may also apply to more general encoding schemes and noise models
    corecore