836 research outputs found

    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

    Geometrical relations between space time block code designs and complexity reduction

    Full text link
    In this work, the geometric relation between space time block code design for the coherent channel and its non-coherent counterpart is exploited to get an analogue of the information theoretic inequality I(X;S)≤I((X,H);S)I(X;S)\le I((X,H);S) in terms of diversity. It provides a lower bound on the performance of non-coherent codes when used in coherent scenarios. This leads in turn to a code design decomposition result splitting coherent code design into two complexity reduced sub tasks. Moreover a geometrical criterion for high performance space time code design is derived.Comment: final version, 11 pages, two-colum

    O(N) methods in electronic structure calculations

    Full text link
    Linear scaling methods, or O(N) methods, have computational and memory requirements which scale linearly with the number of atoms in the system, N, in contrast to standard approaches which scale with the cube of the number of atoms. These methods, which rely on the short-ranged nature of electronic structure, will allow accurate, ab initio simulations of systems of unprecedented size. The theory behind the locality of electronic structure is described and related to physical properties of systems to be modelled, along with a survey of recent developments in real-space methods which are important for efficient use of high performance computers. The linear scaling methods proposed to date can be divided into seven different areas, and the applicability, efficiency and advantages of the methods proposed in these areas is then discussed. The applications of linear scaling methods, as well as the implementations available as computer programs, are considered. Finally, the prospects for and the challenges facing linear scaling methods are discussed.Comment: 85 pages, 15 figures, 488 references. Resubmitted to Rep. Prog. Phys (small changes

    Developing the MTO Formalism

    Full text link
    We review the simple linear muffin-tin orbital method in the atomic-spheres approximation and a tight-binding representation (TB-LMTO-ASA method), and show how it can be generalized to an accurate and robust Nth order muffin-tin orbital (NMTO) method without increasing the size of the basis set and without complicating the formalism. On the contrary, downfolding is now more efficient and the formalism is simpler and closer to that of screened multiple-scattering theory. The NMTO method allows one to solve the single-electron Schroedinger equation for a MT-potential -in which the MT-wells may overlap- using basis sets which are arbitrarily minimal. The substantial increase in accuracy over the LMTO-ASA method is achieved by substitution of the energy-dependent partial waves by so-called kinked partial waves, which have tails attached to them, and by using these kinked partial waves at N+1 arbitrary energies to construct the set of NMTOs. For N=1 and the two energies chosen infinitesimally close, the NMTOs are simply the 3rd-generation LMTOs. Increasing N, widens the energy window, inside which accurate results are obtained, and increases the range of the orbitals, but it does not increase the size of the basis set and therefore does not change the number of bands obtained. The price for reducing the size of the basis set through downfolding, is a reduction in the number of bands accounted for and -unless N is increased- a narrowing of the energy window inside which these bands are accurate. A method for obtaining orthonormal NMTO sets is given and several applications are presented.Comment: 85 pages, Latex2e, Springer style, to be published in: Lecture notes in Physics, edited by H. Dreysse, (Springer Verlag

    Quantum holonomies in photonic waveguide systems

    Get PDF
    The thesis at hand deals with the emergence of quantum holonomies in systems of coupled waveguides. Several proposals for their realisation in arrays of laser-written fused-silica waveguides are presented, including experimental results. I develop an operator-theoretic framework for the photon-number independent description of these optical networks. Finally, quantum holonomies will be embedded into schemes for measurement-based quantum computation, with the aim of approximating Jones polynomials.Die vorliegende Arbeit untersucht die Konzipierung von Quantenholonomien in Systemen gekoppelter Wellenleiter. Eine Vielzahl möglicher Realisierungen mittels lasergeschriebener Wellenleiter in Quarzglas wird präsentiert und zugehörige experimentelle Ergebnisse erläutert. Die Entwicklung einer operatortheoretischen Darstellung für die photonenzahlunabhängige Beschreibung dieser optischen Netzwerke wird vorgenommen. Abschließend werden Quantenholonomien für die messinduzierte Quantenberechnung von Jones-Polynomen verwendet
    • …
    corecore