Quantum
Scrambling leads to entanglement cost in NLQC
Publication: quant-ph updates on arXiv.org
Author: Atsuya Hasegawa, Alex May
Source published: 19/11/2026, 05:00:00 UTC
Briefing created: 19/11/2026, 06:26:09 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 19/11/2026, 05:13:24 UTC.
Briefings
A new quantum information paper establishes that scrambling in unitaries is the primary cause of entanglement cost in non-local quantum computation (NLQC). The study provides the first faithful lower bound for entanglement cost using tripartite mutual information, proving that zero entanglement cost requires no scrambling. This work also confirms that controllable correlation remains a valid lower bound, resolving a prior conjecture by Cleve and May.
Key points
- Scrambling in unitaries is the primary cause of entanglement cost in non-local quantum computation (NLQC).
- The tripartite mutual information provides the first faithful lower bound for entanglement cost in NLQC.
Context
Non-local quantum computation (NLQC) uses shared entanglement and a single round of quantum communication to implement joint channels. Understanding lower bounds on entanglement needed for these channels is crucial for applications. Previous bounds only applied to specially constructed examples, leaving the properties of channels with entanglement cost unclear.
Limitations
The study relies on a single preprint (arXiv:2611.23378v1) from November 2026, which may be subject to revision. The results are based on theoretical analysis of unitaries and entropic quantities, and the paper does not include experimental data or specific numerical simulations of physical systems.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 19/11/2026, 06:26:09 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeiduqn6ox3hxzbu4c53lfzqg7t3l6nxhmal3vnobb3c22xkleycjnm