Related papers: Ancilla-free Quantum Adder with Sublinear Depth

Proposed configurations for the implementation of graphene-based CNOT and Toffoli gates working at room temperature are presented. These two logic gates, essential for any quantum computing algorithm, involve ballistic Y junctions for qubit…

We present the design of a quantum carry-lookahead adder using measurement-based quantum computation. QCLA utilizes MBQC`s ability to transfer quantum states in unit time to accelerate addition. The quantum carry-lookahead adder (QCLA) is…

The quantum Toffoli gate allows universal reversible classical computation. It is also an important primitive in many quantum circuits and quantum error correction schemes. Here we demonstrate the realization of a Toffoli gate with three…

Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realisation of large-scale quantum algorithms that could lead to extremely impactful scientific or commercial results. Achieving a universal…

We propose a protocol for realizing a Toffoli gate using neutral-atom qubits in optical tweezers. Two ground-state hyperfine levels of the atoms are considered as qubit states. Our method relies on the strong and long-range interactions…

To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This…

Simulating fermionic systems on qubit hardware involves many nonlocal interactions, and efficient routing of these interactions is critical to the overall cost of fermionic simulation algorithms. Recent works reduce this Jordan-Wigner…

It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions…

We focus on the depth optimization of CNOT circuits on hardwares with limited connectivity. We adapt the algorithm from Kutin et al. that implements any $n$-qubit CNOT circuit in depth at most $5n$ on a Linear Nearest Neighbour (LNN)…

Research on quantum computing has recently gained significant momentum since first physical devices became available. Many quantum algorithms make use of so-called oracles that implement Boolean functions and are queried with highly…

An $(n+1)$-bit Toffoli gate is mainly utilized to construct other quantum gates and operators, such as Fredkin gates, arithmetical adders, and logical comparators, where $n \geq 2$. Several researchers introduced different methods to…

Quantum computers require quantum processors. An important part of the processor of any computer is the arithmetic unit, which performs binary addition, subtraction, division and multiplication, however multiplication can be performed using…

The Toffoli gate serving as a basic building block for reversible quantum computation, has manifested its great potentials in improving the error-tolerant rate in quantum communication. While current route to the creation of Toffoli gate…

We present a scalable uniform technique for construction of highly conditional C$^n$-NOT quantum gates of trapped ion qubits, such as the Toffoli gate, without using ancilla states and circuits of an exorbitant number of concatenated one-…

Rapid progress in the design of scalable, robust quantum computing necessitates efficient quantum circuit implementation for algorithms with practical relevance. For several algorithms, arithmetic kernels, in particular, division plays an…

The paper discusses the gate complexity and the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates in the case, when the number of additional inputs is limited. We study Shannon's gate complexity function $L(n, q)$ and…

We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity without qubit overhead, SWAP operations or shuttling. Instead, we leverage the fact that entangling…

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…

A Hadamard-free Clifford transformation is a circuit composed of quantum Phase (P), CZ, and CNOT gates. It is known that such a circuit can be written as a three-stage computation, -P-CZ-CNOT-, where each stage consists only of gates of the…

The rotation of subspaces by a chosen angle is a fundamental quantum computing operation, with applications in error correction and quantum algorithms such as the Quantum Approximate Optimization Algorithm, the Variational Quantum…