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

Progress in High Energy Physics PHEP

Qubitization of Bosons

Desheng Li, Xinyu Huang, Lang Yu, Xu Lu, Yin Yang, Chunwang Wu, Wei Wu, Pingxing Chen

Published May 20, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.31526/phep.2025.03

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

Digital quantum simulation of real time dynamics of Yukawa coupling

Xinyu Huang, Lang Yu, Xu Lu +5 more

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.

•May 27, 2021•0 citations

Quantum computation and simulation with superconducting qubits*

Kaiyong He, Xiao Geng, Rutian Huang +2 more

Superconducting circuits based on Josephson junctions are regarded as one of the most promising technologies for the implementation of scalable quantum computers. This review presents the basic principles of superconducting qubits and shows the progress of quantum computing and quantum simulation based on superconducting qubits in recent years. The experimental realization of gate operations, readout, error correction codes, as well as some quantum algorithms are summarized, followed by an introduction of quantum simulation. And then some important applications in fields including condensed matter physics, quantum annealing, and quantum chemistry are discussed.

Chinese Physics B•Jul 22, 2021•24 citations

Variational Quantum Simulation of Chemical Dynamics with Quantum Computers

Chee‐Kong Lee, Chang‐Yu Hsieh, Shengyu Zhang +1 more

Classical simulations of real-space quantum dynamics are challenging due to the exponential scaling of computational cost with system dimensions. Quantum computers offer the potential to simulate quantum dynamics with polynomial complexity; however, existing quantum algorithms based on the split-operator techniques require large-scale fault-tolerant quantum computers that remain elusive in the near future. Here, we present variational simulations of real-space quantum dynamics suitable for implementation in noisy intermediate-scale quantum (NISQ) devices. The Hamiltonian is first encoded onto qubits using a discrete variable representation and binary encoding scheme. We show that direct application of a real-time variational quantum algorithm based on the McLachlan's principle is inefficient as the measurement cost grows exponentially with the qubit number for general potential energy, and an extremely small time-step size is required to achieve accurate results. Motivated by the insights that many chemical dynamics occur in the low-energy subspace, we propose a subspace expansion method by projecting the total Hamiltonian, including the time-dependent driving field, onto the system low-energy eigenstate subspace using quantum computers, and the exact quantum dynamics within the subspace can then be solved classically. We show that the measurement cost of the subspace approach grows polynomially with dimensionality for general potential energy. Our numerical examples demonstrate the capability of our approach, even under intense laser fields. Our work opens the possibility of simulating chemical dynamics with NISQ hardware.

arXiv:2110.06143•Journal of Chemical Theory and Computation•Mar 16, 2022•30 citations

Superconducting Qubits

B. L. T. Plourde, Frank K. Wilhelm

Quantum computing is a novel paradigm for information processing that promises computational speedup for certain computational tasks while not being driven by Moore's law. Superconducting circuits based on Josephson junctions are one of the leading approaches for implementing the quantum bits, or qubits, in a quantum processor. Most superconducting qubit architectures involve circuit quantum electrodynamics, where the qubits are analogous to artificial atoms that are coupled to superconducting linear resonant cavities. This scheme allows for the readout of individual qubits, the manipulation of single-qubit states, and the generation of entanglement between qubits. The performance of current state-of-the-art systems is limited by decoherence of the qubits and associated gate errors. Nonetheless, experiments have been performed that already demonstrate a significant computational speedup compared to classical processing. Future implementations of fault-tolerant quantum computers will require the development of quantum error correction. Initial tests of elements of error correction in superconducting qubit arrays are underway.

CRC Press eBooks•May 17, 2022•3 citations

Encoding a bosonic mode into qubits for simulating boson-matter interactions

Maarten Stroeks, Jelena Mackeprang, Yaroslav Herasymenko +1 more

