Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"ZX calculus"”.

  1. Completeness of the ZX-calculus

    <p>The ZX-calculus is an intuitive but also mathematically strict graphical language for quantum computing, which is especially powerful for the framework of quantum circuits. Completeness of the ZX-calculus means any equality of matrices with size powers of n can be derived purely …

    oxford Repository record for Completeness of the ZX-calculus (opens in a new tab)

  2. Completeness and the ZX-calculus

    … <p>In this thesis, I consider the ZX-calculus, a graphical language for pure state qubit quantum mechanics. I show that it is complete for pure state stabilizer quantum mechanics, so any problem within this fragment of quantum theory can be fully analysed using graphical methods. …

    oxford Repository record for Completeness and the ZX-calculus (opens in a new tab)

  3. Graphical CSS Code Transformation Using ZX Calculus

    … by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps associated with different codes. As a motivating example, we give explicit transformations between the Steane code and the quantum Reed-Muller …

    waterloo Repository record for Graphical CSS Code Transformation Using ZX Calculus (opens in a new tab)

  4. Preservation of determinism in MBQC under ZX-calculus rewrites

    The ZX-calculus is a powerful graphical language for reasoning about and optimizing quantum computations, being able to represent and rewrite both quantum circuits and measurement-based quantum computations (MBQCs) in a natural way, along with acting as a tool to translate between the two …

    birmingham Download PDF for Preservation of determinism in MBQC under ZX-calculus rewrites (opens in a new tab)

  5. Novel methods for classical simulation of quantum circuits via ZX-calculus

    … Recent years have seen the graphical language of ZX-calculus applied to this problem, with a particular growing body of research utilising its benefits to discover more efficient stabiliser decompositions. This in turn reduces the growth rate of the exponential time complexity, thereby rendering …

    oxford Repository record for Novel methods for classical simulation of quantum circuits via ZX-calculus (opens in a new tab)

  6. Logic in Dynamical Stabilizer Quantum Error Correction Codes

    … between quantum error correction and the ZX-calculus, a graphical representation of quantum processes. This direction has proved to be fruitful. For example, it has allowed the development of new dynamical codes. However, logic within such codes has not yet been tackled. In this thesis, we …

    waterloo Repository record for Logic in Dynamical Stabilizer Quantum Error Correction Codes (opens in a new tab)

  7. Completeness of the ZW and ZX calculi

    … two quantum motivated graphical calculi, the ZW calculus and ZX calculus. These two calculi are intended to perform qubit calculations using string diagrams. Both calculi are universal in the sense that they are able to represent all qubit maps, but they lack the completeness which means that …

    oxford Repository record for Completeness of the ZW and ZX calculi (opens in a new tab)

  8. Computational complexity perspective on graphical calculi for quantum computation

    Diagrammatic reasoning via languages such as ZX Calculus is a powerful tool in theoretical quantum computing. However, physical quantum computers do not understand diagrams and require explicit quantum circuits as inputs. Finding a circuit equivalent to the given diagram is known as circuit …

    birmingham Download PDF for Computational complexity perspective on graphical calculi for quantum computation (opens in a new tab)

  9. Classifying reversible logic gates with ancillary bits

    … to and from the angle-free fragment of the ZX-calculus, and showing that these translations are inverse to each other.

    calgary Repository record for Classifying reversible logic gates with ancillary bits (opens in a new tab)

  10. Bicategorical aspects of topological quantum computation

    … mechanics (CQM). Given the qubit-based graphical calculus accompanying CQM, called the ZX-calculus, we present the details of the ZX-representation of Fibonacci and Ising anyons. Finally, we propose a bicategorical approach to convene anyonic theory and TQC in one (bi)category.</p> <p>In the …

    oxford Repository record for Bicategorical aspects of topological quantum computation (opens in a new tab)

  11. Hopf-Frobenius algebras

    … algebra.Hopf-Frobenius algebras are present in ZX-calculus, a model for quantum circuits, and the category of linear relations, which is used to model signal-flow graphs and graphical linear algebra. Both of these are exemplary examples of how string diagrams can be used, and the algebras are …

    strathclyde Repository record for Hopf-Frobenius algebras (opens in a new tab)

  12. Categorical quantum dynamics

    … have been a fundamental ingredient of the ZX calculus, one of the most successful fragments of Categorical Quantum Mechanics (CQM). In this thesis, we show that strong complementarity plays a vastly greater role in quantum theory.</p> <p>Firstly, we use strong complementarity to introduce …

    oxford Repository record for Categorical quantum dynamics (opens in a new tab)

  13. Scaling quantum compilation with graph rewriting

    … reasoning over quantum computations (such as the ZX calculus) with IR-based program transformation techniques from classical compiler design.<br><br>Building upon this foundation, the thesis tackles two critical scaling problems hindering the adoption of GTS in quantum compilers. First, it …

    oxford Repository record for Scaling quantum compilation with graph rewriting (opens in a new tab)

  14. Homology, Hopf algebras and quantum code surgery

    … We relate the surgery procedures to the qudit ZX-calculus, a graphical language for reasoning about qudit quantum computing.</p> <p>Returning to the Kitaev model with non-Abelian <em>G</em>, we then provide a systematic treatment of boundaries based on subgroups <em>K</em> ⊆ <em>G</em> with the …

    oxford Repository record for Homology, Hopf algebras and quantum code surgery (opens in a new tab)