Related papers: Practical implementation of Toffoli-based qubit ro…
We propose a direct (non-recursive) algorithm for applying a rotation $R_{\theta^\ast}$, $\epsilon$-close to a desired rotation $R_\theta$, to a single qubit using the Clifford+Toffoli gate set. Our algorithm does not rely on repeatedly…
Quantum dot-based spin qubit realization is one of the most promising quantum computing systems owing to its integrability with classical computation hardware and its versatility in realizing qubits and quantum gates. In this work, we…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
While quantum computing holds great potential in combinatorial optimization, electronic structure calculation, and number theory, the current era of quantum computing is limited by noisy hardware. Many quantum compilation approaches can…
We implement the gate teleportation algorithm for teleporting arbitrary two-qubit Clifford gates and the Toffoli gate within the context of multi-node quantum networks, utilizing the SquidASM quantum network simulator. We show how a gate…
We present an algorithm, along with its implementation that finds T-optimal approximations of single-qubit Z-rotations using quantum circuits consisting of Clifford and T gates. Our algorithm is capable of handling errors in approximation…
Classical simulation of noisy quantum circuits is essential for understanding quantum computing experiments. It enables scalable error characterization, analysis of how noise impacts quantum algorithms, and optimized implementations of…
We introduce a fault-tolerant construction to implement a composite quantum operation of four overlapping Toffoli gates. The same construction can produce two independent Toffoli gates. This result lowers resource overheads in designs for…
The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a…
One of the main challenges in building a quantum processor is to characterize the environmental noise. Noise characterization can be achieved by exploiting different techniques, such as randomization where several sequences of random…
The three-qubit Toffoli gate plays an important role in quantum error correction and complex quantum algorithms such as Shor's factoring algorithm, motivating the search for efficient implementations of this gate. Here we introduce a…
Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
A single-shot Toffoli, or controlled-controlled-NOT, gate is desirable for classical and quantum information processing. The Toffoli gate alone is universal for reversible computing and, accompanied by the Hadamard gate, forms a universal…
High-fidelity multi-qubit gates are a critical resource for near-term quantum computing, as they underpin the execution of both quantum algorithms and fault-tolerant protocols. The Toffoli gate (CCNOT), in particular, plays a central role…
The conventional circuit paradigm, utilizing a limited number of gates to construct arbitrary quantum circuits, is hindered by significant noise overhead. For instance, the standard gate paradigm employs two CNOT gates for the partial…
Prior work of Beverland et al. has shown that any exact Clifford+$T$ implementation of the $n$-qubit Toffoli gate must use at least $n$ $T$ gates. Here we show how to get away with exponentially fewer $T$ gates, at the cost of incurring a…
We present two new constructions for the Toffoli gate which substantially reduce resource costs in fault-tolerant quantum computing. The first contribution is a Toffoli gate requiring Clifford operations plus only four $T =…
A Toffoli gate ($C^{n}$-NOT gate) is regarded as an important unitary gate in quantum computation, and is simulated by a quantum circuit composed of $C^{2}$-NOT gates. This paper presents a quantum circuit with a new configuration of…
Multi-controlled Toffoli gates are fundamental building blocks in quantum computation, with applications in quantum arithmetic, simulation, and search algorithms. In fault-tolerant architectures, their realization is constrained by the high…