Microwave cavities coupled to superconducting qubits have been demonstrated to be a promising platform for quantum information processing. A major challenge in this setup is to realize universal control over the cavity. A promising approach are selective number-dependent arbitrary phase (SNAP) gates combined with cavity displacements. It has been proven that this is a universal gate set, but a central question remained open so far: how can a given target operation be realized efficiently with a sequence of these operations. In this work, we present a practical scheme to address this problem. It involves a hierarchical strategy to insert new gates into a sequence, followed by a co-optimization of the control parameters, which generates short high-fidelity sequences. For a broad range of experimentally relevant applications, we find that they can be implemented with 3 to 4 SNAP gates, compared to up to 50 with previously known techniques.
Microwave cavities coupled to superconducting qubits have been demonstrated to be a promising platform for quantum information processing. A major challenge in this setup is to realize universal control over the cavity. A promising approach are selective number-dependent arbitrary phase (SNAP) gates combined with cavity displacements. It has been proven that this is a universal gate set, but a central question remained open so far: how can a given target operation be realized efficiently with a sequence of these operations. In this work, we present a practical scheme to address this problem. It involves a hierarchical strategy to insert new gates into a sequence, followed by a co-optimization of the control parameters, which generates short high-fidelity sequences. For a broad range of experimentally relevant applications, we find that they can be implemented with 3 to 4 SNAP gates, compared to up to 50 with previously known techniques.
Superconducting cavities with high quality factors, coupled to a fixed-frequency transmon, provide a state-of-the-art platform for quantum information storage and manipulation. The commonly used selective number-dependent arbitrary phase (SNAP) gate faces significant challenges in ultra-high-coherence cavities, where the weak dispersive shifts necessary for preserving high coherence typically result in prolonged gate times. Here, we propose a protocol to achieve high-fidelity SNAP gates that are orders of magnitude faster than the standard implementation, surpassing the speed limit set by the bare dispersive shift. We achieve this enhancement by dynamically amplifying the dispersive coupling via sideband interactions, followed by quantum optimal control on the Floquet-engineered system. We also present a unified perturbation theory that explains both the gate acceleration and the associated benign drive-induced decoherence, corroborated by Floquet-Markov simulations. These results pave the way for the experimental realization of high-fidelity, selective control of weakly coupled, high-coherence cavities, and expanding the scope of optimal control techniques to a broader class of Floquet quantum systems.
The large available Hilbert space and high coherence of cavity resonators make these systems an interesting resource for storing encoded quantum bits. To perform a quantum gate on this encoded information, however, complex nonlinear operations must be applied to the many levels of the oscillator simultaneously. In this work, we introduce the selective number-dependent arbitrary phase (snap) gate, which imparts a different phase to each Fock-state component using an off-resonantly coupled qubit. We show that the snap gate allows control over the quantum phases by correcting the unwanted phase evolution due to the Kerr effect. Furthermore, by combining the snap gate with oscillator displacements, we create a one-photon Fock state with high fidelity. Using just these two controls, one can construct arbitrary unitary operations, offering a scalable route to performing logical manipulations on oscillator-encoded qubits.
We present a function which connects the parameter of a previously published short sequence of selective number-dependent arbitrary phase (SNAP) and displacement gates acting on a qudit encoded into the Fock states of a superconducting cavity, Vk(α)=D(α)Rπ(k)D(−2α)Rπ(k)D(α) to the angle of the Givens rotation G(θ) on levels ∣k⟩,∣k+1⟩ that sequence approximates, namely α=Φ(θ)=4k+1θ. Previous publications left the determination of an appropriate α to numerical optimization at compile time. The map Φ gives us the ability to compile directly any d-dimensional unitary into a sequence of SNAP and displacement gates in O(d3) complex floating point operations with low constant prefactor, avoiding the need for numerical optimization. Numerical studies demonstrate that the infidelity of the generated gate sequence Vk per Givens rotation G scales as approximately O(θ6). We find numerically that the error on compiled circuits can be made arbitrarily small by breaking each rotation into mθ/m rotations, with the full d×d unitary infidelity scaling as approximately O(m−4). This represents a significant reduction in the computational effort to compile qudit unitaries either to SNAP and displacement gates or to generate them via direct low-level pulse optimization via optimal control.
A variety of photon-mediated operations are critical to the realization of scalable quantum information processing platforms and their accurate characterization is essential for the identification of optimal regimes and their experimental realizations. Such light-matter interactions are often studied with a broad variety of analytical and computational methods that are constrained by approximation techniques or by computational scaling. Quantum processors present a new avenue to address these challenges. We consider the case of cavity mediated two-qubit gates. To investigate quantum state transfer between the qubits, we implement simulations with quantum circuits that are able to reliably track the dynamics of the system. Our quantum algorithm, compatible with NISQ (Noisy Intermediate Scale Quantum) era systems, allows us to map out the fidelity of the state transfer operation between qubits as a function of a broad range of system parameters including the respective detunings between the qubits and the cavity, the damping factor of the cavity, and the respective couplings between the qubits and the cavity. The algorithm provides a robust and intuitive solution, alongside a satisfactory agreement with analytical solutions or classical simulation algorithms in their respective regimes of validity. It allows us to identify under-explored regimes of optimal performance, relevant for heterogeneous quantum platforms, where the two-qubit gate can be rather effective between far-detuned qubits that are neither resonant with each other nor with the cavity. Besides its present application, the method introduced in the current paper can be efficiently used in otherwise untractable variations of the model and in various efforts to simulate and optimize photon-mediated two-qubit gates and other relevant operations in quantum information processing.
In the pursuit of robust quantum computing, we put forth a platform based on photonic qubits in a circuit-QED environment. Specifically, we propose a versatile two-qubit gate based on two cavities coupled via a transmon, constituting a selective number-dependent phase gate operating on the in-phase eigenmodes of the two cavities, the Eigen-SNAP gate. This gate natively operates in the dispersive coupling regime of the cavities and the transmon, and operates by driving the transmon externally, to imprint desired phases on the number states. As an example for the utility of the Eigen-SNAP gate, we implement a SWAP gate on a system of two logical bosonic qubits encoded in the cavities. Further, we use numerical optimization to determine the optimal implementation of the SWAP . We find that the fidelities of these optimal protocols are only limited by the coherence times of the system's components. These findings pave the way to continuous-variable quantum computing in cavity-transmon systems.
Abstract In this study, we explore the universality of Selective Number-dependent Arbitrary Phase (SNAP) and Displacement gates for quantum control in qudit-based systems. However, optimizing the parameters of these gates poses a challenging task. Our main focus is to investigate the sensitivity of training any of the SNAP parameters in the SNAP-Displacement protocol. We analyze conditions that could potentially lead to the Barren Plateau problem in a qudit system and draw comparisons with multi-qubit systems. The parameterized ansatz we consider consists of blocks, where each block is composed of hardware operations, namely SNAP and Displacement gates [Fösel et al 2020 Efficient cavity control with snap gates arXiv:2004.14256]. Applying Variational Quantum algorithm (VQA) with observable and gate cost functions, we utilize techniques similar to those in [McClean et al 2018 Barren plateaus in quantum neural network training landscapes Nat. Commun. 9 1–6] and [Cerezo et al 2021 Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nat. Commun. 12 1–12] along with the concept of t − design. Through this analysis, we make the following key observations: (a) The trainability of a SNAP-parameter does not exhibit a preference for any particular direction within our cost function landscape, (b) By leveraging the first and second moments properties of Haar measures, we establish new lemmas concerning the expectation of certain polynomial functions, and (c) utilizing these new lemmas, we identify a general condition that indicates an expected trainability advantage in a qudit system when compared to multi-qubit systems.