Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Uniform Rényi Privacy Amplification by Shuffling

Alex B. Shvets

Published Nov 9, 2026• 0 citations
Publisher

Abstract

We study independent one-message shuffling through a common channel with replacement adjacency and arbitrary deterministic backgrounds. Under one local Rényi budget, without a pointwise likelihood-ratio cap, the optimal uniform same-order rate is $n^{-\min\{1,\alpha-1\}}$ for fixed $\alpha>1$; a local KL budget alone gives no uniform amplification. We determine the exact asymptotic worst-case approximate-DP envelope at each fixed positive privacy parameter and the leading inverse calibration at failure probability $d/n$ for all fixed $\alpha>1$. Matching upper bounds are uniform over channels and alphabets varying with $n$. At and above order three, the calibration coefficient is the square root of an attained local triple-variance frontier, realizable on at most nine output symbols. At order three we evaluate this frontier on a certified budget interval and identify the unique extremal ratio law. The same frontier determines the limiting central-window profile for $\alpha>2$ and the logarithmic moderate-window exponent. Under local $\chi^2$ diameter $C$, the exact asymptotic neighboring coefficient is $2C(C+5)/(C+4)$; we also give explicit finite amplification bounds and a fixed-channel background reduction. Formal verification. All statements of the paper have been formalized in Lean 4 (version 4.35.0) with Mathlib (release v4.35.0), including the computer-assisted order-three theorem, for which all certificate computations are checked by the Lean kernel. The formal proofs contain no sorry and use only the standard axioms propext, Classical.choice and Quot.sound. The project builds from scratch, every module passes a replay by the Lean kernel (leanchecker), and all theorems of the interface file Statements.lean, together with everything they depend on (69 078 declarations in total), were rechecked by the independent type checker nanoda. ChatGPT was used to write the Lean code and Claude to audit it; the author takes full responsibility for all results. Files. The PDF is the paper (24 pages). The ZIP archive Uniform_Renyi_arXiv_source_2026-11-09.zip is the LaTeX source. Its folder anc/ contains the exact rational polynomial certificate for the computer-assisted order-three theorem (verify_order_three_frontier.py, needs only the Python standard library) and further exact checks. The ZIP archive UniformRenyiShuffle-Lean-1.0.0-2026-11-09.zip is the Lean project UniformRenyiShuffle 1.0.0; its file MAP.md gives the Lean name of every statement of the paper. Changes from version 1. The Lean formalization is added. The paper and its LaTeX source are unchanged.

DOI
10.5281/zenodo.24063887

Related papers

An almost-entropic Ingleton score below -0.09738: Conditional hashing of a binary parity structure

Sm Riis

We prove an improved lower bound of 0.097387436922 on the largest normalised Ingleton violation among four-variable almost-entropic vectors. Previously reported constructions reach approximately 0.0925, used as a rounded benchmark; the best published universal upper bound is 19/124. Conditional parity hashing combines local binary parity labels, one common linear hash, simultaneous conditional privacy amplification and joint conditioning. Applied to a 24-atom source of Matúš and Csirmaz, it subtracts a multiple of the uniform-matroid rank function U(3,4) from all fifteen entropy coordinates. The limiting signed score lies in [-0.097387436923, -0.097387436922], and finite-alphabet distributions with score below -0.09738 exist. This record contains the preprint PDF, manuscript sources, Lean proof sources, exact numerical checkers, build instructions and verification evidence. The main theorem, including the closed rate interval, score enclosure and finite-alphabet existence statement, was rebuilt and kernel-checked in Lean 4.35.0-rc2 with pinned Mathlib dependencies. The finite sampler and fixed-path optimality argument are written proofs rather than separate Lean declarations. Søren Riis is the creator and coordinator and directed the research. Astra/Codex and Claude contributed mathematical development, computation and verification; Claude contributed the Lean formalisation and adversarial review. The source construction is due to Matúš and Csirmaz; the paper gives full references to the earlier entropy-region and privacy-amplification work. AI checks do not constitute independent human peer review. Licences by component: the paper PDF, LaTeX sources and original figures are CC BY 4.0; Lean sources, Python checkers and build scripts are Apache-2.0. Third-party dependencies retain their own licences. Repository: https://github.com/SR123/conditional-parity-hashing

