Majorization and the time complexity of linear optical networks
From MaRDI portal
Publication:5056236
DOI10.1088/1751-8121/ab1cc7OpenAlexW3102902904WikidataQ127855607 ScholiaQ127855607MaRDI QIDQ5056236
Publication date: 7 December 2022
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.05551
Related Items (3)
Partial distinguishability as a coherence resource in boson sampling ⋮ Taming identical particles for discerning the genuine non-locality ⋮ On the classical complexity of sampling from quantum interference of indistinguishable bosons
Cites Work
- Unnamed Item
- The complexity of computing the permanent
- The permanent of a square matrix
- Discrete dynamics by different concepts of majorization
- Permanent formulae from the Veronesean
- From moments of sum to moments of product
- A linear-optical proof that the permanent is # P -hard
- Proceedings of the forty-third annual ACM symposium on Theory of computing
- Universal linear optics
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Quantum Information Theory and the Foundations of Quantum Mechanics
- ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS
This page was built for publication: Majorization and the time complexity of linear optical networks