Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Digital quantum simulation of real time dynamics of Yukawa coupling

Xinyu Huang, Lang Yu, Xu Lu, Yin Ping Yang, Desheng Li, Chun-Wang Wu, Wei Wu, Ping‐Xing Chen

Published May 27, 2021• 0 citations
OpenAlex

Abstract

A mapping from Fock space boson states to qubits is given and an underlying digital quantum simulation algorithm of bosons is derived. We realize the algorithm in MPS (matrix product state) which simulating real time dynamics of Yukawa coupling in varies initial states and coupling constants. This proposal may be achieved in superconductivity NISQ (noisy intermediate-scale quantum) computer not far future.

Related papers

Qubitization of Bosons

Huang, Xin-Yu, Yu, Lang, Lu, Xu +5 more

A binary mapping from Fock space of bosonic state to qubits is given. Based on the binary mapping, we construte an algorithm of qubitization of bosons with complexity O(log(N)). As an example, the algorithm of qubitization of bosons in matrix product state to simulate real time dynamics of Yukawa coupling is realized. The calculation error bar is estimated by random sampling method. This proposal may be achieved in superconductivity noisy intermediate--scale quantum computer not far future.

arXiv:2105.12563•May 26, 2021•13 citations

Qubitization of Bosons

Desheng Li, Xinyu Huang, Lang Yu +5 more

A binary mapping from Fock space of bosonic state to qubits is given. Based on the binary mapping, analgorithm of qubitization of bosons with complexity O(log(N)) is described by recurrence relation. As anproposal, the algorithm of qubitization of bosons to simulate real time dynamics of Yukawa coupling isrealized which might be achieved in superconductivity noisy intermediate–scale quantum computer atnot far future.

Progress in High Energy Physics PHEP•May 20, 2025•0 citations

Digital-analog quantum computing of fermion-boson models in superconducting circuits

Shubham Kumar, Narendra N. Hegade, Anne-Maria Visuri +5 more

High-fidelity quantum simulations demand hardware-software co-design architectures, which are crucial for adapting to complex problems such as strongly correlated dynamics in condensed matter. By leveraging co-design strategies, we can enhance the performance of state-of-the-art quantum devices in the noisy intermediate quantum (NISQ) and early error-correction regimes. In this direction, we propose a digital-analog quantum algorithm for simulating the Hubbard–Holstein model, describing strongly correlated fermion-boson interactions, in a suitable architecture with superconducting circuits. It comprises a linear chain of qubits connected by resonators, emulating electron–electron (e–e) and electron–phonon (e–p) interactions, as well as fermion tunneling. Our approach is adequate for digital-analog quantum computing (DAQC) of fermion-boson models, including those described by the Hubbard–Holstein model. We show the reduction in the circuit depth of the DAQC algorithm, a sequence of digital steps and analog blocks, outperforming the purely digital approach. We exemplify the quantum simulation of a half-filled two-site Hubbard–Holstein model. In this example, we obtain time-dependent state fidelities larger than 0.98, showing that our proposal is suitable for studying the dynamical behavior of solid-state systems. Our proposal opens the door to computing complex systems for chemistry, materials, and high-energy physics.

arXiv:2308.12040•npj Quantum Information•Mar 11, 2025•18 citations

Simulation of state evolutions in Gross-Neveu model by matrix product state representation

Desheng Li, Hao Wang, Chu Yu Guo +2 more

A quantum algorithm to simulate the real time dynamics of two-flavor massive Gross-Neveu model is presented in Schrodinger picture. We implement the simulation on a classic computer by applying the matrix product state representation. The real time evolutions of up to four particles on a site in initial state are figured out in space-time coordinate. The state evolutions are effectively affected by fermion mass and coupling constant of the model. Especially when the mass of fermion is small enough and the coupling is strong enough, the fundamental fermions evolve synchronistically in space from the two-fermion and four-fermion initial states. These are also the conditions on which the bound states made up of fundamental fermion pairs were found to arise automatically in the literatures.

arXiv:2011.07538•Nov 15, 2020•1 citation

Digital Quantum Simulation of the Holstein-Primakoff Transformation on Noisy Qubits

Kelvin Yip, Alessandro Monteros, Sahel Ashhab +1 more

Quantum simulation of many-body systems offers a powerful approach to exploring collective quantum dynamics beyond classical computational reach. Although spin and fermionic models have been extensively simulated on digital quantum computers, the simulation of bosonic systems on programmable quantum processors is often hindered by the intrinsically large Hilbert space of bosonic modes. In this work, we study the digital quantum simulation of bosonic modes using the Holstein-Primakoff (HP) transformation and implement this protocol on a cloud-based superconducting quantum processor. Two representative models are realized on quantum hardware: (i) the driven harmonic oscillator and (ii) the Jaynes-Cummings model. Using data obtained from the quantum simulations, we systematically examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters. The dominant algorithmic errors arise from the finite number of qubits used in the HP mapping and the finite number of Trotter steps in the time evolution, while hardware errors mainly originate from gate infidelity, decoherence, and readout errors. This study advances the digital quantum simulation of many-body systems involving bosonic degrees of freedom on currently available cloud quantum processors and provides a framework that can be extended to more complex spin-boson and multimode cavity models.

quant-pharXiv:2602.17806•Physical Review A•Feb 23, 2026•1 citation

Digital Quantum Simulation of Scalar Yukawa Coupling

Thierry N. Kaldenbach, Matthias Heller, G. Alber +1 more

Motivated by the revitalized interest in the digital simulation of medium- and high-energy physics phenomena, we investigate the dynamics following a Yukawa interaction quench on IBM Q. Adopting the zero-dimensional version of the scalar Yukawa coupling model as our point of departure, we design low-depth quantum circuits, emulating its dynamics with up to three bosons. In the one-boson case, we demonstrate circuit compression, i.e., a constant-depth circuit containing only two controlled-NOT (CNOT) gates. In the more complex three-boson case, we design a circuit in which one Trotter step entails eight CNOTs. Using an analogy with the traveling salesman problem, we also provide a CNOT cost estimate for higher boson number truncations. Based on these circuits, we quantify the system dynamics by evaluating the expected boson number at an arbitrary time after the quench and the survival probability of the initial vacuum state (the Loschmidt echo). We also utilize these circuits to drive adiabatic transitions and compute the energies of the ground- and first-excited states of the considered model. Finally, through error mitigation, i.e., zero-noise extrapolation, we demonstrate the good agreement of our results with a numerically exact classical benchmark.

arXiv:2211.02684•Quantum Reports•Jul 18, 2024•6 citations
A mapping from Fock space boson states to qubits is given and an underlying digital quantum simulation algorithm of bosons is derived. We realize the algorithm in MPS (matrix product state) which simulating real time dynamics of Yukawa coupling in varies initial states and coupling constants. This proposal may be achieved in superconductivity NISQ (noisy intermediate-scale quantum) computer not far future.
High-fidelity quantum simulations demand hardware-software co-design architectures, which are crucial for adapting to complex problems such as strongly correlated dynamics in condensed matter. By leveraging co-design strategies, we can enhance the performance of state-of-the-art quantum devices in the noisy intermediate quantum (NISQ) and early error-correction regimes. In this direction, we propose a digital-analog quantum algorithm for simulating the Hubbard–Holstein model, describing strongly correlated fermion-boson interactions, in a suitable architecture with superconducting circuits. It comprises a linear chain of qubits connected by resonators, emulating electron–electron (e–e) and electron–phonon (e–p) interactions, as well as fermion tunneling. Our approach is adequate for digital-analog quantum computing (DAQC) of fermion-boson models, including those described by the Hubbard–Holstein model. We show the reduction in the circuit depth of the DAQC algorithm, a sequence of digital steps and analog blocks, outperforming the purely digital approach. We exemplify the quantum simulation of a half-filled two-site Hubbard–Holstein model. In this example, we obtain time-dependent state fidelities larger than 0.98, showing that our proposal is suitable for studying the dynamical behavior of solid-state systems. Our proposal opens the door to computing complex systems for chemistry, materials, and high-energy physics.
A quantum algorithm to simulate the real time dynamics of two-flavor massive Gross-Neveu model is presented in Schrodinger picture. We implement the simulation on a classic computer by applying the matrix product state representation. The real time evolutions of up to four particles on a site in initial state are figured out in space-time coordinate. The state evolutions are effectively affected by fermion mass and coupling constant of the model. Especially when the mass of fermion is small enough and the coupling is strong enough, the fundamental fermions evolve synchronistically in space from the two-fermion and four-fermion initial states. These are also the conditions on which the bound states made up of fundamental fermion pairs were found to arise automatically in the literatures.
Quantum simulation of many-body systems offers a powerful approach to exploring collective quantum dynamics beyond classical computational reach. Although spin and fermionic models have been extensively simulated on digital quantum computers, the simulation of bosonic systems on programmable quantum processors is often hindered by the intrinsically large Hilbert space of bosonic modes. In this work, we study the digital quantum simulation of bosonic modes using the Holstein-Primakoff (HP) transformation and implement this protocol on a cloud-based superconducting quantum processor. Two representative models are realized on quantum hardware: (i) the driven harmonic oscillator and (ii) the Jaynes-Cummings model. Using data obtained from the quantum simulations, we systematically examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters. The dominant algorithmic errors arise from the finite number of qubits used in the HP mapping and the finite number of Trotter steps in the time evolution, while hardware errors mainly originate from gate infidelity, decoherence, and readout errors. This study advances the digital quantum simulation of many-body systems involving bosonic degrees of freedom on currently available cloud quantum processors and provides a framework that can be extended to more complex spin-boson and multimode cavity models.
Motivated by the revitalized interest in the digital simulation of medium- and high-energy physics phenomena, we investigate the dynamics following a Yukawa interaction quench on IBM Q. Adopting the zero-dimensional version of the scalar Yukawa coupling model as our point of departure, we design low-depth quantum circuits, emulating its dynamics with up to three bosons. In the one-boson case, we demonstrate circuit compression, i.e., a constant-depth circuit containing only two controlled-NOT (CNOT) gates. In the more complex three-boson case, we design a circuit in which one Trotter step entails eight CNOTs. Using an analogy with the traveling salesman problem, we also provide a CNOT cost estimate for higher boson number truncations. Based on these circuits, we quantify the system dynamics by evaluating the expected boson number at an arbitrary time after the quench and the survival probability of the initial vacuum state (the Loschmidt echo). We also utilize these circuits to drive adiabatic transitions and compute the energies of the ground- and first-excited states of the considered model. Finally, through error mitigation, i.e., zero-noise extrapolation, we demonstrate the good agreement of our results with a numerically exact classical benchmark.