•Oct 26, 2026•0 citations

Privacy Amplification and Decoupling Without Smoothing

Frédéric Dupuis

We prove an achievability result for privacy amplification and decoupling in terms of the sandwiched Rényi entropy of order$\alpha \in (1,2]$; this extends previous results which worked for$\alpha =2$. The fact that this proof works for$\alpha $close to 1 means that we can bypass the smooth min-entropy in the many applications where the bound comes from the fully quantum AEP or entropy accumulation, and carry out the whole proof using the Rényi entropy, thereby easily obtaining an error exponent for the final task. This effectively replaces smoothing, which is a difficult high-dimensional optimization problem, by an optimization problem over a single real parameter$\alpha $.

arXiv:2105.05342•IEEE Transactions on Information Theory•Aug 28, 2023•48 citations

Twenty-Three Certified Decimals: Rigorous Ground-State Energies, Correlations and a Coupling Curve for the Half-Filled 4×4 Hubbard Model: certificate bundle v1.0.0

Bryan W. Daugherty, Shawn Ryan, Gregory Ward

We prove the ground-state energy of the periodic, half-filled 4×4 repulsive Hubbard model with t = 1 to at least 23 decimal places at U = 1, 2, 3, 4, 5, 6, 7, 8, 10, 12 and 16: every enclosure has width below 10⁻²⁴. The double occupancy, the spin correlations and the staggered structure factor have certified interval widths below 10⁻¹⁰, and the kinetic energy below 10⁻⁹. Hypercube, spin and pseudospin symmetries reduce the problem to a 19,186-dimensional block that contains the ground state by Lieb's theorem and a character argument. A binary64 Cholesky factorization, verified using a rigorous rounding-error bound evaluated in exact rational arithmetic, certifies spectral separation within this block; exact Rayleigh quotients and residuals then give Temple enclosures of the energy and bounds on the angle to the ground state, which certify the observables. Separation certificates at both ends and a perturbative trial family enclose E₀(U) for every U in [3.9, 4.1], with uniform width at most 1.6 × 10⁻⁹. Two independent implementations replay the certificates, the interlacing and Temple steps are proved in Lean 4, and all computations run on one laptop. At U = 4 and 8, exact-arithmetic brackets that use neither Lieb's theorem nor floating point are also given, and the enclosures bound their deficits. At U = 4 the certified energy rounds to −13.62185 and excludes the published value −13.62192 [Physical Review B 94, 085103]. Contents of the bundle paper/ — the manuscript (Markdown and PDF), its figures, and supplementary/ with five videos generated from the certificate files. rayleigh/symmetry/ — the enclosure pipeline (block dimensions, exact basis, certificates, observables, the interval certificate) and recheck/, the independent Rust reference checker; certificates/ holds every certificate, trial vector, run log, checker log and the clean-replay report. sos/, rayleigh/demo/, cluster/ — the exact-arithmetic bracket certificates and the expected outputs of their checkers (golden_ files); the bracket checkers belong to the authors' certification software and are not included. formal/ — the Lean 4 statements (rank-one interlacing, Temple's inequality, the sum-of-squares remainder bound). tests/ — the generators of every table, figure and video of the manuscript. replay.sh, REPLAY.md — the automated replay and the step-by-step commands. AUDIT_AXIOMS.txt — #print axioms of the formal statements. SHA256SUMS — checksums of every file. Verification PYTHON=<python with numpy and scipy> ./replay.sh rebuilds the symmetry block from the Hamiltonian, reproduces every certificate from the stored integer vectors, runs the Rust reference checker, recomputes the observables and checks the manuscript's tables, and writes REPLAY_REPORT.md. It needs about 12 GB of memory and 16 GB of free disk, and takes about half an hour on the hardware above; its work directory is removed at the end. REPLAY.md lists the commands step by step; rayleigh/symmetry/certificates/REPLAY_REPORT_2026-10-14.md is a clean replay of this material. Not included: the two 662,547,600-byte full-sector vectors of the upper bracket certificates (their SHA-256 digests are in rayleigh/demo/). Integrity: shasum -a 256 -c SHA256SUMS inside the bundle; the SHA-256 of the tarball is in the .sha256 file beside it. Environment Python: 3.13.7 with numpy 2.5.4, scipy 1.18.1, matplotlib 3.11.2 (producer-requirements.txt) Rust: 1.90.0 (reference checker; cargo build --release in rayleigh/symmetry/recheck) Lean: leanprover/lean4:v4.33.1 with Mathlib v4.33.1 (formal statements) Hardware: Apple M3 Pro, 18 GiB (all production and replay) License: CC BY-NC 4.0. Commercial use requires written permission from Origin Neural AI (labs@smartledger.solutions).

