PreprintarXiv licencearXiv
Log-depth entanglement transition in hypercube Gaussian boson sampling
Abstract
We study an entanglement transition at logarithmic depth in random hypercube linear optical networks. Starting from an initial Gaussian state with all modes squeezed, we prove that random hypercube linear optical networks on n modes generate ensemble-averaged subsystem entanglement within a constant factor of its maximum in all subsystems at circuit depth Θ(log n). Below depth log2n, there is an extensive subsystem with no entanglement. The entanglement generation in logarithmic depth can be compared to recent progress towards O(log n) depth average-case sampling hardness for Gaussian boson sampling in a hypercube network.
Related
- Anticoncentration and entanglement in Gaussian boson sampling
- Finite Spectral Depth Controls Gaussian Entrance Rank and Avoidance of the First Gradient-Flow Saddle
- Depth Separation for Neural Networks under Gaussian Measure
- Serial Depth of Adaptive Parallel Sampling: Lower Bounds and Schedules for Masked Diffusion Models
- Continuous-depth Deep Gaussian Processes
BibTeX
@misc{shou2026logdepth,
title = {{Log-depth entanglement transition in hypercube Gaussian boson sampling}},
author = {Laura Shou and Alexey V. Gorshkov},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.12043},
eprint = {2609.12043},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.12043},
}
RIS
TY - UNPB
TI - Log-depth entanglement transition in hypercube Gaussian boson sampling
AU - Laura Shou
AU - Alexey V. Gorshkov
PY - 2026
DA - 2026/09/10
PB - arXiv
DO - 10.48550/arxiv.2609.12043
UR - https://arxiv.org/abs/2609.12043
AB - We study an entanglement transition at logarithmic depth in random hypercube linear optical networks. Starting from an initial Gaussian state with all modes squeezed, we prove that random hypercube linear optical networks on n modes generate ensemble-averaged subsystem entanglement within a constant factor of its maximum in all subsystems at circuit depth Θ(log n). Below depth log_2n, there is an extensive subsystem with no entanglement. The entanglement generation in logarithmic depth can be compared to recent progress towards O(log n) depth average-case sampling hardness for Gaussian boson sampling in a hypercube network.
ER -