Gluing Randomness via Entanglement: Tight Bound from Second Rényi Entropy
- URL: http://arxiv.org/abs/2601.16454v1
- Date: Fri, 23 Jan 2026 05:17:44 GMT
- Title: Gluing Randomness via Entanglement: Tight Bound from Second Rényi Entropy
- Authors: Wonjun Lee, Hyukjoon Kwon, Gil Young Cho,
- Abstract summary: We identify entanglement as the key resource that enables local random unitaries to generate global random states by effectively gluing randomness across the system.<n>We present a novel method for generating pseudorandom states in multipartite systems from a locally entangled state via pseudorandom unitaries in each of parties.
- Score: 5.664171868626635
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The efficient generation of random quantum states is a long-standing challenge, motivated by their diverse applications in quantum information processing tasks. In this work, we identify entanglement as the key resource that enables local random unitaries to generate global random states by effectively gluing randomness across the system. Specifically, we demonstrate that approximate random states can be produced from an entangled state $|ψ\rangle$ through the application of local random unitaries. We show that the resulting ensemble forms an approximate state design with an error saturating as $Θ(e^{-\mathcal{N}_2(ψ)})$, where $\mathcal{N}_2(ψ)$ is the second Rényi entanglement entropy of $|ψ\rangle$. Furthermore, we prove that this tight bound also applies to the second Rényi entropy of coherence when the ensemble is constructed using coherence-free operations. These results imply that, when restricted to resource-free gates, the quality of the generated random states is determined entirely by the resource content of the initial state. Notably, we find that among all $α$-Rényi entropeis, the second Rényi entropy yields the tightest bounds. Consequently, these second Rényi entropies can be interpreted as the maximal capacities for generating randomness using resource-free operations. Finally, moving beyond approximate state designs, we utilize this entanglement-assisted gluing mechanism to present a novel method for generating pseudorandom states in multipartite systems from a locally entangled state via pseudorandom unitaries in each of parties.
Related papers
- Entanglement dynamics and Page curves in random permutation circuits [0.0]
We study the ensembles generated by quantum circuits that randomly permute the computational basis.<n>Our results highlight the implications of classical features on entanglement generation in many-body systems.
arXiv Detail & Related papers (2025-05-09T16:09:48Z) - Optimizing random local Hamiltonians by dissipation [44.99833362998488]
We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum.
Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
arXiv Detail & Related papers (2024-11-04T20:21:16Z) - Storage and retrieval of two unknown unitary channels [35.35606314237919]
We consider the case where the unknown unitary is selected with equal prior probability from two options.<n>First, we prove that the optimal storage strategy involves the sequential application of the $n$ uses of the unknown unitary.<n>Next, we show that incoherent "measure-and-prepare" retrieval achieves the maximum fidelity between the retrieved operation and the original (qubit) unitary.
arXiv Detail & Related papers (2024-10-30T18:27:46Z) - Rényi divergence-based uniformity guarantees for $k$-universal hash functions [53.80737717363129]
Universal hash functions map the output of a source to random strings over a finite alphabet.<n>We show that it is possible to distill random bits that are nearly uniform, as measured by min-entropy.
arXiv Detail & Related papers (2024-10-21T19:37:35Z) - Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks.
In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
arXiv Detail & Related papers (2024-04-29T15:04:07Z) - Entanglement properties of random invariant quantum states [2.845786137128931]
Entanglement properties of random multipartite quantum states which are invariant under global SU($d$) action are investigated.
We show that with high probability a random SU($d$)-invariant state is close to being maximally entangled with respect to any bipartite cut as the dimension of individual system goes to infinity.
arXiv Detail & Related papers (2022-11-24T17:19:09Z) - A High-Quality Entropy Source Using van der Waals Heterojunction for
True Random Number Generation [0.41998444721319217]
Generators of random sequences used in high-end applications such as cryptography rely on entropy sources for their indeterminism.
We present a compact device capable of detecting discrete charge fluctuations for extracting entropy from physical processes.
We demonstrate an entropy generation rate tunable over multiple orders of magnitude and show the persistence of the underlying physical process for temperatures ranging from cryogenic to ambient conditions.
arXiv Detail & Related papers (2022-04-13T17:25:08Z) - Cryptography from Pseudorandom Quantum States [6.164147034988822]
One-way functions imply the existence of pseudorandom states, but Kretschmer (TQC'20) recently constructed an oracle relative to which there are no one-way functions but pseudorandom states still exist.
We study the intriguing possibility of basing interesting cryptographic tasks on pseudorandom states.
A consequence of (a) is that pseudorandom states are sufficient to construct maliciously secure multiparty protocols in the dishonest majority setting.
arXiv Detail & Related papers (2021-12-18T22:53:16Z) - Random quantum circuits transform local noise into global white noise [118.18170052022323]
We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime.
For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially.
If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
arXiv Detail & Related papers (2021-11-29T19:26:28Z) - Improved device-independent randomness expansion rates using two sided
randomness [3.4376560669160394]
A device-independent randomness expansion protocol aims to take an initial random string and generate a longer one.
We investigate the possible improvement that could be gained using the two-sided randomness.
We also consider a modified protocol in which the input randomness is recycled.
arXiv Detail & Related papers (2021-03-12T19:49:17Z) - Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
Universal quantum computing with continuous variables requires non-Gaussian resources.
The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive.
We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
arXiv Detail & Related papers (2020-07-07T09:19:49Z) - Finite Block Length Analysis on Quantum Coherence Distillation and
Incoherent Randomness Extraction [64.04327674866464]
We introduce a variant of randomness extraction framework where free incoherent operations are allowed before the incoherent measurement.
We show that the maximum number of random bits extractable from a given quantum state is precisely equal to the maximum number of coherent bits that can be distilled from the same state.
Remarkably, the incoherent operation classes all admit the same second order expansions.
arXiv Detail & Related papers (2020-02-27T09:48:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.