•Oct 14, 2026•1 citation

Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels

Rami Ezzine, Moritz Wiese, Christian Deppe +1 more

IEEE Transactions on Information Theory•Apr 30, 2025•1 citation

BINDU–VECTRA: Machine-Checked Ancilla-Uniform Mixing Bounds for Independent Generalized Amplitude-Damping Channels

Boris Batenin, Andrei Preece

BINDU–VECTRA reports a Lean 4.19.0 machine-checked, ancilla-uniform Schatten-1 mixing bound for finite products of independent generalized amplitude-damping (GAD) channels. The result covers any number N of sites, strictly positive local pumping and decay rates Gₖ and Kₖ, nonnegative time t, every finite-dimensional ancilla, and arbitrary complex input matrices X—not only density operators. With rₖ(t) = exp[−(Gₖ + Kₖ)t/2], the explicit envelope C_N(t) = min{2, Σₖ₌₀ᴺ⁻¹ [rₖ(t) + rₖ(t)²]} controls the distance between the product GAD evolution Φₜ⁽ᴺ⁾ and the stationary-replacement channel ℛ⁽ᴺ⁾: ‖[(Φₜ⁽ᴺ⁾ − ℛ⁽ᴺ⁾) ⊗ id_A](X)‖₁ ≤ C_N(t)‖X‖₁. This is a pointwise estimate uniform over finite ancillas; it is not presented as a separate formal construction of the diamond-norm supremum. The principal advance is the removal of previously conditional site-kernel and hybrid-step hypotheses. Eight named Lean declarations connect physical Kraus actions to the global native-index channel representation, establish stationary-replacer and Pauli-Z/dephasing bridges, and prove the unconditional hybrid increment ‖[(ℋₖ₊₁ − ℋₖ) ⊗ id_A](X)‖₁ ≤ [rₖ(t) + rₖ(t)²]‖X‖₁. Telescoping these increments yields the N-site envelope, while a uniform bound of 2 supplies its cap. The site-to-global correspondence is established in the proof chain rather than assumed as an informal relabeling of tensor indices. The accompanying reproducibility materials identify 53 source modules, SHA-256 inventories, and pinned Lean 4.19.0/Mathlib v4.19.0 dependencies. The eight target declarations have source-matched, user-supplied successful build and axiom records reporting only Lean’s standard foundational axioms; however, a fresh independent kernel replay remains necessary before an independently certified release can be claimed. The work does not establish an exact GAD diamond norm, an optimal mixing exponent, or results for interacting Lindbladians. It instead supplies a reproducible formal foundation for future independent certification, explicit diamond-norm formalization, and investigation of sharper or more general quantum mixing estimates.

•Nov 10, 2026•0 citations

Hashing a source with an unknown probability distribution

Christian Cachin

