Non-Gaussian gates remain a key bottleneck for universal continuous-variable (CV) quantum computation because the nonlinearities they require are difficult to engineer. To address this challenge, we develop an efficient qubit-oscillator Rabi synthesis scheme for polynomial phase gates, with a total interaction time that scales polylogarithmically with the inverse target error \(\varepsilon\). Specifically, for a class of readily preparable initial states, we show that a degree-\(R\) phase gate can be approximated by an analytically constructed Rabi sequence with total time \(O(\log^{(R-1)/2+o(1)}(1/\varepsilon))\). This construction requires no numerical optimization and therefore extends naturally to arbitrarily large multimode systems. We further establish a total-time lower bound of \(Ω(\log^{(R-1)/2}(1/\varepsilon))\), showing that the synthesis is near optimal. As applications, we use this scheme to simulate representative CV quantum dynamics and implement a CV quantum algorithm for solving linear partial differential equations. These results establish qubit-oscillator Rabi control as an efficient, analytically compilable, and near-optimal primitive for CV quantum information processing.
Non-Gaussian gates remain a key bottleneck for universal continuous-variable (CV) quantum computation because the nonlinearities they require are difficult to engineer. To address this challenge, we develop an efficient qubit-oscillator Rabi synthesis scheme for polynomial phase gates, with a total interaction time that scales polylogarithmically with the inverse target error (\varepsilon). Specifically, for a class of readily preparable initial states, we show that a degree-(R) phase gate can be approximated by an analytically constructed Rabi sequence with total time (O(\log^{(R-1)/2+o(1)}(1/\varepsilon))). This construction requires no numerical optimization and therefore extends naturally to arbitrarily large multimode systems. We further establish a total-time lower bound of (Ω(\log^{(R-1)/2}(1/\varepsilon))), showing that the synthesis is near optimal. As applications, we use this scheme to simulate representative CV quantum dynamics and implement a CV quantum algorithm for solving linear partial differential equations. These results establish qubit-oscillator Rabi control as an efficient, analytically compilable, and near-optimal primitive for CV quantum information processing.
Abstract Continuous-variable (CV) quantum information processing harnesses versatile experimental tools that leverage the power of infinite-dimensional oscillators controlled by a single qubit. Increasingly available elementary Rabi gates have been proposed as a resource for implementing universal CV gates, but the requirement of many weak, non-commuting gates is a bottleneck in scaling up such an approach. In this study, we propose a resource-efficient technique using Fourier expansion to implement arbitrary non-linear phase gates in a single oscillator. This method reduces the number of sequentially required gates exponentially. These gates represented by cubic, quartic, and other arbitrary nonlinear potentials have applications in CV quantum information processing with infinite-dimensional oscillators controlled by a single qubit. Our method outperforms previous approaches and enables the experimental realization of a wide range of applications, including the development of bosonic quantum sensors, simulations, and computation using trapped ions and superconducting circuits.
The methodology of optimal control theory is applied to the problem of implementing quantum gates in continuous-variable (CV) systems with quadratic Hamiltonians. We demonstrate that it is possible to define a fidelity measure for CV gate optimization that is devoid of traps, such that the search for optimal control fields using local algorithms will not be hindered. The optimal control of several quantum computing gates, as well as that of algorithms composed of these primitives, is investigated using several typical physical models and compared for discrete-variable and continuous-variable quantum systems. Numerical simulations indicate that the optimization of generic CV quantum gates is inherently more expensive than that of generic discrete variable quantum gates, but can be routinely achieved for all the major classes of computing primitives. The exact-time controllability of CV systems, hitherto largely ignored in the design of information processing models, is shown to play an important role in determining the maximal achievable gate fidelity. Moreover, the ability to control interactions between qunits can be exploited to delimit the total control fluence. Future experimental model systems should carefully tune these parameters so as to enable the implementation of CV quantum information processing with optimal fidelity.
Universal control over a bosonic degree of freedom is key in the quest for quantum-based technologies. Such universal control requires however the ability to perform demanding non-Gaussian gates -- namely, higher-than-quadratic interactions at the level of the bosonic operators. Here we consider a single ancillary two-level system, interacting with the bosonic mode of interest via a driven quantum Rabi model, and show that it is sufficient to induce the deterministic realization of a large class of Gaussian and non-Gaussian gates, which in turn provide universal bosonic control. This scheme reduces the overhead of previous ancilla-based methods where long gate-sequences are required to generate highly populated targets. In fact, our method naturally yields the high-fidelity preparation of multi-squeezed states -- i.e., the high-order generalization of displaced and squeezed states -- which feature large phase-space Wigner negativities. The universal control is further illustrated by generating a cubic-phase gate. Finally, we address the resilience of the method in the presence of realistic noise. Due to the ubiquity of the considered interaction, our scheme might open new avenues in the design, preparation, and control of bosonic states in different setups.
Molecular quantum dynamics simulations that treat both electrons and nuclei quantum mechanically are crucial for predicting chemical reactions. With classical computation, a full wave-function representation of both types of particles requires resources that grow exponentially with their number. Oscillator-qubit processors, including trapped-ion and circuit QED devices, represent electronic states with qubits and nuclear vibrations with oscillators. Their native operations produce linear vibronic interactions, from which programmable anharmonic interactions can be built. Product-formula approaches build the corresponding phase gates by repeating small noncommuting phase steps, and quantum signal processing (QSP) approaches approximate each gate directly with a Fourier series. Simulations apply many such gates in sequence, so accumulated cost and error limit how long the dynamics can be followed. We propose near-optimal quantum primitives for molecular quantum dynamics simulation, covering the representations of both types of particles and their interactions. We synthesize nonlinear and multimode bosonic phase gates using generalized Jacobi-Anger (GJA) expansions within QSP, with a cost that grows near-optimally in both interaction strength and precision. Our interaction model and gate synthesis each have their own accuracy setting. Chosen together, these settings make our multimode benchmark circuits about one-third shorter than those of the previous direct QSP approach. We then simulate energy exchange between the stretching and bending vibrations of a simplified carbon dioxide model. With circuit-QED noise, a short simulation narrowly misses our accuracy criteria at qubit and oscillator lifetimes near 2 ms and 5 ms. These lifetimes mark a concrete checkpoint on the way to simulating anharmonic multimode molecular quantum dynamics on near-term oscillator-qubit processors.
We introduce a framework for simulating hybrid oscillator-qubit quantum processors on qubit-only systems through position encoding. By encoding continuous-variable position and momentum wave functions into qubit amplitudes, our method efficiently simulates all Gaussian and conditional Gaussian operations -- encompassing the phase-space instruction set (beam splitter, single-qubit rotation, conditional displacement) and extending to squeezing, conditional squeezing, conditional rotation, and conditional beam splitter -- using O(log2(Γ+log(1/ε))) qubit gates per hybrid gate, where Γ is the Fock-level bound and ε is the target precision. This polylogarithmic per-gate complexity represents an exponential improvement over Fock basis encoding approaches, which require exponential quantum or classical resources in the number of qubits per mode. We provide rigorous numerical characterization of quantum Fourier transform errors for Fock-bounded states, enabling precise resource estimation for practical implementations. This work establishes that hybrid oscillator-qubit algorithms can be implemented on qubit processors with polynomial overhead, providing new insights into the computational power trade-offs between discrete-variable and hybrid continuous-discrete-variable quantum computing.
Hybrid oscillator-qubit processors have recently demonstrated high-fidelity control of both continuous- and discrete-variable information processing. However, most quantum algorithms remain limited to homogeneous quantum architectures. Here, we present a compiler for hybrid oscillator-qubit processors that implements state preparation and time evolution. In this setting, the compiler invokes generalized quantum signal processing (GQSP) to synthesize arbitrary analytic bosonic phase gates in a constructive manner, with circuit depth scaling as . The approximation cost scales with the Fourier bandwidth of the target bosonic phase, rather than with the degree of nonlinearity. Armed with OQ-GQSP, multi-state vibronic coupling Hamiltonian dynamics can be decomposed into state-dependent arbitrary-phase potential propagators, which also enable extension to multi-state systems through the parity-measurement technique. Compared to fully discrete encodings, our approach avoids the overhead of truncating continuous variables, resulting in linear dependence on the number of vibrational modes. We validate our method on the uracil cation, a canonical system whose accurate modeling requires anharmonic vibronic models, and estimate the cost of state preparation and time evolution.