Majorization and the time complexity of linear optical networks
From MaRDI portal
Recommendations
Cites work
- A linear-optical proof that the permanent is \(\#\mathrm{P}\)-hard
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- An introduction to entanglement measures
- Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons
- Discrete dynamics by different concepts of majorization
- From moments of sum to moments of product
- Permanent formulae from the Veronesean
- Proceedings of the 43rd annual ACM symposium on theory of computing, STOC '11. San Jose, CA, USA, June 6--8, 2011.
- Quantum Information Theory and the Foundations of Quantum Mechanics
- The complexity of computing the permanent
- The permanent of a square matrix
- Universal linear optics
Cited in
(5)- 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
- Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons
- Majorization-based benchmark of the complexity of quantum processors
This page was built for publication: Majorization and the time complexity of linear optical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056236)
