Demonstrating a Continuous Set of Two-Qubit Gates for Near-Term Quantum Algorithms

Dynamics of magnetization at infinite temperature in a Heisenberg spin chain

Understanding universal aspects of quantum dynamics is an unresolved problem in statistical mechanics. In particular, the spin dynamics of the one-dimensional Heisenberg model were conjectured as to belong to the Kardar-Parisi-Zhang (KPZ) universality class based on the scaling of the infinite-temperature spin-spin correlation function. In a chain of 46 superconducting qubits, we studied the probability distribution of the magnetization transferred across the chain's center, [Formula: see text]. The first two moments of [Formula: see text] show superdiffusive behavior, a hallmark of KPZ universality. However, the third and fourth moments ruled out the KPZ conjecture and allow for evaluating other theories. Our results highlight the importance of studying higher moments in determining dynamic universality classes and provide insights into universal behavior in quantum systems.

Physics-Constrained Hardware-Efficient Ansatz on Quantum Computers That Is Universal, Systematically Improvable, and Size-Consistent

Variational wave function ansätze are at the heart of solving quantum many-body problems in physics and chemistry. Previous designs of hardware-efficient ansatz (HEA) on quantum computers are largely based on heuristics and lack rigorous theoretical foundations. In this work, we introduce a physics-constrained approach for designing HEA with rigorous theoretical guarantees by imposing a few fundamental constraints. Specifically, we require that the target HEA to be universal, systematically improvable, and size-consistent, which is an important concept in quantum many-body theories for scalability but has been overlooked in previous designs of HEA. We extend the notion of size-consistency to HEA and present a concrete realization of HEA that satisfies all these fundamental constraints while only requiring linear qubit connectivity. The developed physics-constrained HEA is superior to other heuristically designed HEA in terms of both accuracy and scalability, as demonstrated numerically for the Heisenberg model and some typical molecules. In particular, we find that restoring size-consistency can significantly reduce the number of layers needed to reach a certain accuracy. In contrast, the failure of other HEA to satisfy these constraints severely limits their scalability to larger systems with more than 10 qubits. Our work highlights the importance of incorporating physical constraints into the design of HEA for efficiently solving many-body problems on quantum computers.

Variational quantum eigensolver for closed-shell molecules with non-bosonic corrections

The realization of quantum advantage with noisy-intermediate-scale quantum (NISQ) machines has become one of the major challenges in computational sciences. Maintaining coherence of a physical system with more than ten qubits is a critical challenge that motivates research on compact system representations to reduce algorithm complexity. Toward this end, the variational quantum eigensolver (VQE) used to perform quantum simulations is considered to be one of the most promising algorithms for quantum chemistry in the NISQ era. We investigate reduced mapping of one spatial orbital to a single qubit to analyze the ground state energy in a way that the Pauli operators of qubits are mapped to the creation/annihilation of singlet pairs of electrons. To include the effect of non-bosonic (or non-paired) excitations, we introduce a simple correction scheme in the electron correlation model approximated by the geometrical mean of the bosonic (or paired) terms. Employing it in a VQE algorithm, we assess ground state energies of H2O, N2, and Li2O in good agreement with full configuration interaction (FCI) models respectively, using only 6, 8, and 12 qubits with quantum gate depths proportional to the squares of the qubit counts. With the adopted seniority-zero approximation that uses only one half of the qubit counts of a conventional VQE algorithm, we find that our non-bosonic correction method reaches reliable quantum chemistry simulations at least for the tested systems.

Bridging physical intuition and hardware efficiency for correlated electronic states: the local unitary cluster Jastrow ansatz for electronic structure

A prominent goal in quantum chemistry is to solve the molecular electronic structure problem for ground state energy with high accuracy. While classical quantum chemistry is a relatively mature field, the accurate and scalable prediction of strongly correlated states found, e.g., in bond breaking and polynuclear transition metal compounds remains an open problem. Within the context of a variational quantum eigensolver, we propose a new family of ansatzes which provides a more physically appropriate description of strongly correlated electrons than a unitary coupled cluster with single and double excitations (qUCCSD), with vastly reduced quantum resource requirements. Specifically, we present a set of local approximations to the unitary cluster Jastrow wavefunction motivated by Hubbard physics. As in the case of qUCCSD, exactly computing the energy scales factorially with system size on classical computers but polynomially on quantum devices. The local unitary cluster Jastrow ansatz removes the need for SWAP gates, can be tailored to arbitrary qubit topologies (e.g., square, hex, and heavy-hex), and is well-suited to take advantage of continuous sets of quantum gates recently realized on superconducting devices with tunable couplers. The proposed family of ansatzes demonstrates that hardware efficiency and physical transparency are not mutually exclusive; indeed, chemical and physical intuition regarding electron correlation can illuminate a useful path towards hardware-friendly quantum circuits.

