Stable Toffoli Gate on Fixed-Frequency Superconducting Qutrits

The development of noisy intermediate-scale quantum (NISQ) devices has extended the scope of executable quantum circuits with high-fidelity single- and two-qubit gates. Equipping NISQ devices with three-qubit gates will enable the realization of more complex quantum algorithms and efficient quantum error correction protocols with reduced circuit depth. Several three-qubit gates have been implemented for superconducting qubits, but their use in gate synthesis has been limited due to their low fidelity. Here, using fixed-frequency superconducting qubits, we demonstrate a high-fidelity iToffoli gate based on two-qubit interactions, the so-called cross-resonance effect. As with the Toffoli gate, this three-qubit gate can be used to perform universal quantum computation. The iToffoli gate is implemented by simultaneously applying microwave pulses to a linear chain of three qubits, revealing a process fidelity as high as 98.26(2)%. Moreover, we numerically show that our gate scheme can produce additional three-qubit gates which provide more efficient gate synthesis than the Toffoli and iToffoli gates. Our work not only brings a high-fidelity iToffoli gate to current superconducting quantum processors but also opens a pathway for developing multi-qubit gates based on two-qubit interactions.

The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a single-step implementation of arbitrary $n$-bit Toffoli gates (up to a local change of basis), based on resonantly driving a single qubit that has a strong Ising coupling to $n$ other qubits. The setup in the two-qubit case turns out to be identical to the universal Barenco gate. The gate time and error are, in theory, independent of the number of control qubits, scaling better than conventional circuit decompositions. We note that our assumptions, namely strongly coupling $n+1$ qubits and a driving frequency that scales with $n$, may break down for large systems. Still, our protocol could enhance the capabilities of intermediate scale quantum computers, and we discuss the prospects of implementing our protocol on trapped ions, Rydberg atoms, and on superconducting circuits. Simulations of the latter platform show that the Toffoli gate with two control bits attains fidelities of above 0.98 even in the presence of decoherence. We also show how similar ideas can be used to make a series of controlled-\textsc{not}-gates in a single step. We show how these can speed up the implementation of quantum error correcting codes and we simulate the encoding steps of the three-qubit bit-flip code and the seven-qubit Steane code.

Unlike classical digital computers in which a bit can represent either 1 or 0 at any time, quantum computers use a two-level system, i.e., a qubit, to implement logical operations based on quantum mechanical laws, which can represent both values at once. Owing to the superposition property of qubits, quantum computers have natural parallel processing advantages and thus have potential to exceed the computational efficiency of classical computers for particular tasks. Quantum logic gates are the generalization of classical logic gates in computational networks. It has been proved that two-qubit quantum gates together with one-qubit quantum gates are adequate for constructing networks with any possible quantum computational property. Directional couplers are the most critical elementsfor constructing the quantum gates. In recent years, photonic quantum technologies have emerged as a promising experimental platform for quantum computing. Single photons have robust noise resistance, long coherence time, high transmission speed and great compatibility with other systems. They can be easily manipulated and encoded in any of several degrees of freedom, for example, polarization, path, spatial mode or time bin. Optical waveguide technology enables the realizing of complex optical schemes comprised of many elements with desired scalability, stability and miniaturization. Femtosecond laser direct writing of waveguide has been adopted as a powerful tool for integrated quantum photonics with characteristics of rapidness, cost-effectiveness, mask-less and single-step process. In particular, it has the ability to build arbitrary three-dimensional circuits directly inside bulk materials, which is impossible to achieve with conventional lithography. In this article we review the femtosecond laser writing and quantum characterization of directional coupler and important one-qubit and two-qubit optical quantum logic gates, such as Hadamard gate, Pauli-X gate, controlled-NOT gate, and controlled-Phase gate. The qubits in these gates are usually encoded through optical paths or polarizations of photons. The key to the realization of polarization-encoded one-qubit gates is to achieve flexible wave-plate operations, which is described in detail. Controlled-NOT gate and controlled-phase gate are the most crucial two-qubit gates in the linear optics computation and sometimes they can be converted into each other by adding some one-qubit gates or special superposition states. Many different kinds of waveguide circuits have been used to implement these two-qubit gates. The outlook and challenges for the femtosecond laser writing of three-qubit gates, such as Toffoli gate and Fredkin gate, are briefly introduced.

