Related papers: The PPKN Gate: An Optimal 1-Toffoli Input-Preservi…

The problem of finding efficient decompositions of multi-qubit gates is of importance for quantum computing, especially, in application to existing noisy intermediate-scale quantum devices, whose resources are substantially limited. Here we…

Quantum image computing has emerged as a groundbreaking field, revolutionizing how we store and process data at speeds incomparable to classical methods. Nevertheless, as image sizes expand, so does the complexity of qubit connections,…

In this paper we show that it is possible to adapt a qudit scheme for creating a controlled-Toffoli created by Ralph et al. [Phys. Rev. A 75 011213] to be applicable to qubits. While this scheme requires more gates than standard schemes for…

The controlled-SWAP and controlled-controlled-NOT gates are at the heart of the original proposal of reversible classical computation by Fredkin and Toffoli. Their widespread use in quantum computation, both in the implementation of…

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…

The simplest decomposition of a Toffoli gate acting on three qubits requires {\em five} 2-qubit gates. If we restrict ourselves to controlled-sign (or controlled-NOT) gates this number climbs to six. We show that the number of…

We present a comprehensive end-to-end quantum algorithm for tensor problems, including tensor PCA and planted kXOR, that achieves potential superquadratic quantum speedups over classical methods. We build upon prior works by…

Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…

We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate…

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 improve the Toffoli count of low depth quantum adders, and analyze how their spacetime cost reacts to having a limited number of magic state factories. We present a block lookahead adder that parallelizes across blocks of bits of size…

This paper is motivated by two key observations. First, Toffoli ladders can be implemented in three distinct ways: with linear or polylogarithmic depth using no ancilla, or with logarithmic depth using ancilla qubits. Second, two…

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…

Reversible logic has applications in low-power computing and quantum computing. However, there are few existing designs for reversible floating-point adders and none suitable for quantum computation. In this paper we propose a…

We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic, and 3) Barrett reduction. Each multiplier…

Reversible computation has been proposed as a future paradigm for energy efficient computation, but so far few implementations have been realised in practice. Quantum circuits, running on quantum computers, are one construct known to be…

Physical implementation of scalable quantum architectures faces an immense challenge in form of fragile quantum states. To overcome it, quantum architectures with fault tolerance is desirable. This is achieved currently by using surface…

Toponomic quantum computing (TQC) employs rotation sequences of anticoherent $k$-planes to construct noise-tolerant quantum gates. In this work, we demonstrate the implementation of generalized Toffoli gates, using $k$-planes of spin…

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…

Transversal gates are logical gate operations on encoded quantum information that are efficient in gate count and depth, and are designed to minimize error propagation. Efficient encoding circuits for quantum codes that admit transversal…