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.
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.
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.
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.
We propose deterministic realizations of nonlinear phase gates by repeating a finite sequence of non-commuting Rabi interactions between a harmonic oscillator and only a single two-level ancillary qubit. We show explicitly that the key nonclassical features of the ideal cubic phase gate and the quartic phase gate are generated in the harmonic oscillator faithfully by our method. We numerically analyzed the performance of our scheme under realistic imperfections of the oscillator and the two-level system. The methodology is extended further to higher-order nonlinear phase gates. This theoretical proposal completes the set of operations required for continuous-variable quantum computation.
We translate the one-mode unitary-dilation framework for nonunitary linear dynamics into a gate-level hybrid oscillator--qubit architecture. An ancillary oscillator encodes the kernel through state preparation and postselection, while a qubit register simulates the discretized system operator. The construction applies to time-independent dynamics u˙=−(L+iH)u, including discretized partial differential equations, and removes the O(logMa) ancilla-qubit overhead of a discrete-variable (DV) Ma-term quadrature register. We bound the ideal state's squeezed-Fock coefficient-projection error, which decays superalgebraically in cutoff N for Schwartz-class kernels and at a stretched-exponential rate under stronger joint decay and smoothness assumptions. The finite squeezed-Fock state generically has stellar rank N−1, making N a measure of the oracle's non-Gaussian resource. For oscillator dimension NFock, a pth-order product formula reaches error εt in O(t1+1/pNFock(p+1)/(2p)εt−1/p) Trotter steps, up to generator-dependent commutator factors. A perturbation bound separates total scaled-map error from postselection probability. We benchmark Law--Eberly synthesis and assess variational SNAP+D state preparation on heat and advection--diffusion equations. At the prescribed DV sizing, the hybrid CV--DV route has smaller fixed-scale error in all ten instances, while the DV route accepts with fewer repetitions in every instance. These results quantify when a continuous qumode can replace a discretized ancilla register.