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 celeb...
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through ...
We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-dimensional qudits (...
We say that collection of $n$-qudit gates is universal if there exists $N_0\geq n$ such that for eve...
There are various gate sets used for describing quantum computation. A particularly popular one cons...
Gate-based quantum computers typically encode and process information in two-dimensional units calle...
The development of a universal fault-tolerant quantum computer that can solve efficiently various di...
In this paper we study universality for quantum gates acting on qudits.Qudits are states in a Hilber...
Finite-dimensional quantum theory serves as the theoretical foundation for quantum information and c...
Recent developments in qudit-based quantum computing, in particular with trapped ions, open interest...
This paper concerns the efficient implementation of quantum circuits for qudits. We show that contro...
The progress in building quantum computers to execute quantum algorithms has recently been remarkabl...
The use of multilevel information carriers, also known as qudits, is a promising path for exploring ...
The simplest decomposition of a Toffoli gate acting on 3 qubits requires five 2-qubit gates. If we r...
For a number of useful quantum circuits, qudit constructions have been found which reduce resource r...
Quantum computational logics are special examples of quantum logic where formulas are supposed to de...
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through ...
We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-dimensional qudits (...
We say that collection of $n$-qudit gates is universal if there exists $N_0\geq n$ such that for eve...
There are various gate sets used for describing quantum computation. A particularly popular one cons...
Gate-based quantum computers typically encode and process information in two-dimensional units calle...
The development of a universal fault-tolerant quantum computer that can solve efficiently various di...
In this paper we study universality for quantum gates acting on qudits.Qudits are states in a Hilber...
Finite-dimensional quantum theory serves as the theoretical foundation for quantum information and c...
Recent developments in qudit-based quantum computing, in particular with trapped ions, open interest...
This paper concerns the efficient implementation of quantum circuits for qudits. We show that contro...
The progress in building quantum computers to execute quantum algorithms has recently been remarkabl...
The use of multilevel information carriers, also known as qudits, is a promising path for exploring ...
The simplest decomposition of a Toffoli gate acting on 3 qubits requires five 2-qubit gates. If we r...
For a number of useful quantum circuits, qudit constructions have been found which reduce resource r...
Quantum computational logics are special examples of quantum logic where formulas are supposed to de...
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through ...
We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-dimensional qudits (...
We say that collection of $n$-qudit gates is universal if there exists $N_0\geq n$ such that for eve...