Two-qubit gates are important components of quantum computing. However, unwanted interactions between qubits (so-called parasitic gates) can be particularly problematic and degrade the performance of quantum applications. In this work, we present two software methods to mitigate parasitic two-qubit gate errors. The first approach is built upon the Cartan’s KAK decomposition and keeps the original unitary decomposition for the error-free native two-qubit gate. It counteracts a parasitic two-qubit gate by only applying single-qubit rotations and therefore has no two-qubit gate overhead. We show the optimal choice of single-qubit mitigation gates. The second approach applies a numerical optimisation algorithm to re-compile a target unitary into the error-parasitic two-qubit gate plus single-qubit gates. We demonstrate these approaches on the CPhase-parasitic iSWAP-like gates. The KAK-based approach helps decrease unitary infidelity by a factor of 3 compared to the noisy implementation without error mitigation. When arbitrary single-qubit rotations are allowed, recompilation could completely mitigate the effect of parasitic errors but may require more native gates than the KAK-based approach. We also compare their average gate fidelity under realistic noise models, including relaxation and depolarising errors. Numerical results suggest that different approaches are advantageous in different error regimes, providing error mitigation guidance for near-term quantum computers.

Besides noticeable challenges in implementing low-error single- and two-qubit quantum gates in superconducting quantum processors, the readout technique and analysis are a key factor in determining the efficiency and performance of quantum processors. Being able to efficiently implement quantum algorithms involving entangling gates and asses their output is mandatory for quantum utility. In a transmon-based 5-qubit superconducting quantum processor, we compared the performance of quantum circuits involving an increasing level of complexity, from single-qubit circuits to maximally entangled Bell circuits. This comparison highlighted the importance of the readout analysis and helped us optimize the protocol for more advanced quantum algorithms. Here, we report the results obtained from the analysis of the outputs of quantum circuits using two readout paradigms, referred to as “multiplied readout probabilities” and “conditional readout probabilities.” The first method is suitable for single-qubit circuits, while the second is essential for accurately interpreting the outputs of circuits involving two-qubit gates.

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- and two-qubit gates. Apart from the initial dressing of the internal qubit states with vibrational phonons and the final restoration of the phonon ground state, our technique requires the application of just a single composite pulse on the target qubit and is applicable both in and outside the Lamb-Dicke regime. We design special narrowband composite pulses, which suppress all transitions but the conditional transition of the target qubit; moreover, these composite pulses significantly improve the spatial addressing selectivity.

The discrete logarithm problem (DLP) plays an important role in modern cryptography since it cannot be efficiently solved on a classical computer. Currently, the DLP based on the hyperelliptic curve of genus 2 (HCDLP) is widely used in industry and also a research field of hot interest. At the same time, quantum computing, a new paradigm for computing based on quantum mechanics, provides the ability to solve certain hard problems that cannot be efficiently solved on classical computers. In this paper, we consider the problem of solving the HCDLP in the paradigm of quantum computing. We propose a quantum algorithm for solving the HCDLP by applying the framework of quantum algorithm designed by Shor. The key of the algorithm is the realization of divisor addition. We solve the key problem and get analytical results for divisor addition by geometric meaning of the group addition. Therefore, the procedure can be efficiently realized on a quantum computer using the basic modular arithmetic operations. Finally, we conclude that the HCDLP defined over an n-bit prime field $$\mathbb {F}_{p}$$ can be computed on a quantum computer with at most $$13n+2\lfloor \log _{2}n\rfloor +10$$ qubits using $$2624n^{3} \log _{2}n-2209.2n^{3} + 1792n^{2} \log _{2}n-3012.8n^{2}$$ Toffoli gates. For current parameters at comparable classical security levels, there are fewer qubits and Toffoli gates to solve the HCDLP than the ones to solve the DLP based on elliptic curves.

Molecular nanomagnets are attractive candidate qubits because of their wide inter- and intra-molecular tunability. Uniform magnetic pulses could be exploited to implement one- and two-qubit gates in presence of a properly engineered pattern of interactions, but the synthesis of suitable and potentially scalable supramolecular complexes has proven a very hard task. Indeed, no quantum algorithms have ever been implemented, not even a proof-of-principle two-qubit gate. Here we show that the magnetic couplings in two supramolecular {Cr7Ni}-Ni-{Cr7Ni} assemblies can be chemically engineered to fit the above requisites for conditional gates with no need of local control. Microscopic parameters are determined by a recently developed many-body ab-initio approach and used to simulate quantum gates. We find that these systems are optimal for proof-of-principle two-qubit experiments and can be exploited as building blocks of scalable architectures for quantum simulation.

