Related papers: A CCCZ gate performed with 6 T gates

Reducing delay, power consumption, and chip area of a logic circuit are the main targets of a designer. Most of the times, the designer sacrifices power consumption and chip area to improve delay for a given technology node. To overcome…

Many universal reversible libraries that contain more than one gate type have been proposed in the literature. Practical implementation of reversible circuits is much easier if a single gate type is used in the circuit construction. This…

Efficient arithmetic operations are a prerequisite for practical quantum computing. Optimization efforts focus on two primary metrics: Quantum Cost (QC), determined by the number of non-linear gates, and Logical Depth, which defines the…

With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting codes designed to address a single dominant error type.…

We present numerical results which show how two-bit logic gates can be used in the design of a quantum computer. We show that the Toffoli gate, which is a universal gate for all classical reversible computation, can be implemented using a…

We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits constructed from $c$ instances of Clifford gates and $t$ arbitrary-angle $Z$-rotation gates such as $T$ gates. Our algorithms complement each…

The color code has been invaluable for the development of the theory of fault-tolerant logic gates using transversal rotations. Three-dimensional examples of the color code have shown us how its structure, specifically the intersection of…

Multiplier circuits play an important role in reversible computation, which is helpful in diverse areas such as low power CMOS design, optical computing, DNA computing and bioinformatics. Here we propose a new reversible multiplier circuit…

We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed…

We consider the decomposition of arbitrary isometries into a sequence of single-qubit and Controlled-NOT (C-NOT) gates. In many experimental architectures, the C-NOT gate is relatively 'expensive' and hence we aim to keep the number of…

Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…

Controllable interaction between superconducting qubits is desirable for large-scale quantum computation and simulation. Here, based on a theoretical proposal by Yan et al. [Phys. Rev. Appl. 10, 054061 (2018)] we experimentally demonstrate…

Quantum computation requires high-fidelity single-qubit and two-qubit gates on a scalable platform. Silicon spin qubits are a promising platform toward realization of this goal. In this paper we show how to perform single-qubit and CZ gates…

With the successful demonstration of transversal CNOTs in many recent experiments, it is the right moment to examine its implications on one of the most critical parts of fault-tolerant computation -- magic state preparation. Using an…

Totally self-checking (TSC) circuits are synthesised with a grid of computers running a distributed population based stochastic optimisation algorithm. The presented method is the first to automatically synthesise TSC circuits from…

Benchmarking large-scale quantum gates, typically involving multiple native two-qubit and singlequbit gates, is crucial in quantum computing. Global fidelity, encompassing information about intergate correlations, offers a comprehensive…

A recurrence scheme is presented to decompose an $n$-qubit unitary gate to the product of no more than $N(N-1)/2$ single qubit gates with small number of controls, where $N = 2^n$. Detailed description of the recurrence steps and formulas…

Effective quantum information processing is tantamount in part to the minimization the quantum resources needed by quantum logic gates. Here, we propose an optimization of an n-controlled-qubit Fredkin gate with a maximum of 2n+1 two-qubit…

We provide a method for compiling approximate multi-controlled single qubit gates into quantum circuits without ancilla qubits. The total number of elementary gates to decompose an n-qubit multi-controlled gate is proportional to 32n, and…

The paper discusses the gate complexity of reversible circuits with the small number of additional inputs consisting of NOT, CNOT and 2-CNOT gates. We study Shannon's gate complexity function $L(n, q)$ for a reversible circuit implementing…