We investigate the feasibility of single-shot Toffoli- and Fredkin-gate realizations in qubit arrays with Heisenberg-type exchange interactions between adjacent qubits. As follows from the Lie-algebraic criteria of controllability, such an array is rendered completely controllable---equivalent to allowing universal quantum computation---by a Zeeman-like control field with two orthogonal components acting on a single ``actuator'' qubit. Adopting this local-control setting, we start our analysis with piecewise-constant control fields and determine the global maxima of the relevant figure of merit (target-gate fidelity) by combining the multistart-based clustering algorithm and quasi-Newton type local optimization. We subsequently introduce important practical considerations, such as finite frequency bandwidth of realistic fields and their leakage away from the actuator. We find the shortest times required for high-fidelity Toffoli- and Fredkin-gate realizations and provide comparisons to their respective two-qubit counterparts---controlled-not and exponential-swap. In particular, the Toffoli-gate time compares much more favorably to that of controlled-not than in the standard decomposition-based approach. This study indicates that the use of the single-shot approach can alleviate the burden on control-generating hardware in future experimental realizations of multiqubit gates.
We investigate the feasibility of single-shot Toffoli- and Fredkin-gate realizations in qubit arrays with Heisenberg-type exchange interactions between adjacent qubits. As follows from the Lie-algebraic criteria of controllability, such an array is rendered completely controllable---equivalent to allowing universal quantum computation---by a Zeeman-like control field with two orthogonal components acting on a single ``actuator'' qubit. Adopting this local-control setting, we start our analysis with piecewise-constant control fields and determine the global maxima of the relevant figure of merit (target-gate fidelity) by combining the multistart-based clustering algorithm and quasi-Newton type local optimization. We subsequently introduce important practical considerations, such as finite frequency bandwidth of realistic fields and their leakage away from the actuator. We find the shortest times required for high-fidelity Toffoli- and Fredkin-gate realizations and provide comparisons to their respective two-qubit counterparts---controlled-not and exponential-swap. In particular, the Toffoli-gate time compares much more favorably to that of controlled-not than in the standard decomposition-based approach. This study indicates that the use of the single-shot approach can alleviate the burden on control-generating hardware in future experimental realizations of multiqubit gates.
We explore the feasibility of realizing Dicke states in qubit arrays with always-on isotropic Heisenberg coupling between adjacent qubits, assuming a single Zeeman-type control acting in the z direction on an actuator qubit. The Lie-algebraic criteria of controllability imply that such an array is not completely controllable, but satisfies the conditions for subspace controllability on any subspace with a fixed number of excitations. Therefore, a qubit array described by the model under consideration is state-to-state controllable for an arbitrary choice of initial and final states that have the same Hamming weight. This limited controllability is exploited here for the time-efficient dynamical generation of an a-excitation Dicke state ∣DaN⟩ (a=1,2,…,N−1) in a linear array with N qubits starting from a generic Hamming-weight-a product state. To dynamically generate the desired Dicke states -- including W states ∣WN⟩ as their special (a=1) case -- in the shortest possible time with a single local Z control, we employ an optimal-control scheme based on the {\em dressed chopped random basis} (dCRAB) algorithm. We optimize the target-state fidelity over the expansion coefficients of smoothly-varying control fields in a truncated random Fourier basis; this is done by combining Nelder-Mead-type local optimizations with the multistart-based clustering algorithm that facilitates searches for global extrema. In this manner, we obtain the optimal control fields for Dicke-state preparation in arrays with up to 9 qubits. Based on our numerical results, we find that the shortest possible state-preparation times scale as O(N2.08) for W states and O(N1.78) for a=2 Dicke states.
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 (nontopological) quantum error correction. Currently Toffoli gates are achieved by decomposing into sequentially implemented single- and two-qubit gates, which require much longer times and yields lower overall fidelities compared to a single-shot implementation. We develop a quantum-control procedure to construct a single-shot Toffoli gate for three nearest-neighbor-coupled superconducting transmon systems such that the fidelity is 99.9% and is as fast as an entangling two-qubit gate under the same realistic conditions. The gate is achieved by a nongreedy quantum control procedure using our enhanced version of the differential evolution algorithm.
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations. In combination with a drift Hamiltonian containing interactions between the qubits, this allows the implementation of arbitrary gate operations. Here, we demonstrate an alternative scheme that does not require local control for all qubits: we implement one- and two-qubit gate operations on a set of target qubits indirectly, through a combination of gates on directly controlled actuator qubits with a drift Hamiltonian that couples actuator and target qubits. Experiments are performed on nuclear spins, using radio-frequency pulses as gate operations and magnetic-dipole couplings for the drift Hamiltonian.
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 with two control and one target qubit, using currently existing superconducting hardware. We show numerical evidence for a process fidelity over 99.5% and a gate time of 450 ns for superconducting qubits interacting via tunable couplers. Our method can straight forwardly be extended to implement gates with more than two control qubits at similar fidelities.
Exchange-only (EO) qubits, implemented in triple-quantum-dot systems, offer a compelling platform for scalable semiconductor-based quantum computing by enabling universal control through purely exchange interactions. While high-fidelity single- and two-qubit gates have been demonstrated, the synthesis of efficient multiqubit operations—such as the Toffoli gate—remains a key bottleneck. Conventional gate decompositions into elementary operations lead to prohibitively long and error-prone pulse sequences, limiting practical deployment. In this work, we introduce a gradient-based optimization algorithm, Jenga-Krotov (JK), tailored to discover compact, high-fidelity EO gate sequences. Applying JK to the Toffoli gate, we reduce the number of required exchange unitaries from 216 (in direct decomposition) to 92, and compress the time steps required from 162 to 50, all while maintaining target fidelity. Under realistic noise, the accumulated gate error from our optimized sequence is an order of magnitude lower than that of conventional approaches. We have also applied the JK algorithm to other multiqubit gates and algorithm. For the Fredkin gate, it reduces the number of time steps from 200 to 104 and the number of exchange unitaries from 276 to 172. For the quantum Fourier transform, it compresses the sequence from 180 to 80 time steps and from 237 to 202 exchange unitaries. These results demonstrate that the JK algorithm is a general and scalable strategy for multiqubit gate synthesis in EO architectures, potentially facilitating realization of multiqubit algorithms on semiconductor platforms.
We study the realization of a Toffoli gate with superconducting qubits in a circuit-quantum-electrodynamics 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 noncomputational states of a physical qubit is heavily suppressed, we theoretically predict that in the absence of decoherence and leakage, within 75 ns a Toffoli gate can be realized with intrinsic fidelities higher than 90 while fidelities above 99 can be reached in about 140 ns.