Near-optimal synthesis of non-Gaussian phase gates via qubit-oscillator Rabi control

• URL: http://arxiv.org/abs/2609.09132v1
• Date: Tue, 08 Sep 2026 17:53:18 GMT
• Title: Near-optimal synthesis of non-Gaussian phase gates via qubit-oscillator Rabi control
• Abstract summary: We develop an efficient qubit-oscillator Rabi synthesis scheme for phase gates.<n>We show that a degree-(R) phase gate can be approximated by an analytically constructed Rabi sequence with total time.
• Score: 10.877976778339495
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control [42.97938764966747]
  We present a unifying framework for gradient-based quantum optimal control.<n>For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients.<n>The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions.
  arXiv  Detail & Related papers  (2026-07-29T12:50:52Z)
• Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization [0.7009487789080343]
  We investigate ancilla-free linear combination of unitaries (LCU) as a framework for approximating complex quantum circuits.<n>We show that Fourier-based LCU constructions efficiently decompose broad classes of diagonal and non-diagonal unitaries.
  arXiv  Detail & Related papers  (2026-05-18T18:05:08Z)
• Efficient Qubit Simulation of Hybrid Oscillator-Qubit Quantum Computation [7.0833183028318984]
  We introduce a framework for hybrid oscillator-qubit quantum processors on qubit-only systems through position encoding.<n>By encoding continuous-variable position and momentum wave functions into qubit amplitudes, our method efficiently simulates all Gaussian and conditional Gaussian operations.<n>We provide rigorous numerical characterization of quantum transform errors for Fock-bounded states, enabling precise resource estimation.
  arXiv  Detail & Related papers  (2026-03-10T06:05:55Z)
• Practical Quantum Circuit Implementation for Simulating Coupled Classical Oscillators [1.3140209441982318]
  We present and implement a detailed quantum circuit construction for simulating one-dimensional spring-mass systems.<n>This circuit-based Hamiltonian simulation approach can substantially reduce computational costs and potentially enable larger-scale many-body studies on future quantum hardware.
  arXiv  Detail & Related papers  (2025-01-10T16:53:56Z)
• Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models [55.07411490538404]
  We propose a novel parallel sampling method that improves adaptive complexity dependence on dimension $d$.<n>Our approach builds on parallel simulation techniques from scientific computing.
  arXiv  Detail & Related papers  (2024-12-10T11:50:46Z)
• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization [0.8341988468339112]
  Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing.<n>We leverage search-based methods to first approximately diagonalize a unitary, then perform the inversion analytically.<n>Our approach improves both the implementation precision and run time of synthesis algorithms by orders of magnitude when evaluated on unitaries from real quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-31T12:10:32Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Improved simulation of quantum circuits dominated by free fermionic operations [1.024113475677323]
  We present an algorithm for simulating universal quantum circuits composed of "free" nearest-neighbour matchgates or equivalently fermionic-linear-optical (FLO) gates, and "resourceful" non-Gaussian gates.<n>Our key contribution is the development of a novel phase-sensitive algorithm for simulating FLO circuits.<n>For a quantum circuit containing arbitrary FLO unitaries and $k$ controlled-Z gates, we obtain an exponential improvement $k$O(4.5k)$O over the prior state-of-the-art.
  arXiv  Detail & Related papers  (2023-07-24T11:36:28Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.