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

Acta Sinica Quantum Optica

The Origin of Bivariate Hermite Polynomials and Its Applications in Quantum Optics

尹鹏程 YIN Peng-cheng, 张鹏飞 ZHANG Peng-fei, 范洪义 FAN Hong-yi

Published Jan 1, 2019• 0 citations
Publisher
DOI
10.3788/jqo20192503.0101

Related papers

Quantum algebra from generalized q-Hermite polynomials

Kamel Mezlini, Najib Ouled Azaiez

arXiv:1711.00434•Journal of Mathematical Analysis and Applications•Jul 17, 2019•3 citations

Mathematical Methods of Quantum Optics

Ravinder Rupchand Puri

Springer series in optical sciences/SPringer series in optical sciences•Jan 1, 2001•521 citations

Generating function of product of bivariate Hermite polynomials and their applications in studying quantum optical states

Hong-Yi Fan, Pengfei Zhang, Zhen Wang

By virtue of the operator-Hermite-polynomial method, we derive some new generating function formulas of the product of two bivariate Hermite polynomials. Their applications in studying quantum optical states are presented.

Chinese Physics B•Apr 30, 2015•8 citations

Eigenstate structure in many-body bosonic systems: Analysis using random matrices and $q$-Hermite polynomials

Priyanka Rao, Manan Vyas, N. D. Chavda

We analyze the structure of eigenstates in many-body bosonic systems by modeling the Hamiltonian of these complex systems using Bosonic Embedded Gaussian Orthogonal Ensembles (BEGOE) defined by a mean-field plus $k$-body random interactions. The quantities employed are the number of principal components (NPC), the localization length ($l_H$) and the entropy production $S(t)$. The numerical results are compared with the analytical formulas obtained using random matrices which are based on bivariate $q$-Hermite polynomials for local density of states $F_k(E|q)$ and the bivariate $q$-Hermite polynomial form for bivariate eigenvalue density $ρ_{biv:q}(E,E_k)$ that are valid in the strong interaction domain. We also compare transport efficiency in many-body bosonic systems using BEGOE in absence and presence of centrosymmetry. It is seen that the centrosymmetry enhances quantum efficiency.

arXiv:2111.08820•Nov 16, 2021•1 citation

Conjugate Construction of Quantum Optics: From Foundations to Applications

Jeffrey Zheng

Nova Science Publishers eBooks•Jan 1, 2023•0 citations

Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory

Pierre-Antoine Bernard, Nathan Wiebe

Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial basis for block-encoding any polynomial of a unitary. We characterize the achievable polynomial bases in terms of their orthogonality or biorthogonality with respect to a linear functional admitting an integral representation. Explicit expressions for the quantum signal processing angles are derived for families of polynomial sequences, including Hermite, Jacobi, and Rogers-Szegő polynomials. We show that $2n+2$ rotation angles are required to encode a sequence of polynomials in these classes up to degree $n$. We use this result to show that an $ε$-approximation of a smooth function $f$ can be block-encoded using $O(\log(1/ε))$ gates via its Hermite series expansion. The connections established with the theory of orthogonal and biorthogonal polynomials lead to a new method for solving the quantum signal processing angle-finding problem, yielding explicit expressions for the angles. They also provide a complete characterization of the polynomials achievable by $\mathrm{SU}(1,1)$-QSP in terms of their roots. Biorthogonality properties are shown to hold in the bivariate QSP setting, yielding a set of necessary conditions for achievable polynomials.

quant-pharXiv:2605.05321•May 8, 2026•1 citation
Eigenstate structure in many-body bosonic systems: Analysis using random matrices and qqq-Hermite polynomials
We analyze the structure of eigenstates in many-body bosonic systems by modeling the Hamiltonian of these complex systems using Bosonic Embedded Gaussian Orthogonal Ensembles (BEGOE) defined by a mean-field plus kkk-body random interactions. The quantities employed are the number of principal components (NPC), the localization length (lHl_HlH​) and the entropy production S(t)S(t)S(t). The numerical results are compared with the analytical formulas obtained using random matrices which are based on bivariate qqq-Hermite polynomials for local density of states Fk(E∣q)F_k(E|q)Fk​(E∣q) and the bivariate qqq-Hermite polynomial form for bivariate eigenvalue density ρbiv:q(E,Ek)ρ_{biv:q}(E,E_k)ρbiv:q​(E,Ek​) that are valid in the strong interaction domain. We also compare transport efficiency in many-body bosonic systems using BEGOE in absence and presence of centrosymmetry. It is seen that the centrosymmetry enhances quantum efficiency.
Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial basis for block-encoding any polynomial of a unitary. We characterize the achievable polynomial bases in terms of their orthogonality or biorthogonality with respect to a linear functional admitting an integral representation. Explicit expressions for the quantum signal processing angles are derived for families of polynomial sequences, including Hermite, Jacobi, and Rogers-Szegő polynomials. We show that 2n+22n+22n+2 rotation angles are required to encode a sequence of polynomials in these classes up to degree nnn. We use this result to show that an εεε-approximation of a smooth function fff can be block-encoded using O(log⁡(1/ε))O(\log(1/ε))O(log(1/ε)) gates via its Hermite series expansion. The connections established with the theory of orthogonal and biorthogonal polynomials lead to a new method for solving the quantum signal processing angle-finding problem, yielding explicit expressions for the angles. They also provide a complete characterization of the polynomials achievable by SU(1,1)\mathrm{SU}(1,1)SU(1,1)-QSP in terms of their roots. Biorthogonality properties are shown to hold in the bivariate QSP setting, yielding a set of necessary conditions for achievable polynomials.