Statistical benchmark methods originally for discriminating boson sampling can quantify noises like partial distinguishability and loss, performing better with high-order correlators, while a new fast simulation scheme for noisy samples is introduced.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.
citing papers explorer
-
Evaluating noises of fast-simulated boson sampling with statistical benchmark methods
Statistical benchmark methods originally for discriminating boson sampling can quantify noises like partial distinguishability and loss, performing better with high-order correlators, while a new fast simulation scheme for noisy samples is introduced.
-
Entanglement and circuit complexity in finite-depth random linear optical networks
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.