We explore the space-time cost of encoding of a bosonic mode into a set of qubits via various encodings, and their resilience to noise. In particular, we compare the performance of the unary Fock state encoding, an unexplored encoding of Fock states into Dicke states (``Dicke'' encoding), and the binary quadrature encoding. We do so by considering a displacement as well as a simulation of a Dicke model, coupling a bosonic mode to a set of atoms represented as qubits. Using classical simulations, we assess the accuracy and optimized space-time costs in terms of number of qubits, circuit depth and CNOT count of a quantum simulation of the time dynamics using these encodings. Although our study is far from comprehensive, we find that the binary quadrature encoding is overall most favorable in terms of being very space-efficient and relatively time-efficient due to the use of the quantum Fourier transform. Our novel Dicke encoding leads to very shallow circuits, but pays in terms of using many more qubits. We probe the use of an H2-2 Quantinuum trapped-ion qubit device (56 qubits) for displacement and Dicke model simulation in the low boson-number regime, where we find that noise leads to visible deviations from ideal circuit dynamics.

quant-pharXiv:2610.29762•Oct 22, 2026•0 citations
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.
Superconducting circuits based on Josephson junctions are regarded as one of the most promising technologies for the implementation of scalable quantum computers. This review presents the basic principles of superconducting qubits and shows the progress of quantum computing and quantum simulation based on superconducting qubits in recent years. The experimental realization of gate operations, readout, error correction codes, as well as some quantum algorithms are summarized, followed by an introduction of quantum simulation. And then some important applications in fields including condensed matter physics, quantum annealing, and quantum chemistry are discussed.
Classical simulations of real-space quantum dynamics are challenging due to the exponential scaling of computational cost with system dimensions. Quantum computers offer the potential to simulate quantum dynamics with polynomial complexity; however, existing quantum algorithms based on the split-operator techniques require large-scale fault-tolerant quantum computers that remain elusive in the near future. Here, we present variational simulations of real-space quantum dynamics suitable for implementation in noisy intermediate-scale quantum (NISQ) devices. The Hamiltonian is first encoded onto qubits using a discrete variable representation and binary encoding scheme. We show that direct application of a real-time variational quantum algorithm based on the McLachlan's principle is inefficient as the measurement cost grows exponentially with the qubit number for general potential energy, and an extremely small time-step size is required to achieve accurate results. Motivated by the insights that many chemical dynamics occur in the low-energy subspace, we propose a subspace expansion method by projecting the total Hamiltonian, including the time-dependent driving field, onto the system low-energy eigenstate subspace using quantum computers, and the exact quantum dynamics within the subspace can then be solved classically. We show that the measurement cost of the subspace approach grows polynomially with dimensionality for general potential energy. Our numerical examples demonstrate the capability of our approach, even under intense laser fields. Our work opens the possibility of simulating chemical dynamics with NISQ hardware.
Quantum computing is a novel paradigm for information processing that promises computational speedup for certain computational tasks while not being driven by Moore's law. Superconducting circuits based on Josephson junctions are one of the leading approaches for implementing the quantum bits, or qubits, in a quantum processor. Most superconducting qubit architectures involve circuit quantum electrodynamics, where the qubits are analogous to artificial atoms that are coupled to superconducting linear resonant cavities. This scheme allows for the readout of individual qubits, the manipulation of single-qubit states, and the generation of entanglement between qubits. The performance of current state-of-the-art systems is limited by decoherence of the qubits and associated gate errors. Nonetheless, experiments have been performed that already demonstrate a significant computational speedup compared to classical processing. Future implementations of fault-tolerant quantum computers will require the development of quantum error correction. Initial tests of elements of error correction in superconducting qubit arrays are underway.
We explore the space-time cost of encoding of a bosonic mode into a set of qubits via various encodings, and their resilience to noise. In particular, we compare the performance of the unary Fock state encoding, an unexplored encoding of Fock states into Dicke states (``Dicke'' encoding), and the binary quadrature encoding. We do so by considering a displacement as well as a simulation of a Dicke model, coupling a bosonic mode to a set of atoms represented as qubits. Using classical simulations, we assess the accuracy and optimized space-time costs in terms of number of qubits, circuit depth and CNOT count of a quantum simulation of the time dynamics using these encodings. Although our study is far from comprehensive, we find that the binary quadrature encoding is overall most favorable in terms of being very space-efficient and relatively time-efficient due to the use of the quantum Fourier transform. Our novel Dicke encoding leads to very shallow circuits, but pays in terms of using many more qubits. We probe the use of an H2-2 Quantinuum trapped-ion qubit device (56 qubits) for displacement and Dicke model simulation in the low boson-number regime, where we find that noise leads to visible deviations from ideal circuit dynamics.