Controlled quantum gates play a crucial role in enabling quantum universal operations by facilitating interactions between qubits. Direct implementation of three-qubit gates simplifies the design of quantum circuits, thereby being conducive to performing complex quantum algorithms. Here, we propose and present an experimental demonstration of a quantum Toffoli gate fully exploiting the polarization and orbital angular momentum of a single photon. The Toffoli gate is implemented using the polarized diffractive neural networks scheme, achieving a mean truth table visibility of 97.27±0.20%. We characterize the gate's performance through quantum state tomography on 216 different input states and quantum process tomography, which yields a process fidelity of 94.05±0.02%. Our method offers a novel approach for realizing the Toffoli gate without requiring exponential optical elements while maintaining extensibility to the implementation of other three-qubit gates.

Quantum lower bounds for the Goldreich–Levin problem

Quantum logic gates with many control qubits are essential in many quantum algorithms, but remain challenging to perform in current experiments. Trapped ion quantum computers natively feature the Mølmer–Sørensen (MS) entangling operation, which effectively applies an Ising interaction to all pairs of qubits at the same time. We consider a sequence of equal all-to-all MS operations, interleaved with single-qubit gates that act only on one special qubit. Using a connection with quantum signal processing techniques, we find that it is possible to perform an arbitray SU(2) rotation on the special qubit if and only if all other qubits are in the state . Such controlled rotation gates with N − 1 control qubits require 2N applications of the MS gate, and can be mapped to a conventional Toffoli gate by demoting a single qubit to ancilla.

Gate control of donor electrons near interfaces is a generic ingredient of donor-based quantum computing. Here, we address the question: how is the phonon-assisted qubit relaxation time T1 affected as the electron is shuttled between the donor and the interface? We focus on the example of the ‘flip-flop qubit’ (Tosi et al arXiv:1509.08538v1), defined as a combination of the nuclear and electronic states of a phosphorus donor in silicon, promising fast electrical control and long dephasing times when the electron is halfway between the donor and the interface. We theoretically describe orbital relaxation, flip-flop relaxation, and electron spin relaxation. We estimate that the flip-flop qubit relaxation time can be of the order of 100 μs, 8 orders of magnitude shorter than the value for an on-donor electron in bulk silicon, and a few orders of magnitude shorter (longer) than the predicted inhomogeneous dephasing time (gate times). All three relaxation processes are boosted by (i) the nontrivial valley structure of the electron–phonon interaction, and (ii) the different valley compositions of the involved electronic states.

Course 9 Solid state quantum bit circuits

Quantum circuits utilizing real time feedback techniques (such as active reset and mid-circuit measurement) are a powerful tool for NISQ-era quantum computing. Such techniques are crucial for implementing error correction protocols, and can reduce the resource requirements of certain quantum algorithms. Realizing these capabilities requires flexible, low-latency classical control. We present the development of an open-source FPGA (field-programmable gate array) based processor for pulse-level qubit control. Our processor is designed primarily as an upgrade to QubiC, an open source qubit control platform, but can also be adapted to other systems. The processor is distributed in nature, with one core per arbitrary waveform generator (AWG); simplifying the design and allowing for straightforward scaling. Each processor core implements an instruction set consisting of timed pulse commands as well as simple arithmetic and branching instructions. Our design also includes interfaces for synchronizing the different cores and requesting/receiving (optionally processed) measurement results. Together, these features will allow a user to program arbitrary control flow within a quantum circuit based on previous measurement results. In this poster, we detail our design along with the expected resource utilization on the Xilinx Virtex 7 FPGA, and present pulse-level simulations of our system in the context of a simple feedback experiment.

Ultracold trapped atomic ions excited into highly energetic Rydberg states constitute a promising platform for scalable quantum information processing. Elementary building blocks for such tasks are high-fidelity and sufficiently fast entangling two-qubit gates, which can be achieved via strong dipole–dipole interactions between microwave-dressed Rydberg ions, as recently demonstrated experimentally (Zhang et al 2020 Nature 580 345). We theoretically investigate the performance of three protocols leading to controlled-phase gate operations. Starting from a microscopic description of Rydberg ions in a linear Paul trap, we derive an effective Hamiltonian that faithfully captures the essential dynamics underlying the gate protocols. We then use an optimization scheme to fine-tune experimentally controllable parameters like laser detuning and Rabi frequency to yield maximal gate fidelity under each studied protocol. We show how non-adiabatic transitions resulting from fast laser driving relative to the characteristic time scales of the system detrimentally affect the fidelity. Despite this, we demonstrate that in the realistic scenario of Rydberg ions with finite radiative lifetimes, optimizing the best found gate protocol enables achievement of fidelities as high as 99.25 % for a gate time of 0.2 μ s . This considerably undercuts entangling gate durations between ground state ions, for which gate times are typically limited by the comparably slower time scales of vibrational modes. Overall, this places trapped Rydberg ions into the regime where fast high-accuracy quantum computing and eventually quantum error correction become possible.