arXiv subjects

Eduardo Dueñez

Publications and source records attributed to Eduardo Dueñez.

12 recordsLinked to original sources

arXiv2026

Classification of bipartite observables I: stable and uniformly stable observables

When two quantum systems are prepared independently and each is driven to an idealized limit, the expectation of a bipartite observable may depend on which system is idealized first. We call an observable stable when it does not. We show that stability is equivalent to two operational properties. First, every idealized preparation of one system can be simulated to arbitrary accuracy, uniformly over all probes, by finite mixtures of actual preparations, provided that the probing system is idealized first. Second, any two idealized preparations have a unique, symmetric independent product. Under a uniform form of stability, we prove, the number of preparations that $n$ adaptive probes can tell apart at a fixed margin is bounded by a polynomial in $n$, and responses can be learned with a bounded number of mistakes; otherwise, at some margin, protocols with $n$ probes tell apart $2^n$ preparations. The swap test, Hong--Ou--Mandel coincidences and discrete equality tests turn out to be uniformly stable, with bounds independent of the dimension, while order comparisons of discrete spectra unbounded above are unstable. The proofs rest on the classical fact that a single double limit condition appears, under different names, in topology (Grothendieck), functional analysis (Krivine--Maurey), algebra (Arens), probability (Simons) and combinatorics (Pták), and in model theory as Shelah's stability, where the independent product corresponds to Harrington's lemma. Model theory thus serves as a Rosetta stone, pairing each physical question with its mathematical formulation.

math.FA↗

arXiv2026

Classification of bipartite observables III: simplicity, mixtures and quantum error correction

The paradigm of a simple unstable theory in the sense of Shelah is the theory of the random graph, the Fraïssé limit of the finite graphs. Quantum error correction has a paradigm of its own, and we show that it is the counterpart of the random graph: the Pauli group on countably many qubits, taken modulo phases and with commutation as its relation, is the Fraïssé limit of the finite alternating spaces over the two-element field, and its form computes the syndromes of stabilizer codes. Seen through this correspondence, simplicity theory turns out to be a theory of error correction. Clifford encoding circuits implement the homogeneity of the Pauli group, forking recognizes the logical errors, and the independence theorem of Kim and Pillay is the gluing of syndromes. The two paradigms look alike as first-order structures, and they part company only when observables enter. Each defines a bipartite observable, and we prove that, once preparations are mixed, both acquire the tree property of the second kind in real-valued logic. They reach it by different roads, however, and we show that the probes decide which. The probes of the Pauli observable are the Pauli channels; for them the indicator of each syndrome sector is the difference of the responses of two uniform mixtures, and actual mixtures already witness the tree. The probes of the Rado observable see only marginals; conditions given by actual mixtures remain compatible on disjoint blocks, and the tree must be sought among idealized preparations.

math.LO↗

arXiv2026

Classification of bipartite observables II: NIP observables and the Todorcevic trichotomy

A bipartite observable is stable when its idealized responses are continuous. We show that it is NIP exactly when they are of the first Baire class. They then form a Rosenthal compactum, and the dividing lines of Shelah in model theory, together with the classification of Rosenthal compacta of Todorčević, acquire a physical meaning. For observables, mixtures of states make every hereditarily separable compactum of idealized responses metrizable, and the Todorčević trichotomy becomes a classification into three classes. Each class contains a physical order: the comparison of photon numbers, the comparison of positions, and the causal order of spacetime, whose idealized responses are not first countable because a light cone can shrink to a point; the comparison of two phases on a circle joins it there. Each of the seven minimal families of the heptachotomy, which Argyros, Dodos and Kanellopoulos extracted from the methods of Todorčević, is realized by a tree of preparations of photons, of a particle in a box, or of a spin chain read by a probe; the spin chain also shows that NIP, unlike its uniform version, is not symmetric between the two parties. Finally, for the Ising model in a transverse field we show that, in the ordered phase, the responses of the two pure phases form split pairs whose midpoints, the responses of the symmetric state, form an uncountable discrete set; the proof uses a Lee--Yang theorem for this model.

quant-ph↗

arXiv2026

Complexity of deep computations via topology of function spaces

We use topological methods to study complexity of deep computations and limit computations. We use topology of function spaces, specifically, the classification of Rosenthal compacta, to identify new complexity classes. We use the language of model theory, specifically, the concept of \emph{independence} from Shelah's classification theory, to translate between topology and computation. We use the theory of Rosenthal compacta to characterize approximablility of deep computations, both deterministically and probabilistically.

math.LO↗

arXiv2026

Approximability of deep computations

This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of the series, we characterize deep computations that are bona fide computable, and prove the existence of deep equilibria, which hitherto have been found only empirically in deep learning. A subsequent paper will study the complexity of ultracomputations. Our approach adapts and combines technology from topology of function spaces, structural Ramsey theory, topological dynamics, and model theory.

math.LO↗

arXiv2024

Sums of Powers by L'Hopital's Rule

