Tootfinder

from my link log —
Reservoir sampling: who discovered Algorithm R?
https://markkm.com/blog/reservoir-sampling/
saved 2025-05-16 http…

🇺🇦 #NowPlaying on KEXP's #MiddayShow
Sunflower Bean:
🎵 Nothing Romantic
#SunflowerBean
https://sunflowerbean.bandcamp.com/track/nothing-romantic
https://open.spotify.com/track/6S1ZjmooIAelHzWirOrsqr

Brockett cost function for symplectic eigenvalues
Nguyen Thanh Son
https://arxiv.org/abs/2506.07560 https://arxiv.org/pdf/2506.07560

Brockett cost function for symplectic eigenvalues
The symplectic eigenvalues and corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem can be computed via minimization of a trace cost function under the symplecticity constraint. The optimal solution to this problem only offers a symplectic basis for a symplectic eigenspace corresponding to the sought symplectic eigenvalues. In this paper, we introduce a Brockett cost function and investigate the connection between its properties and the symplec…

One-dimensional quantile-stratified sampling and its application in statistical simulations
Ben O'Neill
https://arxiv.org/abs/2506.07437 https://

One-dimensional quantile-stratified sampling and its application in statistical simulations
In this paper we examine quantile-stratified samples from a known univariate probability distribution, with stratification occurring over a partition of the quantile regions in the distribution. We examine some general properties of this sampling method and we contrast it with standard IID sampling to highlight its similarities and differences. We examine the applications of this sampling method to various statistical simulations including importance sampling. We conduct simulation analysis to …

heise | JavaScript: Einen Discord-Bot für die eigene Gaming-Community programmieren
Ein Discord-Bot begrüßt User, zeigt Daten an oder schmeißt Spammer raus. Wir zeigen, wie Sie mit dem Framework discord.js einen simplen Bot programmieren.

Optimal quantum sampling on distributed databases
Longyun Chen, Jingcheng Liu, Penghui Yao
https://arxiv.org/abs/2506.07724 https://a…

Optimal quantum sampling on distributed databases
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cost of large-scale quantum storage, we initiate the study of quantum sampling in a distributed setting. Specifically, we assume that the data is distributed among multiple machines, and each machine solely maintains a basic oracle that counts the multiplicity of individual elements. Given a quantum sampling task, which …

New simple modules for the $W$-algebra $W(2,2)$
Hongjia Chen, Dashu Xu
https://arxiv.org/abs/2506.08794 https://arxiv.org/pdf/2506.08…

New simple modules for the $W$-algebra $W(2,2)$
In this paper, we construct a novel class of simple modules for the $W$-algebra $W(2,2)$. Our approach involves taking tensor products of finitely many non-weight simple modules $Ω(λ,α,h)$ with an arbitrary simple restricted module. We provide a necessary and sufficient condition for these modules to be simple, and subsequently determine their isomorphism classes. Through a comparative analysis with other known simple modules in the literature, we establish that these constructed modules are…

Modular resurgence, $q$-Pochhammer symbols, and quantum operators from mirror curves
Veronica Fantini, Claudia Rella
https://arxiv.org/abs/2506.08265 https…

Modular resurgence, $q$-Pochhammer symbols, and quantum operators from mirror curves
Building on the results of [1,2], we study the resurgence of $q$-Pochhammer symbols and determine their summability and quantum modularity properties. We construct a new, infinite family of pairs of modular resurgent series from the asymptotic expansions of sums of $q$-Pochhammer symbols weighted by suitable Dirichlet characters. These weighted sums fit into the modular resurgence paradigm and provide further evidence supporting our conjectures in [1]. In the context of the topological string/s…

This https://arxiv.org/abs/2212.14225 has been replaced.
link: https://scholar.google.com/scholar?q=a

Symplectic self-orthogonal quasi-cyclic codes
In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a class of $1$-generator QC codes and their symplectic dual codes by decomposing code spaces. As an application, we construct numerous new binary symplectic self-orthogonal QC codes with excellent parameters, leading to $117$ record-breaking quantum error-correc…

This https://arxiv.org/abs/2405.01786 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

On computational complexity and average-case hardness of shallow-depth boson sampling
Boson sampling, a computational task believed to be classically hard to simulate, is expected to hold promise for demonstrating quantum computational advantage using near-term quantum devices. However, noise in experimental implementations poses a significant challenge, potentially rendering boson sampling classically simulable and compromising its classical intractability. Numerous studies have proposed classical algorithms under various noise models that can efficiently simulate boson samplin…