Related papers: The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality

The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality

URL: http://arxiv.org/abs/2307.10095v2
Date: Fri, 1 Sep 2023 06:08:22 GMT
Title: The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality
Authors: Patrick Roy (University of Oxford), John van de Wetering (University of Amsterdam), Lia Yeh (University of Oxford)
Abstract summary: We show how to generalise all the phase-free qudit rules to qudits. We prove that circuits of |0>-controlled X and Hadamard gates are approximately universal for qudit quantum computing for any odd prime d.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: We introduce the qudit ZH-calculus and show how to generalise all the phase-free qubit rules to qudits. We prove that for prime dimensions d, the phase-free qudit ZH-calculus is universal for matrices over the ring Z[e^2(pi)i/d]. For qubits, there is a strong connection between phase-free ZH-diagrams and Toffoli+Hadamard circuits, a computationally universal fragment of quantum circuits. We generalise this connection to qudits, by finding that the two-qudit |0>-controlled X gate can be used to construct all classical reversible qudit logic circuits in any odd qudit dimension, which for qubits requires the three-qubit Toffoli gate. We prove that our construction is asymptotically optimal up to a logarithmic term. Twenty years after the celebrated result by Shi proving universality of Toffoli+Hadamard for qubits, we prove that circuits of |0>-controlled X and Hadamard gates are approximately universal for qudit quantum computing for any odd prime d, and moreover that phase-free ZH-diagrams correspond precisely to such circuits allowing post-selections.

Related papers

Completeness of the ZX-calculus [0.3655021726150367]
We give the first complete axiomatisation of the ZX-calculus for the overall pure qubit quantum mechanics. This paves the way for automated pictorial quantum computing, with the aid of some software like Quantomatic.
arXiv Detail & Related papers (2022-09-29T16:01:47Z)
A Complete Equational Theory for Quantum Circuits [58.720142291102135]
We introduce the first complete equational theory for quantum circuits. Two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations.
arXiv Detail & Related papers (2022-06-21T17:56:31Z)
Building Qutrit Diagonal Gates from Phase Gadgets [0.0]
We present the flexsymmetric variant of the original qutrit ZX-calculus, which allows for rewriting that is closer in spirit to the original (qubit) ZX-calculus. We devise new qutrit-specific tricks to extend the graphical Fourier theory of qubits, resulting in a translation between the 'additive' phase gadgets and a'multiplicative' counterpart. We show how both types of control can be implemented for any qutrit Z or X phase gate, ancilla-free, and using only Clifford and phase gates.
arXiv Detail & Related papers (2022-04-28T17:44:40Z)
LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits [58.720142291102135]
We introduce the LOv-calculus, a graphical language for reasoning about linear optical quantum circuits. Two LOv-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the LOv-calculus.
arXiv Detail & Related papers (2022-04-25T16:59:26Z)
Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z)
Completeness of the ZH-calculus [0.0]
We study the ZH-calculus, an alternative graphical language of string diagrams. We find a set of simple rewrite rules for this calculus and show it is complete with respect to matrices over $mathbbZ[frac12]$. We construct an extended version of the ZH-calculus that is complete with respect to matrices over any ring $R$ where $1+1$ is not a zero-divisor.
arXiv Detail & Related papers (2021-03-11T11:22:51Z)
The principle of majorization: application to random quantum circuits [68.8204255655161]
Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
arXiv Detail & Related papers (2021-02-19T16:07:09Z)
QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z)
Universal topological quantum computation with strongly correlated Majorana edge modes [7.930410828384357]
Majorana-based quantum gates are not complete for performing universal topological quantum computation. We show the application to Shor's integer factorization algorithm.
arXiv Detail & Related papers (2020-04-07T12:03:14Z)
PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations [77.34726150561087]
We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. We equip the language with an equational theory, which is proved to be sound and complete. We consider applications like the implementation of controlled permutations and the unrolling of loops.
arXiv Detail & Related papers (2020-02-21T16:15:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.