Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research identifies a critical entanglement transition in hypercube Gaussian boson sampling occurring at logarithmic circuit depth, establishing a theoretical link between entanglement generation and average-case sampling hardness. The findings demonstrate that random linear optical networks can achieve near-maximal subsystem entanglement efficiently, which is essential for validating the computational advantages of these quantum photonic architectures.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Log-depth entanglement transition in hypercube Gaussian boson sampling

arXiv1 min read

arXiv:2609.12043v1 Announce Type: new 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 $\Theta(\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.

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 $\Theta(\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.

Quantum Physics (quant-ph); Mathematical Physics (math-ph); Probability (math.PR)

arXiv:2609.12043 [quant-ph]

(or arXiv:2609.12043v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.12043 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 191 words

Related coverage