Papers › Certain properties and applications of shallow bosonic circuits

Certain properties and applications of shallow bosonic circuits

17 Dec 2021arXiv:2112.09766links table onlyarchive 2025-07-28

Kamil Bradler, Hugo Wallner

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We introduce a novel approach to solve optimization problems on a boson sampling device assisted by classical machine-learning techniques. By virtue of the parity function, we map all measurement patterns, which label the basis spanning an M-mode bosonic Hilbert space, to the Hilbert space of M qubits. As a result, the sampled probability function can be interpreted as a result of sampling a multiqubit circuit. The method is presented on several instances of a QUBO/Ising problem as well as portfolio optimization problems. Among many demonstrated properties of the parity function is the ability to chart the entire qubit Hilbert space no matter how shallow the initial bosonic circuits is. In order to show this we link boson sampling circuits to a class of finite Young's lattices (a special poset with the so-called Ferrers diagrams ordered by inclusion), Boolean lattices and the properties of Dyck/staircase paths on integer lattices. Our results and methods can be applied to a large variety of photonic circuits, including the deep ones of essentially any geometry, but our main focus is on shallow circuits as they are less affected by photon loss and relatively easy to implement in the form of a time-bin interferometer.

PaperPDFCode

Code

orcacomputing/quantumqubo officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections