31 research outputs found

    Minimal instances for toric code ground states

    Full text link
    A decade ago Kitaev's toric code model established the new paradigm of topological quantum computation. Due to remarkable theoretical and experimental progress, the quantum simulation of such complex many-body systems is now within the realms of possibility. Here we consider the question, to which extent the ground states of small toric code systems differ from LU-equivalent graph states. We argue that simplistic (though experimentally attractive) setups obliterate the differences between the toric code and equivalent graph states; hence we search for the smallest setups on the square- and triangular lattice, such that the quasi-locality of the toric code hamiltonian becomes a distinctive feature. To this end, a purely geometric procedure to transform a given toric code setup into an LC-equivalent graph state is derived. In combination with an algorithmic computation of LC-equivalent graph states, we find the smallest non-trivial setup on the square lattice to contain 5 plaquettes and 16 qubits; on the triangular lattice the number of plaquettes and qubits is reduced to 4 and 9, respectively.Comment: 14 pages, 11 figure

    Constant mean curvature surfaces

    Get PDF
    In this article we survey recent developments in the theory of constant mean curvature surfaces in homogeneous 3-manifolds, as well as some related aspects on existence and descriptive results for HH-laminations and CMC foliations of Riemannian nn-manifolds.Comment: 102 pages, 17 figure

    Coloring Graphs Drawn with Crossings

    Get PDF
    This dissertation will examine various results for graph colorings. It begins by introducing some basic graph theory concepts, focusing on those ideas relevant to graph embeddings, and by introducing terminology to allow a formal discussion of drawings of graphs. Chapter 2 focuses on results for proper colorings of graphs with good drawings, using a previous result from Král and Stacho as inspiration. Chapter 3 expands on the ideas of Chapter 2 and focuses on cyclic colorings of embedded graphs. Chapters 5 and 6 examine results for total and list colorings, respectively, of drawings of graphs. Finally, Chapter 6 introduces generalized pseudosurfaces and examines results for proper and cyclic colorings of graphs embedded in generalized pseudosurfaces

    Subject Index Volumes 1–200

    Get PDF
    corecore