10 research outputs found

    Contextuality as a resource for models of quantum computation on qubits

    Get PDF
    A central question in quantum computation is to identify the resources that are responsible for quantum speed-up. Quantum contextuality has been recently shown to be a resource for quantum computation with magic states for odd-prime dimensional qudits and two-dimensional systems with real wavefunctions. The phenomenon of state-independent contextuality poses a priori an obstruction to characterizing the case of regular qubits, the fundamental building block of quantum computation. Here, we establish contextuality of magic states as a necessary resource for a large class of quantum computation schemes on qubits. We illustrate our result with a concrete scheme related to measurement-based quantum computation.Comment: Published version. We have revised the title, introduction and discussion, as well as slightly simplified the setting in this versio

    Generalized Cluster States Based on Finite Groups

    Get PDF
    We define generalized cluster states based on finite group algebras in analogy to the generalization of the toric code to the Kitaev quantum double models. We do this by showing a general correspondence between systems with CSS structure and finite group algebras, and applying this to the cluster states to derive their generalization. We then investigate properties of these states including their PEPS representations, global symmetries, and relationship to the Kitaev quantum double models. We also discuss possible applications of these states.Comment: 23 pages, 4 figure

    Normalizer Circuits and Quantum Computation

    Full text link
    (Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named normalizer circuit formalism, based on algebraic extensions of the qubit Clifford gates (CNOT, Hadamard and π/4\pi/4-phase gates): a normalizer circuit consists of quantum Fourier transforms (QFTs), automorphism gates and quadratic phase gates associated to a set GG, which is either an abelian group or abelian hypergroup. Though Clifford circuits are efficiently classically simulable, we show that normalizer circuit models encompass Shor's celebrated factoring algorithm and the quantum algorithms for abelian Hidden Subgroup Problems. We develop classical-simulation techniques to characterize under which scenarios normalizer circuits provide quantum speed-ups. Finally, we devise new quantum algorithms for finding hidden hyperstructures. The results offer new insights into the source of quantum speed-ups for several algebraic problems. Our second contribution is an algebraic (group- and hypergroup-theoretic) framework for describing quantum many-body states and classically simulating quantum circuits. Our framework extends Gottesman's Pauli Stabilizer Formalism (PSF), wherein quantum states are written as joint eigenspaces of stabilizer groups of commuting Pauli operators: while the PSF is valid for qubit/qudit systems, our formalism can be applied to discrete- and continuous-variable systems, hybrid settings, and anyonic systems. These results enlarge the known families of quantum processes that can be efficiently classically simulated. This thesis also establishes a precise connection between Shor's quantum algorithm and the stabilizer formalism, revealing a common mathematical structure in several quantum speed-ups and error-correcting codes.Comment: PhD thesis, Technical University of Munich (2016). Please cite original papers if possible. Appendix E contains unpublished work on Gaussian unitaries. If you spot typos/omissions please email me at JLastNames at posteo dot net. Source: http://bit.ly/2gMdHn3. Related video talk: https://www.perimeterinstitute.ca/videos/toy-theory-quantum-speed-ups-based-stabilizer-formalism Posted on my birthda

    Many-body models for topological quantum information

    Get PDF
    We develop and investigate several quantum many-body spin models of use for topological quantum information processing and storage. These models fall into two categories: those that are designed to be more realistic than alternative models with similar phenomenology, and those that are designed to have richer phenomenology than related models. In the first category, we present a procedure to obtain the Hamiltonians of the toric code and Kitaev quantum double models as the perturbative low-energy limits of entirely two-body Hamiltonians. This construction reproduces the target models' behavior using only couplings which are natural in terms of the original Hamiltonians. As an extension of this work, we construct parent Hamiltonians involving only local 2-body interactions for a broad class of Projected Entangled Pair States (PEPS). We define a perturbative Hamiltonian with a finite order low energy effective Hamiltonian that is a gapped, frustration-free parent Hamiltonian for an encoded version of a desired PEPS. For topologically ordered PEPS, the ground space of the low energy effective Hamiltonian is shown to be in the same phase as the desired state to all orders of perturbation theory. We then move on to define models that generalize the phenomenology of several well-known systems. We first define generalized cluster states based on finite group algebras, and investigate properties of these states including their PEPS representations, global symmetries, relationship to the Kitaev quantum double models, and possible applications. Finally, we propose a generalization of the color codes based on finite groups. For non-Abelian groups, the resulting model supports non-Abelian anyonic quasiparticles and topological order. We examine the properties of these models such as their relationship to Kitaev quantum double models, quasiparticle spectrum, and boundary structure
    corecore