Quantum de Moivre–Laplace theorem for noninteracting indistinguishable particles in random networks
From MaRDI portal
Publication:4602771
Abstract: The asymptotic form of the average probability to count indistinguishable identical particles in a small number of binned-together output ports of a -port Haar-random unitary network, proposed recently in extit{Scientific Reports} extbf{7}, 31 (2017) in a heuristic manner with some numerical confirmation, is presented with the mathematical rigor and generalized to an arbitrary (mixed) input state of indistinguishable particles. It is shown that, both in the classical (distinguishable particles) and quantum (indistinguishable particles) cases, the average counting probability into output bins factorizes into a product of counting probabilities into two bins. This fact relates the asymptotic Gaussian law to the de Moivre-Laplace theorem in the classical case and similarly in the quantum case where an analogous theorem can be stated. The results have applications to the setups where randomness plays a key role, such as the multiphoton propagation in disordered media and the scattershot Boson Sampling.
Recommendations
- Bipartite quantum states and random complex networks
- Non-Markovianity over ensemble averages in quantum complex networks
- Quantum efficiencies in finite disordered networks connected by many-body interactions
- Quantum contact process on scale-free networks
- Random unitary dynamics of quantum networks
- Quantum statistics in network geometry with fractional flavor
- Correlations of indistinguishable particles in non-Hermitian lattices
- Quantum stochastic thermodynamic on harmonic networks
Cites work
- scientific article; zbMATH DE number 3621932 (Why is no real title available?)
- An Elementary View of Euler's Summation Formula
- Asymptotic behavior of group integrals in the limit of infinite rank
- Diagrammatic method of integration over the unitary group, with applications to quantum transport in mesoscopic systems
- Elements of Information Theory
- MULTI-PHOTON INTERFERENCE AND TEMPORAL DISTINGUISHABILITY OF PHOTONS
- On Gospers formula for the Gamma function
- Statistical benchmark for bosonsampling
- The bosonic birthday paradox
- The computational complexity of linear optics
- Universal linear optics
Cited in
(2)
This page was built for publication: Quantum de Moivre–Laplace theorem for noninteracting indistinguishable particles in random networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602771)