Measurement-induced entanglement and teleportation on a noisy quantum processor

Measurement has a special role in quantum theory1: by collapsing the wavefunction, it can enable phenomena such as teleportation2 and thereby alter the 'arrow of time' that constrains unitary evolution. When integrated in many-body dynamics, measurements can lead to emergent patterns of quantum information in space-time3-10 that go beyond the established paradigms for characterizing phases, either in or out of equilibrium11-13. For present-day noisy intermediate-scale quantum (NISQ) processors14, the experimental realization of such physics can be problematic because of hardware limitations and the stochastic nature of quantum measurement. Here we address these experimental challenges and study measurement-induced quantum information phases on up to 70 superconducting qubits. By leveraging the interchangeability of space and time, we use a duality mapping9,15-17 to avoid mid-circuit measurement and access different manifestations of the underlying phases, from entanglement scaling3,4 to measurement-induced teleportation18. We obtain finite-sized signatures of a phase transition with a decoding protocol that correlates the experimental measurement with classical simulation data. The phases display remarkably different sensitivity to noise, and we use this disparity to turn an inherent hardware limitation into a useful diagnostic. Our work demonstrates an approach to realizing measurement-induced physics at scales that are at the limits of current NISQ processors.

Dynamics of Dispersive Measurements of Flux-Qubit States: Energy-Level Splitting Connected to Quantum Wave Mechanics

Superconducting flux qubits have many advantages as a storage of quantum information, such as broad range tunability of frequency, small-size fabricability, and high controllability. In the flux qubit-oscillator, qubits are connected to SQUID resonators for the purpose of performing dispersive non-destructive readouts of qubit signals with high fidelity. In this work, we propose a theoretical model for analyzing quantum characteristics of a flux qubit-oscillator on the basis of quantum solutions obtained using a unitary transformation approach. The energy levels of the combined system (qubit + resonator) are analyzed in detail. Equally spaced each energy level of the resonator splits into two parts depending on qubit states. Besides, coupling of the qubit to the resonator brings about an additional modification in the split energy levels. So long as the coupling strength and the tunnel splitting are not zero but finite values, the energy-level splitting of the resonator does not disappear. We conclude that quantum nondemolition dispersive measurements of the qubit states are possible by inducing bifurcation of the resonator states through the coupling.

Efficient noise mitigation technique for quantum computing

Quantum computers have enabled solving problems beyond the current machines' capabilities. However, this requires handling noise arising from unwanted interactions in these systems. Several protocols have been proposed to address efficient and accurate quantum noise profiling and mitigation. In this work, we propose a novel protocol that efficiently estimates the average output of a noisy quantum device to be used for quantum noise mitigation. The multi-qubit system average behavior is approximated as a special form of a Pauli Channel where Clifford gates are used to estimate the average output for circuits of different depths. The characterized Pauli channel error rates, and state preparation and measurement errors are then used to construct the outputs for different depths thereby eliminating the need for large simulations and enabling efficient mitigation. We demonstrate the efficiency of the proposed protocol on four IBM Q 5-qubit quantum devices. Our method demonstrates improved accuracy with efficient noise characterization. We report up to 88% and 69% improvement for the proposed approach compared to the unmitigated, and pure measurement error mitigation approaches, respectively.

Suppressing quantum errors by scaling a surface code logical qubit

Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction^1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10^-6 logical error per cycle floor set by a single high-energy event (1.6 × 10^-7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.

Experimental Realization of Two Qutrits Gate with Tunable Coupling in Superconducting Circuits

Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. In many cases, such qubits are actually made out of multilevel systems but with only two states being used for computational purpose. While such a strategy has the advantage of being in line with the common binary logic, it in some sense wastes the ready-for-use resources in the large Hilbert space of these intrinsic multidimensional systems. Quantum computation beyond qubits (e.g., using qutrits or qudits) has thus been discussed and argued to be more efficient than its qubit counterpart in certain scenarios. However, one of the essential elements for qutrit-based quantum computation, two-qutrit quantum gate, remains a major challenge. In this Letter, we propose and demonstrate a highly efficient and scalable two-qutrit quantum gate in superconducting quantum circuits. Using a tunable coupler to control the cross-Kerr coupling between two qutrits, our scheme realizes a two-qutrit conditional phase gate with fidelity 89.3% by combining simple pulses applied to the coupler with single-qutrit operations. We further use such a two-qutrit gate to prepare an EPR state of two qutrits with a fidelity of 95.5%. Our scheme takes advantage of a tunable qutrit-qutrit coupling with a large on:off ratio. It therefore offers both high efficiency and low crosstalk between qutrits, thus being friendly for scaling up. Our Letter constitutes an important step toward scalable qutrit-based quantum computation.

Deterministic controlled enhancement of local quantum coherence

We investigate assisted enhancement of quantum coherence in a bipartite setting with control and target systems, which converts the coherence of the control qubit into the enhanced coherence of the target qubit. We assume that only incoherent operations and measurements can be applied locally and classical information can be exchanged. In addition, the two subsystems are also coupled by a fixed Hamiltonian whose interaction strength can be controlled. This coupling does not generate any local coherence from incoherent input states. We show that in this setting a measurement and feed-forward based protocol can deterministically enhance the coherence of the target system while fully preserving its purity. The protocol can be iterated and several copies of the control state can be consumed to drive the target system arbitrarily close to a maximally coherent state. We experimentally demonstrate this protocol with a photonic setup and observe the enhancement of coherence for up to five iterations of the protocol.

Experimental quantum adversarial learning with programmable superconducting qubits

Quantum computing promises to enhance machine learning and artificial intelligence. However, recent theoretical works show that, similar to traditional classifiers based on deep classical neural networks, quantum classifiers would suffer from adversarial perturbations as well. Here we report an experimental demonstration of quantum adversarial learning with programmable superconducting qubits. We train quantum classifiers, which are built on variational quantum circuits consisting of ten transmon qubits featuring average lifetimes of 150 μs, and average fidelities of simultaneous single- and two-qubit gates above 99.94% and 99.4%, respectively, with both real-life images (for example, medical magnetic resonance imaging scans) and quantum data. We demonstrate that these well-trained classifiers (with testing accuracy up to 99%) can be practically deceived by small adversarial perturbations, whereas an adversarial training process would substantially enhance their robustness to such perturbations.

Adaptive Problem Solving Dynamics in Gate-Model Quantum Computers

Gate-model quantum computer architectures represent an implementable model used to realize quantum computations. The mathematical description of the dynamical attributes of adaptive problem solving and iterative objective function evaluation in a gate-model quantum computer is currently a challenge. Here, a mathematical model of adaptive problem solving dynamics in a gate-model quantum computer is defined. We characterize a canonical equation of adaptive objective function evaluation of computational problems. We study the stability of adaptive problem solving in gate-model quantum computers.

Absolutely Stable Spatiotemporal Order in Noisy Quantum Systems

We introduce a model of nonunitary quantum dynamics that exhibits infinitely long-lived discrete spatiotemporal order robust against any unitary or dissipative perturbation. Ergodicity is evaded by combining a sequence of projective measurements with a local feedback rule that is inspired by Toom's "north-east-center" classical cellular automaton. The measurements in question only partially collapse the wave function of the system, allowing some quantum coherence to persist. We demonstrate our claims using numerical simulations of a Clifford circuit in two spatial dimensions which allows access to large system sizes, and also present results for more generic dynamics on modest system sizes. We also devise explicit experimental protocols realizing this dynamics using one- and two-qubit gates that are available on present-day quantum computing platforms.

Fixed-point oblivious quantum amplitude-amplification algorithm

The quantum amplitude amplification algorithms based on Grover’s rotation operator need to perform phase flips for both the initial state and the target state. When the initial state is oblivious, the phase flips will be intractable, and we need to adopt oblivious amplitude amplification algorithm to handle. Without knowing exactly how many target items there are, oblivious amplitude amplification also suffers the “soufflé problem”, in which iterating too little “undercooks” the state and too much “overcooks” the state, both resulting in a mostly non-target final state. In this work, we present a fixed-point oblivious quantum amplitude-amplification (FOQA) algorithm by introducing damping based on methods proposed by A. Mizel. Moreover, we construct the quantum circuit to implement our algorithm under the framework of duality quantum computing. Our algorithm can avoid the “soufflé problem”, meanwhile keep the square speedup of quantum search, serving as a subroutine to improve the performance of quantum algorithms containing oblivious amplitude amplification procedure.

Optimal Control of Families of Quantum Gates

Quantum optimal control (QOC) enables the realization of accurate operations, such as quantum gates, and supports the development of quantum technologies. To date, many QOC frameworks have been developed, but those remain only naturally suited to optimize a single targeted operation at a time. We extend this concept to optimal control with a continuous family of targets, and demonstrate that an optimization based on neural networks can find families of time-dependent Hamiltonians realizing desired classes of quantum gates in minimal time.

Digital quantum simulation of Floquet symmetry-protected topological phases

Quantum many-body systems away from equilibrium host a rich variety of exotic phenomena that are forbidden by equilibrium thermodynamics. A prominent example is that of discrete time crystals^1–8, in which time-translational symmetry is spontaneously broken in periodically driven systems. Pioneering experiments have observed signatures of time crystalline phases with trapped ions^9,10, solid-state spin systems^11–15, ultracold atoms^16,17 and superconducting qubits^18–20. Here we report the observation of a distinct type of non-equilibrium state of matter, Floquet symmetry-protected topological phases, which are implemented through digital quantum simulation with an array of programmable superconducting qubits. We observe robust long-lived temporal correlations and subharmonic temporal response for the edge spins over up to 40 driving cycles using a circuit of depth exceeding 240 and acting on 26 qubits. We demonstrate that the subharmonic response is independent of the initial state, and experimentally map out a phase boundary between the Floquet symmetry-protected topological and thermal phases. Our results establish a versatile digital simulation approach to exploring exotic non-equilibrium phases of matter with current noisy intermediate-scale quantum processors²¹.

Signatures of non-equilibrium Floquet SPT phases with a programmable superconducting quantum processor are observed in which the discrete time translational symmetry only breaks at the boundaries and not in the bulk.

Experimental Measurement of Out-of-Time-Ordered Correlators at Finite Temperature

Out-of-time-ordered correlators (OTOCs) are a key observable in a wide range of interconnected fields including many-body physics, quantum information science, and quantum gravity. Measuring OTOCs using near-term quantum simulators will extend our ability to explore fundamental aspects of these fields and the subtle connections between them. Here, we demonstrate an experimental method to measure OTOCs at finite temperatures and use the method to study their temperature dependence. These measurements are performed on a digital quantum computer running a simulation of the transverse field Ising model. Our flexible method, based on the creation of a thermofield double state, can be extended to other models and enables us to probe the OTOC's temperature-dependent decay rate. Measuring this decay rate opens up the possibility of testing the fundamental temperature-dependent bounds on quantum information scrambling.

Fundamental Physics and Computation: The Computer-Theoretic Framework

The central goal of this manuscript is to survey the relationships between fundamental physics and computer science. We begin by providing a short historical review of how different concepts of computer science have entered the field of fundamental physics, highlighting the claim that the universe is a computer. Following the review, we explain why computational concepts have been embraced to interpret and describe physical phenomena. We then discuss seven arguments against the claim that the universe is a computational system and show that those arguments are wrong because of a misunderstanding of the extension of the concept of computation. Afterwards, we address a proposal to solve Hempel’s dilemma using the computability theory but conclude that it is incorrect. After that, we discuss the relationship between the proposals that the universe is a computational system and that our minds are a simulation. Analysing these issues leads us to proposing a new physical principle, called the principle of computability, which claims that the universe is a computational system (not restricted to digital computers) and that computational power and the computational complexity hierarchy are two fundamental physical constants. On the basis of this new principle, a scientific paradigm emerges to develop fundamental theories of physics: the computer-theoretic framework (CTF). The CTF brings to light different ideas already implicit in the work of several researchers and provides a new view on the universe based on computer theoretic concepts that expands the current view. We address different issues regarding the development of fundamental theories of physics in the new paradigm. Additionally, we discuss how the CTF brings new perspectives to different issues, such as the unreasonable effectiveness of mathematics and the foundations of cognitive science.

Realizing topologically ordered states on a quantum processor

[Figure: see text].

Hardware-Efficient Microwave-Activated Tunable Coupling between Superconducting Qubits

Generating high-fidelity, tunable entanglement between qubits is crucial for realizing gate-based quantum computation. In superconducting circuits, tunable interactions are often implemented using flux-tunable qubits or coupling elements, adding control complexity and noise sources. Here, we realize a tunable ZZ interaction between two transmon qubits with fixed frequencies and fixed coupling, induced by driving both transmons off resonantly. We show tunable coupling over 1 order of magnitude larger than the static coupling, and change the sign of the interaction, enabling cancellation of the idle coupling. Further, this interaction is amenable to large quantum processors: the drive frequency can be flexibly chosen to avoid spurious transitions, and because both transmons are driven, it is resilient to microwave cross talk. We apply this interaction to implement a controlled phase (CZ) gate with a gate fidelity of 99.43(1)% as measured by cycle benchmarking, and we find the fidelity is limited by incoherent errors.

Information scrambling in quantum circuits

[Figure: see text].

Hybrid quantum investment optimization with minimal holding period

In this paper we propose a hybrid quantum-classical algorithm for dynamic portfolio optimization with minimal holding period. Our algorithm is based on sampling the near-optimal portfolios at each trading step using a quantum processor, and efficiently post-selecting to meet the minimal holding constraint. We found the optimal investment trajectory in a dataset of 50 assets spanning a 1 year trading period using the D-Wave 2000Q processor. Our method is remarkably efficient, and produces results much closer to the efficient frontier than typical portfolios. Moreover, we also show how our approach can easily produce trajectories adapted to different risk profiles, as typically offered in financial products. Our results are a clear example of how the combination of quantum and classical techniques can offer novel valuable tools to deal with real-life problems, beyond simple toy models, in current NISQ quantum processors.

Demonstration of a High-Fidelity cnot Gate for Fixed-Frequency Transmons with Engineered ZZ Suppression

Improving two-qubit gate performance and suppressing cross talk are major, but often competing, challenges to achieving scalable quantum computation. In particular, increasing the coupling to realize faster gates has been intrinsically linked to enhanced cross talk due to unwanted two-qubit terms in the Hamiltonian. Here, we demonstrate a novel coupling architecture for transmon qubits that circumvents the standard relationship between desired and undesired interaction rates. Using two fixed frequency coupling elements to tune the dressed level spacings, we demonstrate an intrinsic suppression of the static ZZ while maintaining large effective coupling rates. Our architecture reveals no observable degradation of qubit coherence (T_{1},T_{2}>100  μs) and, over a factor of 6 improvement in the ratio of desired to undesired coupling. Using the cross-resonance interaction, we demonstrate a 180 ns single-pulse controlled not (cnot) gate, and measure a cnot fidelity of 99.77(2)% from interleaved randomized benchmarking.

Tunable Coupling Architecture for Fixed-Frequency Transmon Superconducting Qubits

Implementation of high-fidelity 2-qubit operations is a key ingredient for scalable quantum error correction. In superconducting qubit architectures, tunable buses have been explored as a means to higher-fidelity gates. However, these buses introduce new pathways for leakage. Here we present a modified tunable bus architecture appropriate for fixed-frequency qubits in which the adiabaticity restrictions on gate speed are reduced. We characterize this coupler on a range of 2-qubit devices, achieving a maximum gate fidelity of 99.85%. We further show the calibration is stable over one day.

Exponential suppression of bit or phase errors with cyclic error correction

Realizing the potential of quantum computing requires sufficiently low logical error rates¹. Many applications call for error rates as low as 10⁻¹⁵ (refs. ^2–9), but state-of-the-art quantum platforms typically have physical error rates near 10⁻³ (refs. ^10–14). Quantum error correction^15–17 promises to bridge this divide by distributing quantum logical information across many physical qubits in such a way that errors can be detected and corrected. Errors on the encoded logical qubit state can be exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold and stable over the course of a computation. Here we implement one-dimensional repetition codes embedded in a two-dimensional grid of superconducting qubits that demonstrate exponential suppression of bit-flip or phase-flip errors, reducing logical error per round more than 100-fold when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analysing error correlations with high precision, allowing us to characterize error locality while performing quantum error correction. Finally, we perform error detection with a small logical qubit using the 2D surface code on the same device^18,19 and show that the results from both one- and two-dimensional codes agree with numerical simulations that use a simple depolarizing error model. These experimental demonstrations provide a foundation for building a scalable fault-tolerant quantum computer with superconducting qubits.

Repetition codes running many cycles of quantum error correction achieve exponential suppression of errors with increasing numbers of qubits.

Removing leakage-induced correlated errors in superconducting quantum error correction

Quantum computing can become scalable through error correction, but logical error rates only decrease with system size when physical errors are sufficiently uncorrelated. During computation, unused high energy levels of the qubits can become excited, creating leakage states that are long-lived and mobile. Particularly for superconducting transmon qubits, this leakage opens a path to errors that are correlated in space and time. Here, we report a reset protocol that returns a qubit to the ground state from all relevant higher level states. We test its performance with the bit-flip stabilizer code, a simplified version of the surface code for quantum error correction. We investigate the accumulation and dynamics of leakage during error correction. Using this protocol, we find lower rates of logical errors and an improved scaling and stability of error suppression with increasing qubit number. This demonstration provides a key step on the path towards scalable quantum computing.

Scalable distributed gate-model quantum computers

A scalable model for a distributed quantum computation is a challenging problem due to the complexity of the problem space provided by the diversity of possible quantum systems, from small-scale quantum devices to large-scale quantum computers. Here, we define a model of scalable distributed gate-model quantum computation in near-term quantum systems of the NISQ (noisy intermediate scale quantum) technology era. We prove that the proposed architecture can maximize an objective function of a computational problem in a distributed manner. We study the impacts of decoherence on distributed objective function evaluation.

Resource prioritization and balancing for the quantum internet

The quantum Internet enables networking based on the fundamentals of quantum mechanics. Here, methods and procedures of resource prioritization and resource balancing are defined for the quantum Internet. We define a model for resource consumption optimization in quantum repeaters, and a strongly-entangled network structure for resource balancing. We study the resource-balancing efficiency of the strongly-entangled structure. We prove that a strongly-entangled quantum network is two times more efficient in a resource balancing problem than a full-mesh network of the traditional Internet.

Implementation of Conditional Phase Gates Based on Tunable ZZ Interactions

High fidelity two-qubit gates exhibiting low cross talk are essential building blocks for gate-based quantum information processing. In superconducting circuits, two-qubit gates are typically based either on rf-controlled interactions or on the in situ tunability of qubit frequencies. Here, we present an alternative approach using a tunable cross-Kerr-type ZZ interaction between two qubits, which we realize with a flux-tunable coupler element. We control the ZZ-coupling rate over 3 orders of magnitude to perform a rapid (38 ns), high-contrast, low leakage (0.14±0.24%) conditional phase CZ gate with a fidelity of 97.9±0.7% as measured in interleaved randomized benchmarking without relying on the resonant interaction with a noncomputational state. Furthermore, by exploiting the direct nature of the ZZ coupling, we easily access the entire conditional phase gate family by adjusting only a single control parameter.

High-Fidelity, High-Scalability Two-Qubit Gate Scheme for Superconducting Qubits

High-quality two-qubit gate operations are crucial for scalable quantum information processing. Often, the gate fidelity is compromised when the system becomes more integrated. Therefore, a low-error-rate, easy-to-scale two-qubit gate scheme is highly desirable. Here, we experimentally demonstrate a new two-qubit gate scheme that exploits fixed-frequency qubits and a tunable coupler in a superconducting quantum circuit. The scheme requires less control lines, reduces cross talk effect, and simplifies calibration procedures, yet produces a controlled-Z gate in 30 ns with a high fidelity of 99.5%, derived from the interleaved randomized benchmarking method. Error analysis shows that gate errors are mostly coherence limited. Our demonstration paves the way for large-scale implementation of high-fidelity quantum operations.