Renyi entropy of order 2 characterizes how many almost uniform random bits can be extracted from a distribution by universal hashing using a technique known as "privacy amplification" in cryptography. We generalize this result and show that if P/sub S/ is the assumed distribution of a random variable with true distribution P/sub X/, then the amount of extractable almost uniform randomness corresponds to -logP[X=S], when X and S are interpreted as independent random variables.

IEEE International Symposium on Information Theory (ISIT)•Nov 27, 2002•2 citations
We study independent one-message shuffling through a common channel with replacement adjacency and arbitrary deterministic backgrounds. Under one local Rényi budget, without a pointwise likelihood-ratio cap, the optimal uniform same-order rate is n−min⁡{1,α−1}n^{-\min\{1,\alpha-1\}}n−min{1,α−1} for fixed α>1\alpha>1α>1; a local KL budget alone gives no uniform amplification. We determine the exact asymptotic worst-case approximate-DP envelope at each fixed positive privacy parameter and the leading inverse calibration at failure probability d/nd/nd/n for all fixed α>1\alpha>1α>1. Matching upper bounds are uniform over channels and alphabets varying with nnn. At and above order three, the calibration coefficient is the square root of an attained local triple-variance frontier, realizable on at most nine output symbols. At order three we evaluate this frontier on a certified budget interval and identify the unique extremal ratio law. The same frontier determines the limiting central-window profile for α>2\alpha>2α>2 and the logarithmic moderate-window exponent. Under local χ2\chi^2χ2 diameter CCC, the exact asymptotic neighboring coefficient is 2C(C+5)/(C+4)2C(C+5)/(C+4)2C(C+5)/(C+4); we also give explicit finite amplification bounds and a fixed-channel background reduction. Formal verification. All statements of the paper have been formalized in Lean 4 (version 4.35.0) with Mathlib (release v4.35.0), including the computer-assisted order-three theorem, for which all certificate computations are checked by the Lean kernel. The formal proofs contain no sorry and use only the standard axioms propext, Classical.choice and Quot.sound. The project builds from scratch, every module passes a replay by the Lean kernel (leanchecker), and all theorems of the interface file Statements.lean, together with everything they depend on (69 078 declarations in total), were rechecked by the independent type checker nanoda. ChatGPT was used to write the Lean code and Claude to audit it; the author takes full responsibility for all results. Files. The PDF is the paper (24 pages). The ZIP archive Uniform_Renyi_arXiv_source_2026-11-09.zip is the LaTeX source. Its folder anc/ contains the exact rational polynomial certificate for the computer-assisted order-three theorem (verify_order_three_frontier.py, needs only the Python standard library) and further exact checks. The ZIP archive UniformRenyiShuffle-Lean-1.0.0-2026-11-09.zip is the Lean project UniformRenyiShuffle 1.0.0; its file MAP.md gives the Lean name of every statement of the paper. Changes from version 1. The Lean formalization is added. The paper and its LaTeX source are unchanged.
We prove an improved lower bound of 0.097387436922 on the largest normalised Ingleton violation among four-variable almost-entropic vectors. Previously reported constructions reach approximately 0.0925, used as a rounded benchmark; the best published universal upper bound is 19/124. Conditional parity hashing combines local binary parity labels, one common linear hash, simultaneous conditional privacy amplification and joint conditioning. Applied to a 24-atom source of Matúš and Csirmaz, it subtracts a multiple of the uniform-matroid rank function U(3,4) from all fifteen entropy coordinates. The limiting signed score lies in [-0.097387436923, -0.097387436922], and finite-alphabet distributions with score below -0.09738 exist. This record contains the preprint PDF, manuscript sources, Lean proof sources, exact numerical checkers, build instructions and verification evidence. The main theorem, including the closed rate interval, score enclosure and finite-alphabet existence statement, was rebuilt and kernel-checked in Lean 4.35.0-rc2 with pinned Mathlib dependencies. The finite sampler and fixed-path optimality argument are written proofs rather than separate Lean declarations. Søren Riis is the creator and coordinator and directed the research. Astra/Codex and Claude contributed mathematical development, computation and verification; Claude contributed the Lean formalisation and adversarial review. The source construction is due to Matúš and Csirmaz; the paper gives full references to the earlier entropy-region and privacy-amplification work. AI checks do not constitute independent human peer review. Licences by component: the paper PDF, LaTeX sources and original figures are CC BY 4.0; Lean sources, Python checkers and build scripts are Apache-2.0. Third-party dependencies retain their own licences. Repository: https://github.com/SR123/conditional-parity-hashing
We prove an achievability result for privacy amplification and decoupling in terms of the sandwiched Rényi entropy of orderα∈(1,2]\alpha \in (1,2]α∈(1,2]; this extends previous results which worked forα=2\alpha =2α=2. The fact that this proof works for$\alpha closeto1meansthatwecanbypassthesmoothmin−entropyinthemanyapplicationswheretheboundcomesfromthefullyquantumAEPorentropyaccumulation,andcarryoutthewholeproofusingtheReˊnyientropy,therebyeasilyobtaininganerrorexponentforthefinaltask.Thiseffectivelyreplacessmoothing,whichisadifficulthigh−dimensionaloptimizationproblem,byanoptimizationproblemoverasinglerealparameterclose to 1 means that we can bypass the smooth min-entropy in the many applications where the bound comes from the fully quantum AEP or entropy accumulation, and carry out the whole proof using the Rényi entropy, thereby easily obtaining an error exponent for the final task. This effectively replaces smoothing, which is a difficult high-dimensional optimization problem, by an optimization problem over a single real parametercloseto1meansthatwecanbypassthesmoothmin−entropyinthemanyapplicationswheretheboundcomesfromthefullyquantumAEPorentropyaccumulation,andcarryoutthewholeproofusingtheReˊnyientropy,therebyeasilyobtaininganerrorexponentforthefinaltask.Thiseffectivelyreplacessmoothing,whichisadifficulthigh−dimensionaloptimizationproblem,byanoptimizationproblemoverasinglerealparameter\alpha $.
We prove the ground-state energy of the periodic, half-filled 4×4 repulsive Hubbard model with t = 1 to at least 23 decimal places at U = 1, 2, 3, 4, 5, 6, 7, 8, 10, 12 and 16: every enclosure has width below 10⁻²⁴. The double occupancy, the spin correlations and the staggered structure factor have certified interval widths below 10⁻¹⁰, and the kinetic energy below 10⁻⁹. Hypercube, spin and pseudospin symmetries reduce the problem to a 19,186-dimensional block that contains the ground state by Lieb's theorem and a character argument. A binary64 Cholesky factorization, verified using a rigorous rounding-error bound evaluated in exact rational arithmetic, certifies spectral separation within this block; exact Rayleigh quotients and residuals then give Temple enclosures of the energy and bounds on the angle to the ground state, which certify the observables. Separation certificates at both ends and a perturbative trial family enclose E₀(U) for every U in [3.9, 4.1], with uniform width at most 1.6 × 10⁻⁹. Two independent implementations replay the certificates, the interlacing and Temple steps are proved in Lean 4, and all computations run on one laptop. At U = 4 and 8, exact-arithmetic brackets that use neither Lieb's theorem nor floating point are also given, and the enclosures bound their deficits. At U = 4 the certified energy rounds to −13.62185 and excludes the published value −13.62192 [Physical Review B 94, 085103]. Contents of the bundle paper/ — the manuscript (Markdown and PDF), its figures, and supplementary/ with five videos generated from the certificate files. rayleigh/symmetry/ — the enclosure pipeline (block dimensions, exact basis, certificates, observables, the interval certificate) and recheck/, the independent Rust reference checker; certificates/ holds every certificate, trial vector, run log, checker log and the clean-replay report. sos/, rayleigh/demo/, cluster/ — the exact-arithmetic bracket certificates and the expected outputs of their checkers (golden_ files); the bracket checkers belong to the authors' certification software and are not included. formal/ — the Lean 4 statements (rank-one interlacing, Temple's inequality, the sum-of-squares remainder bound). tests/ — the generators of every table, figure and video of the manuscript. replay.sh, REPLAY.md — the automated replay and the step-by-step commands. AUDIT_AXIOMS.txt — #print axioms of the formal statements. SHA256SUMS — checksums of every file. Verification PYTHON=<python with numpy and scipy> ./replay.sh rebuilds the symmetry block from the Hamiltonian, reproduces every certificate from the stored integer vectors, runs the Rust reference checker, recomputes the observables and checks the manuscript's tables, and writes REPLAY_REPORT.md. It needs about 12 GB of memory and 16 GB of free disk, and takes about half an hour on the hardware above; its work directory is removed at the end. REPLAY.md lists the commands step by step; rayleigh/symmetry/certificates/REPLAY_REPORT_2026-10-14.md is a clean replay of this material. Not included: the two 662,547,600-byte full-sector vectors of the upper bracket certificates (their SHA-256 digests are in rayleigh/demo/). Integrity: shasum -a 256 -c SHA256SUMS inside the bundle; the SHA-256 of the tarball is in the .sha256 file beside it. Environment Python: 3.13.7 with numpy 2.5.4, scipy 1.18.1, matplotlib 3.11.2 (producer-requirements.txt) Rust: 1.90.0 (reference checker; cargo build --release in rayleigh/symmetry/recheck) Lean: leanprover/lean4:v4.33.1 with Mathlib v4.33.1 (formal statements) Hardware: Apple M3 Pro, 18 GiB (all production and replay) License: CC BY-NC 4.0. Commercial use requires written permission from Origin Neural AI (labs@smartledger.solutions).
BINDU–VECTRA reports a Lean 4.19.0 machine-checked, ancilla-uniform Schatten-1 mixing bound for finite products of independent generalized amplitude-damping (GAD) channels. The result covers any number N of sites, strictly positive local pumping and decay rates Gₖ and Kₖ, nonnegative time t, every finite-dimensional ancilla, and arbitrary complex input matrices X—not only density operators. With rₖ(t) = exp[−(Gₖ + Kₖ)t/2], the explicit envelope C_N(t) = min{2, Σₖ₌₀ᴺ⁻¹ [rₖ(t) + rₖ(t)²]} controls the distance between the product GAD evolution Φₜ⁽ᴺ⁾ and the stationary-replacement channel ℛ⁽ᴺ⁾: ‖[(Φₜ⁽ᴺ⁾ − ℛ⁽ᴺ⁾) ⊗ id_A](X)‖₁ ≤ C_N(t)‖X‖₁. This is a pointwise estimate uniform over finite ancillas; it is not presented as a separate formal construction of the diamond-norm supremum. The principal advance is the removal of previously conditional site-kernel and hybrid-step hypotheses. Eight named Lean declarations connect physical Kraus actions to the global native-index channel representation, establish stationary-replacer and Pauli-Z/dephasing bridges, and prove the unconditional hybrid increment ‖[(ℋₖ₊₁ − ℋₖ) ⊗ id_A](X)‖₁ ≤ [rₖ(t) + rₖ(t)²]‖X‖₁. Telescoping these increments yields the N-site envelope, while a uniform bound of 2 supplies its cap. The site-to-global correspondence is established in the proof chain rather than assumed as an informal relabeling of tensor indices. The accompanying reproducibility materials identify 53 source modules, SHA-256 inventories, and pinned Lean 4.19.0/Mathlib v4.19.0 dependencies. The eight target declarations have source-matched, user-supplied successful build and axiom records reporting only Lean’s standard foundational axioms; however, a fresh independent kernel replay remains necessary before an independently certified release can be claimed. The work does not establish an exact GAD diamond norm, an optimal mixing exponent, or results for interacting Lindbladians. It instead supplies a reproducible formal foundation for future independent certification, explicit diamond-norm formalization, and investigation of sharper or more general quantum mixing estimates.