A new algorithm converts low-entanglement bosonic Gaussian states to matrix product states in polynomial time without hafnian calculations, yielding speedups on experimental boson sampling data.
Our first task is there- fore to identify, for a given bond dimensionD, the sub- space that retains the maximal amount of physically rel- evant information
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient simulation of low-entanglement bosonic Gaussian states in polynomial time
A new algorithm converts low-entanglement bosonic Gaussian states to matrix product states in polynomial time without hafnian calculations, yielding speedups on experimental boson sampling data.