The question of finding a lower bound on the number of Toffoli gates in a classical reversible circuit is addressed. A method based on quantum information concepts is proposed. The method involves solely concepts from quantum information - there is no need for an actual physical quantum computer. The method is illustrated on the example of classical Shannon data compression.
The paper introduces dual Toffoli and Peres reversible gates, which operate under disjunctive control, and shows their functionality based on the Barenco et al. quantum model. Both uniform and mixed polarity are considered for the controls. Rewriting rules are presented, which provide a possible reduction of the number of gates and quantum cost of reversible (sub)circuits using standard Toffoli or Peres gates. Finally, a Clifford+T realization of a dual Toffoli and a dual Peres gate is shown, which may be used when mapping reversible circuits to the IBM quantum computers.
The Toffoli gate is an essential logic element, which permits implementation of a reversible processor. It is of relevance both for classical as well as quantum logics. We propose and theoretically study all-optical implementations of three-bit and four-bit Toffoli gates by application of adiabatic population transfer techniques. For a three-bit Toffoli gate we use variants of stimulated Raman adiabatic passage (STIRAP) processes in a $Λ$-type level scheme, driven by two laser pulses at sufficiently large detunings. For the implementation of a four-bit Toffoli gate, we apply reversible adiabat…
This paper presents novel techniques for the synthesis of reversible networks of Toffoli gates, as well as improvements to previous methods. Gate count and technology oriented cost metrics are used. Our synthesis techniques are independent of the cost metrics. Two new iterative synthesis procedure employing Reed-Muller spectra are introduced and shown to complement earlier synthesis approaches. The template simplification suggested in earlier work is enhanced through introduction of a faster and more efficient template application algorithm, updated (shorter) classification of the templates, a…
We present an n-bit Toffoli gate quantum circuit based on the realization proposed by Barenco, where some of the Toffoli gates in their construction are replaced with Peres gates. This results in a significant cost reduction. Our main contribution is a quantum circuit which simulates the (m+1)-bit Toffoli gate with 32m-96 elementary quantum gates and one garbage bit which is passed unchanged. This paper is a corrected and expanded version of our recent journal publication.
Quantum controlled-logic gates, including controlled NOT gate and Toffoli gate, play critical roles in lots of quantum information processing schemes. We design and experimentally demonstrate deterministic Toffoli gate by utilizing orbital-angular-momentum and polarization degrees of freedom of a single photon. In addition, we generate Bell states by using the controlled NOT gate. The effective conversion rate of the Toffoli gate in our experiment is $(95.1\pm3.2)\%$. Furthermore, our experimental setup does not require any auxiliary photons and probabilistic post selections.
Unitary operations are expressed in the quantum circuit model as a finite sequence of elementary gates, such as controlled-not gates and single qubit gates. We prove that the simplified Toffoli gate by Margolus, which coincides with the Toffoli gate up to a single change of sign, cannot be realized with less than three controlled-not gates. If the circuit is implemented with three controlled-not gates, then at least four additional single qubit gates are necessary. This proves that the implementation suggested by Margolus is optimal.
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 = \exp(iπσ^z/8)$ gates, whereas conventional circuits require seven $T$ gates. An extension of this result is that adding $n$ control inputs to a controlled gate requires $4n$ $T$ gates, whereas the best prior result was $8n$. The second contribution is a quantum circuit for the Toffoli gate which can detect a single $σ^z$ error occurring with probability $p$ in any one of ei…
We present an error-detected hyperparallel Toffoli (hyper-Toffoli) gate for a three-photon system based on the interface between polarized photon and cavity-nitrogen-vacancy(NV) center system. This hyper-Toffoli gate can be used to perform double Toffoli gate operations simultaneously on both the polarization and spatial-mode degrees of freedom (DoFs) of a three-photon system with a low decoherence, shorten operation time, and less quantum resources required, in compared with those on two independent three-photon systems in one DoF only. As the imperfect cavity-NV-center interactions are trans…
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 quantum computers by more than an order of magnitude. The procedure uses Clifford operations and 64 copies of the non-Clifford gate $T = \exp[i π(I - σ^z) /8]$. Quantum codes detect errors in the circuit. When the dominant source of error is $T$-gate failure with probability $p$, then the composite Toffoli circuit has postselected failure rate of $3072p^4$ to…
In this paper, we settle the long-standing open problem of the minimum cost of two-qubit gates for simulating a Toffoli gate. More precisely, we show that five two-qubit gates are necessary. Before our work, it is known that five gates are sufficient and only numerical evidences have been gathered, indicating that the five-gate implementation is necessary. The idea introduced here can also be used to solve the problem of optimal simulation of three-qubit control phase introduced by Deutsch in 1989.
Qubitization is a modern approach to estimate Hamiltonian eigenvalues without simulating its time evolution. While in this way approximation errors are avoided, its resource and gate requirements are more extensive: qubitization requires additional qubits to store information about the Hamiltonian, and Toffoli gates to probe them throughout the routine. Recently, it was shown that storing the Hamiltonian in a unary representation can alleviate the need for such gates in one of the qubitization subroutines. Building on that principle, we develop an entirely new decomposition of the entire algor…
Compared with the idea of universal quantum computation, a direct synthesis of a multiqubit logic gate can greatly improve the efficiency of quantum information processing tasks. Here we propose an efficient scheme to implement a three-qubit controlled-not (Toffoli) gate of neutral atoms based on unconventional Rydberg pumping. By adjusting the strengths of Rabi frequencies of driving fields, the Toffoli gate can be achieved within one step, which is also insensitive to the fluctuation of the Rydberg-Rydberg interaction. Considering different atom alignments, we can obtain a high-fidelity Toff…
We discuss a simple architecture for a quantum Toffoli gate implemented using three trapped ions. The gate, which in principle can be implemented with a single laser-induced operation, is effective under rather general conditions and is strikingly robust (within any experimentally realistic range of values) against dephasing, heating and random fluctuations of the Hamiltonian parameters. We provide a full characterization of the unitary and noise-affected gate using three-qubit quantum process tomography.
For certain quantum architectures and algorithms, most of the required resources are consumed during the distillation of one-qubit magic states for use in performing Toffoli gates. I show that the overhead for magic-state distillation can be reduced by merging distillation with the implementation of Toffoli gates. The resulting routine distills 8 one-qubit magic states directly to a Toffoli state, which can be used without further magic to perform a Toffoli gate.
Recently, reversible circuit synthesis has been intensively studied. One of the problems that has not been solved for a long time was exact minimization of gate count (GC) in 4-bit circuits. Finally, last year a tool of practical usage for finding optimal gate count Toffoli networks for any 4-variable function was developed. However, not much work has been done yet on exact minimization of quantum cost (QC) in 4-bit circuits. This paper presents an application of the above mentioned tool to reducing QC of 4-bit reversible circuits. It is shown that for benchmarks and for designs taken from rec…
We design linear optics multiqubit quantum logic gates. We assume the traditional encoding of a qubit onto state of a single photon in two modes (e.g. spatial or polarization). We suggest schemes allowing direct probabilistic realization of the fundamental Toffoli and Fredkin gates without resorting to a sequence of single- and two-qubit gates. This yields more compact schemes and potentially reduces the number of ancilla photons. The proposed setups involve passive linear optics, sources of auxiliary single photons or maximally entangled pairs of photons, and single-photon detectors. In parti…
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 controlled-sign gates required to implement a Toffoli gate can be reduced to just {\em three} if one of the three quantum systems has a third state that is accessible during the computation, i.e. is actually a qutrit. Such a requirement is not unreasonable or even atypical since we often artificially enforce a qubit structure on multilevel quantums systems (eg. atoms, ph…
The reversible implementation of classical functions accounts for the bulk of most known quantum algorithms. As a result, a number of reversible circuit constructions over the Clifford+$T$ gate set have been developed in recent years which use both the state and phase spaces, or $X$ and $Z$ bases, to reduce circuit costs beyond what is possible at the strictly classical level. We study and generalize two particular classes of these constructions: relative phase circuits, including Giles and Selinger's multiply-controlled $iX$ gates and Maslov's $4$ qubit Toffoli gate, and measurement-assisted …
We analyze the multifractality of the fidelity in an engineered Toffoli gate. Using quantum control methods, we define several optimization problems whose global solutions realize the gate in a chain of three qubits with XY Heisenberg interaction. We perturb the system by introducing imperfections in the form of $1/f$ noise to the interqubit couplings. Multifractal analysis shows that the degree of multifractality in the gate fidelity increases when optimized control pulses used to render the fidelity are less sensitive to variations in the interqubits coupling strengths.
Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a 'classical' set of gates quantum universal. In this note we give a few lines proof of this fact relying on Kitaev's universal set of gates, and discuss the meaning of the result.
We examine the detailed scenario for implementing n-control-qubit Toffoli gates and select gates on ion-trap quantum computers, especially those that shuttle ions into interaction zones. We determine expected performance of these gates with realistic parameters for an ion-trap quantum computer and taking into account the time variation of the exchange integrals. This allows us to estimate the errors due to spin-phonon entanglement as well. While there are challenges with implementing these gates, because their performance always has some degree of error, they should be feasible on current hard…
We introduce three compact graph states that can be used to perform a measurement-based Toffoli gate. Given a weighted graph of six, seven or eight qubits, we show that success probabilities of 1/4, 1/2 and 1 respectively can be achieved. Our study puts a measurement-based version of this important quantum logic gate within the reach of current experiments. As the graphs are setup-independent, they could be realized in a variety of systems, including linear optics and ion-traps.
Cavity QED is a versatile tool to explore small scale quantum information processing. Within this setting, we describe a particular protocol for implementing a Toffoli gate with Rydberg atoms and a cavity field. Our scheme uses both resonant and non resonant interactions, and in particular a cavity assisted atomic collision. The experimental feasibility of the protocol is carefully analyzed with the help of numerical simulations and takes into account the decoherence process. Moreover, we show that our protocol is optimal within the constraints imposed by the experimental setting.
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 $C^{2}$-NOT gates simulating a $C^{2m+1}$-NOT operation under the condition $m=2^{n}$ ($n=1,2,...$). The circuit is composed of units called multi-qubits gates (MQGs), each of which performs $m$ $C^{2}$-NOT operations simultaneously on $3m$ qubits. Simultaneous operations eliminate the need to manipulate qubits individually, as required in conventional quantum cir…
We present quantum networks for a n-qubit controlled gate C^{n-1}(U) which use a higher dimensional (qudit) ancilla as a catalyser. In its simplest form the network has only n two-particle gates (qubit-qudit) -- this is the minimum number of two-body interactions needed to couple all n+1 subsystems (n qubits plus one ancilla). This class of controlled gates includes the generalised Toffoli gate C^{n-1}(X) on n qubits, which plays an important role in several quantum algorithms and error correction. A particular example implementing this model is given by the dispersive limit of a generalised J…
It is desirable to implement an efficient quantum information process demanding fewer quantum resources. We designed two compact quantum circuits for determinately implementing four-qubit Toffoli and Fredkin gates on single-photon systems in both the polarization and spatial degrees of freedom (DoFs) via diamond nitrogen-vacancy (NV) centers in resonators. The gates are heralded by the electron spins associated with the diamond NV centers. In contrast to the ones with one DoF, our implementations reduce the quantum resource and are robust against the decoherence. Evaluations of fidelities and …
Quantum algorithms often benefit from the ability to execute multi-qubit (>2) gates. To date such multi-qubit gates are typically decomposed into single- and two-qubit gates, particularly in superconducting qubit architectures. The ability to perform multi-qubit operations in a single step could vastly improve the fidelity and execution time of many algorithms. Here, we propose a single shot method for executing an i-Toffoli gate, a three-qubit gate gate with two control and one target qubit, using currently existing superconducting hardware. We show numerical evidence for a process fidelity o…
We study the realization of a Toffoli gate with superconducting qubits in a circuit-QED setup using quantum-control methods. Starting with optimized piecewise-constant control fields acting on all qubits and typical strengths of XY-type coupling between the qubits, we demonstrate that the optimal gate fidelities are affected only slightly by a "low-pass" filtering of these fields with the typical cutoff frequencies of microwave driving. Restricting ourselves to the range of control-field amplitudes for which the leakage to the non-computational states of a physical qubit is heavily suppressed,…
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 propose a decomposition scheme for a generalized $N$-qubit Toffoli gate with the use of $2N-3$ two-qutrit gates for arbitrary connectivity. The fixed number of the required additional levels (the choice of qutrits is optimal) and the use of the iSWAP gate as a native operation make our approach directly applicable for ongoing experiments with superconductin…
Fault-tolerant quantum computation using quantum error-correcting codes requires fault-tolerant constructions of nontransversal gates. Shor proposed a fault-tolerant construction of a nontransversal gate, i.e., the Toffoli gate for a family of the Calderbank-Shor-Steane codes which has even-weight stabilizer generators and odd-weight logical operators. In fact, as shown in this paper, error propagations in the ancilla preparation of Shor's construction lead to logical errors. This work provides a solution to this problem through the insertion of bit flip error correction. Finally, error rates …
We study the effects of imperfections on the fidelity of the Toffoli gate recently realized in a circuit~QED setup using quantum control methods. The noise is introduced in the interqubits interactions. The coupling constants are no longer fixed; instead, they fluctuate around average values obeying some given probability density functions characterizing the dynamical-imperfection case. We also consider the static-imperfection case in which the values of the coupling constants are not exactly known. We obtain a more robust gate by modifying the quantum optimization problem using a weighted ave…
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 computation, gates acting on more than two qubits can simplify the implementation of complex quantum algorithms[2]. Thus, a single three-qubit operation can replace a complex sequence of two-qubit gates, which in turn promises faster execution with potentially higher Fidelity. One important three-qubit operation is the quantum Toffoli gate which performs a NOT operat…
Optimal synthesis of reversible functions is a non-trivial problem. One of the major limiting factors in computing such circuits is the sheer number of reversible functions. Even restricting synthesis to 4-bit reversible functions results in a huge search space (16! {\approx} 2^{44} functions). The output of such a search alone, counting only the space required to list Toffoli gates for every function, would require over 100 terabytes of storage. In this paper, we present two algorithms: one, that synthesizes an optimal circuit for any 4-bit reversible specification, and another that synthesiz…
We present several different codes and protocols to distill $T$, controlled-$S$, and Toffoli (or $CCZ$) gates. One construction is based on codes that generalize the triorthogonal codes, allowing any of these gates to be induced at the logical level by transversal $T$. We present a randomized construction of generalized triorthogonal codes obtaining an asymptotic distillation efficiency $γ\rightarrow 1$. We also present a Reed-Muller based construction of these codes which obtains a worse $γ$ but performs well at small sizes. Additionally, we present protocols based on checking the stabilizers…
Universal quantum gates and quantum error correction~(QEC) lie in the heart of quantum information science. Large-scale quantum computing depends on a universal set of quantum gates, in which some gates may be easily carried out, while others are hard with a certain physical system. There is a unique three-qubit quantum gate called the Deutsch gate~[$\mathbb{D}(θ)$], from which alone a circuit can be constructed so that any feasible quantum computing is attainable. As far as we know, however, $\mathbb{D}(θ)$ has not been demonstrated. Here we design an easily realizable $\mathbb{D}(θ)$ by usin…
We propose an efficiently measurable lower bound on quantum process fidelity of N-qubit controlled-Z gates. This bound is determined by average output state fidelities for N partially conjugate product bases. A distinct advantage of our approach is that only fidelities with product states need to be measured while keeping the total number of measurements much smaller than what is necessary for full quantum process tomography. As an application, we use this method to experimentally estimate quantum process fidelity F of a three-qubit linear optical quantum Toffoli gate and we find that F>=0.83.…
Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more complex multilevel states -- qudits. Recently, significant attention is paid to the idea of using qudit encoding as a way for further scaling quantum processors. In this work, we present an efficient decomposition of the generalized Toffoli gate on the five-level quantum systems, so-called ququints, that uses ququints' space as the space of two qubits with a joi…
Conditional multi-qubit gates are a key component for elaborate quantum algorithms. In a recent work, Rasmussen et al. (Phys. Rev. A 101, 022308) proposed an efficient single-step method for a prototypical multi-qubit gate, a Toffoli gate, based on a combination of Ising interactions between control qubits and an appropriate driving field on a target qubit. Trapped ions are a natural platform to implement this method, since Ising interactions mediated by phonons have been demonstrated in increasingly large ion crystals. However, the simultaneous application of these interactions and the drivin…
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis. The result of Gottesman and Knill[quant-ph/9807006] implies that any quantum circuit involving only the Controlled-NOT and Hadamard gates can be efficiently simulated by a classical circuit. In contrast, we prove that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal f…
Reversible single-target gates are a generalization of Toffoli gates which are a helpful formal representation for the description of synthesis algorithms but are too general for an actual implementation based on some technology. There is an exponential lower bound on the number of Toffoli gates required to implement any reversible function, however, there is also a linear upper bound on the number of single-target gates which can be proven using a constructive proof based on a former presented synthesis algorithm. Since single-target gates can be mapped to a cascade of Toffoli gates, this syn…
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 gate set for quantum computing. The Toffoli gate is also a key ingredient for (non-topological) quantum error correction. Currently Toffoli gates are achieved by decomposing into sequentially implemented single- and two-qubit gates, which requires much longer times and yields lower overall fidelities compared to a single-shot implementation. We develop a quan…
We propose a scheme of fast three-qubit Toffoli quantum gate for ultracold neutral-atom qubits. The scheme is based on the Stark-tuned three-body Förster resonances, which we have observed in our recent experiment [D.B.Tretyakov et al., Phys.Rev.Lett. 119, 173402 (2017)]. The three-body resonance corresponds to a transition when the three interacting atoms change their states simultaneously, and it occurs at a different dc electric field with respect to the two-body Förster resonance. A combined effect of three-body and two-body Förster interactions in external electric and magnetic fields nea…
