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

Theoretical and Mathematical Physics

Combinatorics of a strongly coupled boson system

N. M. Bogoliubov

Published Oct 1, 2014• 0 citations
Publisher
DOI
10.1007/s11232-014-0204-8

Related papers

Deformed Bosons: Combinatorics of Normal Ordering

Paweł Błasiak, A. Horzela, K. A. Penson +1 more

arXiv:quant-ph/0410226•Czechoslovak Journal of Physics•Nov 1, 2004•22 citations

Normal ordering q-bosons and combinatorics

Matthias Schork

Physics Letters A•Mar 4, 2006•20 citations

Combinatorial solutions to normal ordering of bosons

Paweł Błasiak, A. Gawron, A. Horzela +2 more

arXiv:quant-ph/0510082•Czechoslovak Journal of Physics•Nov 1, 2005•5 citations

Boson expansions for systems of interacting bosons

R. Bijker, Stuart Pittel, J. Dukelsky

Physics Letters B•Mar 1, 1989•14 citations

Gaussian Boson Sampling Compilation

Sonia López Alarcón, Federico Rueda

Abstract Gaussian Boson Sampling is gaining relevance among the multiple technologies currently implementing quantum computing. The problem of sampling out of a boson distribution across multiple modes has a strong mathematical connection with combinatorics problems, with multiple practical applications that would classically be unfeasible to solve within reasonable time. The software stack that accompanies this GBS approach, and that takes the application from its high level description to the hardware implementation, is the main focus of this paper. The general compilation process of Gaussian Boson Samplers is described in detail. The specifics of the Strawberry Fields (Xanadu) compilation and simulation framework are discussed, along with its time profiling, and time implications on computationally significant problem sizes. Last, a compilation step to reduce the hardware description complexity is presented, demonstrating a linear reduction on the overall number of operators when the number of Gaussian operators increases.

•Jul 11, 2022•0 citations

Theory of many-boson systems

Richard David Etters

•Jan 1, 1965•0 citations
Abstract Gaussian Boson Sampling is gaining relevance among the multiple technologies currently implementing quantum computing. The problem of sampling out of a boson distribution across multiple modes has a strong mathematical connection with combinatorics problems, with multiple practical applications that would classically be unfeasible to solve within reasonable time. The software stack that accompanies this GBS approach, and that takes the application from its high level description to the hardware implementation, is the main focus of this paper. The general compilation process of Gaussian Boson Samplers is described in detail. The specifics of the Strawberry Fields (Xanadu) compilation and simulation framework are discussed, along with its time profiling, and time implications on computationally significant problem sizes. Last, a compilation step to reduce the hardware description complexity is presented, demonstrating a linear reduction on the overall number of operators when the number of Gaussian operators increases.