For a positive integer $d$, let $p_d(n) := 0^d + 1^d + 2^d + \cdots + n^d$; i.e., $p_d(n)$ is the sum of the first $d^{\mathrm{th}}$-powers up to $n$. It's well known that $p_d(n)$ is a polynomial of degree $d+1$ in $n$. While this is usually proved by induction, once $d$ is not small it's a challenge as one needs to know the polynomial for the inductive step. We show how this difficulty can be bypassed by giving a simple proof that $p_d(n)$ is a polynomial of degree $d+1$ in $n$ by using L'Hopital's rule, and show how we can then determine the coefficients by Cramer's rule. This illustrates a general principle and the point of our paper: there's more than one path to a goal, different approaches have their advantages and disadvantages, and the more techniques one knows, the more likely one can successfully attack a problem.

math.NT↗

arXiv2019

Model theory and metric convergence II: Averages of unitary polynomial actions

We use model theory of metric structures to prove the pointwise convergence, with a uniform metastability rate, of averages of a polynomial sequence $\{T_n\}$ (in Leibman's sense) of unitary transformations of a Hilbert space. As a special case, this applies to unitary sequences $\{U^{p(n)}\}$ where $p$ is a polynomial $\mathbb{Z}\to\mathbb{Z}$ and $U$ a fixed unitary operator; however, our convergence results hold for arbitrary Leibman sequences. As a case study, we show that the non-nilpotent "lamplighter group" $\mathbb{Z}\wr\mathbb{Z}$ is realized as the range of a suitable quadratic Leibman sequence. We also indicate how these convergence results generalize to arbitrary Folner averages of unitary polynomial actions of any abelian group $\mathbb{G}$ in place of $\mathbb{Z}$.

math.DS↗

arXiv2019

Model theory and metric convergence I: Metastability and dominated convergence

We study Tao's finitary viewpoint of convergence in metric spaces, as captured by the notion of metastability. We adopt the perspective of continuous model theory. We show that, in essence, metastable convergence with a given rate is the only formulation of metric convergence that can be captured by a theory in continuous first-order logic, a result we call the Uniform Metastability Principle. Philosophically, this principle amounts to the following meta-theorem: "If a classical statement about convergence in metric structures is refined to a statement about metastable convergence with some rate, then the validity of the original statement implies the validity of its metastable version." As an instance of this phenomenon, we formulate an abstract version of Tao's Metastable Dominated Convergence Theorem as a statement about axiomatizable classes of metric structures, and show that it is a direct consequence of the Uniform Metastability Principle.

math.FA↗

arXiv2014

Model Theory and the mean ergodic theorem for abelian unitary actions

We explore connections between von Neumann's mean ergodic theorem and concepts of model theory. As an application we present a proof Wiener's generalization of von Neumann's result in which the group acting on the Hilbert space $\mathcal{H}$ is any abelian group of unitary transformations of $\mathcal{H}$.

math.LO↗

arXiv2011

A Random Matrix Model for Elliptic Curve L-Functions of Finite Conductor

We propose a random matrix model for families of elliptic curve L-functions of finite conductor. A repulsion of the critical zeros of these L-functions away from the center of the critical strip was observed numerically by S. J. Miller in 2006; such behaviour deviates qualitatively from the conjectural limiting distribution of the zeros (for large conductors this distribution is expected to approach the one-level density of eigenvalues of orthogonal matrices after appropriate rescaling).Our purpose here is to provide a random matrix model for Miller's surprising discovery. We consider the family of even quadratic twists of a given elliptic curve. The main ingredient in our model is a calculation of the eigenvalue distribution of random orthogonal matrices whose characteristic polynomials are larger than some given value at the symmetry point in the spectra. We call this sub-ensemble of SO(2N) the excised orthogonal ensemble. The sieving-off of matrices with small values of the characteristic polynomial is akin to the discretization of the central values of L-functions implied by the formula of Waldspurger and Kohnen-Zagier.The cut-off scale appropriate to modeling elliptic curve L-functions is exponentially small relative to the matrix size N. The one-level density of the excised ensemble can be expressed in terms of that of the well-known Jacobi ensemble, enabling the former to be explicitly calculated. It exhibits an exponentially small (on the scale of the mean spacing) hard gap determined by the cut-off value, followed by soft repulsion on a much larger scale. Neither of these features is present in the one-level density of SO(2N). When N tends to infinity we recover the limiting orthogonal behaviour. Our results agree qualitatively with Miller's discrepancy. Choosing the cut-off appropriately gives a model in good quantitative agreement with the number-theoretical data.

math.NT↗

arXiv2010

The lowest eigenvalue of Jacobi random matrix ensembles and Painlevé VI

We present two complementary methods, each applicable in a different range, to evaluate the distribution of the lowest eigenvalue of random matrices in a Jacobi ensemble. The first method solves an associated Painleve VI nonlinear differential equation numerically, with suitable initial conditions that we determine. The second method proceeds via constructing the power-series expansion of the Painleve VI function. Our results are applied in a forthcoming paper in which we model the distribution of the first zero above the central point of elliptic curve L-function families of finite conductor and of conjecturally orthogonal symmetry.

math.CA↗

arXiv2010

Roots of the derivative of the Riemann zeta function and of characteristic polynomials

We investigate the horizontal distribution of zeros of the derivative of the Riemann zeta function and compare this to the radial distribution of zeros of the derivative of the characteristic polynomial of a random unitary matrix. Both cases show a surprising bimodal distribution which has yet to be explained. We show by example that the bimodality is a general phenomenon. For the unitary matrix case we prove a conjecture of Mezzadri concerning the leading order behavior, and we show that the same follows from the random matrix conjectures for the zeros of the zeta function.

math.NT↗