Oscillator-qubit generalized quantum signal processing for vibronic models: a case study of uracil cation

• URL: http://arxiv.org/abs/2510.10495v1
• Date: Sun, 12 Oct 2025 08:13:57 GMT
• Title: Oscillator-qubit generalized quantum signal processing for vibronic models: a case study of uracil cation
• Authors: Jungsoo Hong, Seong Ho Kim, Seung Kyu Min, Joonsuk Huh,
• Abstract summary: We present a compiler for hybrid oscillator-qubit processors, implementing state preparation and time evolution.<n>This compiler invokes generalized quantum signal processing (GQSP) to synthesize arbitrary bosonic phase gates.<n>We validate our method on the uracil cation, a canonical system whose accurate modeling requires anharmonic vibronic models.
• Score: 4.351505522514463
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hybrid oscillator-qubit processors have recently demonstrated high-fidelity control of both continuous- and discrete-variable information processing. However, most of the quantum algorithms remain limited to homogeneous quantum architectures. Here, we present a compiler for hybrid oscillator-qubit processors, implementing state preparation and time evolution. In hybrid oscillator-qubit processors, this compiler invokes generalized quantum signal processing (GQSP) to constructively synthesize arbitrary bosonic phase gates with moderate circuit depth O(log(1/{\varepsilon})). The approximation cost is scaled by the Fourier bandwidth of the target bosonic phase, rather than by the degree of nonlinearity. Armed with GQSP, nonadiabatic molecular dynamics can be decomposed with arbitrary-phase potential propagators. Compared to fully discrete encodings, our approach avoids the overhead of truncating continuous variables, showing linear dependence on the number of vibration modes while trading success probability for circuit depth. We validate our method on the uracil cation, a canonical system whose accurate modeling requires anharmonic vibronic models, estimating the cost for state preparation and time evolution.

Related papers

• Variational Quantum Algorithm for Unitary Dilation [0.0]
  We introduce a hybrid quantum-classical framework for efficiently implementing approximate unitary dilations of non-unitary operators.<n>We validate the approach on superconducting devices in the Quafu quantum cloud computing cluster.
  arXiv  Detail & Related papers  (2025-10-22T01:23:59Z)
• Isoprobability Models of Qubit Dynamics [0.0]
  We develop the concept of isoprobability classes of models of qubit dynamics.<n>We introduce an additional degree of freedom, and hence flexibility in qubit control.<n>We experimentally validate the isoprobability equivalence on an IBM Quantum processor.
  arXiv  Detail & Related papers  (2025-06-24T12:36:06Z)
• Synthesis of discrete-continuous quantum circuits with multimodal diffusion models [0.5277756703318045]
  Efficiently compiling quantum operations remains a major bottleneck in scaling quantum computing.<n>We introduce a multimodal denoising diffusion model that simultaneously generates a circuit's structure and its continuous parameters for compiling a target unitary.<n>We benchmark the model over different experiments, analyzing the method's accuracy across varying qubit counts, circuit depths, and proportions of parameterized gates.
  arXiv  Detail & Related papers  (2025-06-02T13:35:33Z)
• Quantum Many-body Simulations from a Reinforcement-Learned Exponential Ansatz [6.648320801816155]
  Solving for the many-body wavefunction represents a significant challenge on both classical and quantum devices.<n>An exact, universal two-body exponential ansatz for the wavefunction has been shown to be generated from the solution of the Schr"odinger equation (CSE)<n>Here we combine the solution of the CSE with a form of artificial intelligence known as reinforcement learning (RL) to generate highly compact circuits.
  arXiv  Detail & Related papers  (2025-05-03T22:07:21Z)
• Co-Designing Spectral Transformation Oracles with Hybrid Oscillator-Qubit Quantum Processors: From Algorithms to Compilation [6.042189478747794]
  We co-design a family of quantum eigenvalue transformation oracles that can be efficiently implemented on hybrid discrete/continuous-variable (qubit/qumode) hardware.<n>For completeness, we provide an end-to-end compilation which expresses high-level oracles in terms of an experimentally realizable instruction set architecture in both 1D and 2D.
  arXiv  Detail & Related papers  (2025-02-22T01:29:14Z)
• Simulating electronic structure on bosonic quantum computers [34.84696943963362]
  We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• A hybrid quantum-classical classifier based on branching multi-scale entanglement renormalization ansatz [5.548873288570182]
  This paper proposes a quantum semi-supervised classifier based on label propagation. Considering the difficulty of graph construction, we develop a variational quantum label propagation (VQLP) method. In this method, a locally parameterized quantum circuit is created to reduce the parameters required in the optimization.
  arXiv  Detail & Related papers  (2023-03-14T13:46:45Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• 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.