For a number of useful quantum circuits, qudit constructions have been found which reduce resource requirements compared to the best known or best possible qubit construction. However, many of the necessary qutrit gates in these constructions have never been explicitly and efficiently constructed in a fault-tolerant manner. We show how to exactly and unitarily construct any qutrit multiple-controlled Clifford+T unitary using just Clifford+T gates and without using ancillae. The T-count to do so is polynomial in the number of controls $k$, scaling as $O(k^{3.585})$. With our results we can construct ancilla-free Clifford+T implementations of multiple-controlled T gates as well as all versions of the qutrit multiple-controlled Toffoli, while ...
Abstract. We consider quantum circuits composed of Clifford and T gates. In this context the T gate ...
This paper concerns the efficient implementation of quantum circuits for qudits. We show that contro...
Phase gadgets have proved to be an indispensable tool for reasoning about ZX-diagrams, being used in...
A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily...
While implementing a quantum algorithm it is crucial to reduce the quantum resources, in order to ob...
Quantum circuits of a general quantum gate acting on multiple $d$-level quantum systems play a promi...
Fault-tolerant gate sets whose generators belong to the Clifford hierarchy form the basis of many pr...
A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily...
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set...
Gate-based quantum computers typically encode and process information in two-dimensional units calle...
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through ...
Abstract We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford g...
The development of a universal fault-tolerant quantum computer that can solve efficiently various di...
The simplest decomposition of a Toffoli gate acting on 3 qubits requires five 2-qubit gates. If we r...
When visualized as an operation on the Bloch sphere, the qubit "pi-over-eight" gate corresponds to o...
Abstract. We consider quantum circuits composed of Clifford and T gates. In this context the T gate ...
This paper concerns the efficient implementation of quantum circuits for qudits. We show that contro...
Phase gadgets have proved to be an indispensable tool for reasoning about ZX-diagrams, being used in...
A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily...
While implementing a quantum algorithm it is crucial to reduce the quantum resources, in order to ob...
Quantum circuits of a general quantum gate acting on multiple $d$-level quantum systems play a promi...
Fault-tolerant gate sets whose generators belong to the Clifford hierarchy form the basis of many pr...
A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily...
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set...
Gate-based quantum computers typically encode and process information in two-dimensional units calle...
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through ...
Abstract We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford g...
The development of a universal fault-tolerant quantum computer that can solve efficiently various di...
The simplest decomposition of a Toffoli gate acting on 3 qubits requires five 2-qubit gates. If we r...
When visualized as an operation on the Bloch sphere, the qubit "pi-over-eight" gate corresponds to o...
Abstract. We consider quantum circuits composed of Clifford and T gates. In this context the T gate ...
This paper concerns the efficient implementation of quantum circuits for qudits. We show that contro...
Phase gadgets have proved to be an indispensable tool for reasoning about ZX-diagrams, being used in...