We introduce a family of Finsler metrics, called the
We reduce the classification of finite extensions of function fields (of curves over finite fields) with the same class number to a finite computation; complete this computation in all cases except when both curves have base field
- Award ID(s):
- 1946311
- NSF-PAR ID:
- 10373320
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- Research in Number Theory
- Volume:
- 8
- Issue:
- 4
- ISSN:
- 2522-0160
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract -Fisher–Rao metrics$$L^p$$ , for$$F_p$$ , which generalizes the classical Fisher–Rao metric$$p\in (1,\infty )$$ , both on the space of densities$$F_2$$ and probability densities$${\text {Dens}}_+(M)$$ . We then study their relations to the Amari–C̆encov$${\text {Prob}}(M)$$ -connections$$\alpha $$ from information geometry: on$$\nabla ^{(\alpha )}$$ , the geodesic equations of$${\text {Dens}}_+(M)$$ and$$F_p$$ coincide, for$$\nabla ^{(\alpha )}$$ . Both are pullbacks of canonical constructions on$$p = 2/(1-\alpha )$$ , in which geodesics are simply straight lines. In particular, this gives a new variational interpretation of$$L^p(M)$$ -geodesics as being energy minimizing curves. On$$\alpha $$ , the$${\text {Prob}}(M)$$ and$$F_p$$ geodesics can still be thought as pullbacks of natural operations on the unit sphere in$$\nabla ^{(\alpha )}$$ , but in this case they no longer coincide unless$$L^p(M)$$ . Using this transformation, we solve the geodesic equation of the$$p=2$$ -connection by showing that the geodesic are pullbacks of projections of straight lines onto the unit sphere, and they always cease to exists after finite time when they leave the positive part of the sphere. This unveils the geometric structure of solutions to the generalized Proudman–Johnson equations, and generalizes them to higher dimensions. In addition, we calculate the associate tensors of$$\alpha $$ , and study their relation to$$F_p$$ .$$\nabla ^{(\alpha )}$$ -
Abstract We study the distribution over measurement outcomes of noisy random quantum circuits in the regime of low fidelity, which corresponds to the setting where the computation experiences at least one gate-level error with probability close to one. We model noise by adding a pair of weak, unital, single-qubit noise channels after each two-qubit gate, and we show that for typical random circuit instances, correlations between the noisy output distribution
and the corresponding noiseless output distribution$$p_{\text {noisy}}$$ shrink exponentially with the expected number of gate-level errors. Specifically, the linear cross-entropy benchmark$$p_{\text {ideal}}$$ F that measures this correlation behaves as , where$$F=\text {exp}(-2s\epsilon \pm O(s\epsilon ^2))$$ is the probability of error per circuit location and$$\epsilon $$ s is the number of two-qubit gates. Furthermore, if the noise is incoherent—for example, depolarizing or dephasing noise—the total variation distance between the noisy output distribution and the uniform distribution$$p_{\text {noisy}}$$ decays at precisely the same rate. Consequently, the noisy output distribution can be approximated as$$p_{\text {unif}}$$ . In other words, although at least one local error occurs with probability$$p_{\text {noisy}}\approx Fp_{\text {ideal}}+ (1-F)p_{\text {unif}}$$ , the errors are scrambled by the random quantum circuit and can be treated as global white noise, contributing completely uniform output. Importantly, we upper bound the average total variation error in this approximation by$$1-F$$ . Thus, the “white-noise approximation” is meaningful when$$O(F\epsilon \sqrt{s})$$ , a quadratically weaker condition than the$$\epsilon \sqrt{s} \ll 1$$ requirement to maintain high fidelity. The bound applies if the circuit size satisfies$$\epsilon s\ll 1$$ , which corresponds to only$$s \ge \Omega (n\log (n))$$ logarithmic depth circuits, and if, additionally, the inverse error rate satisfies , which is needed to ensure errors are scrambled faster than$$\epsilon ^{-1} \ge {\tilde{\Omega }}(n)$$ F decays. The white-noise approximation is useful for salvaging the signal from a noisy quantum computation; for example, it was an underlying assumption in complexity-theoretic arguments that noisy random quantum circuits cannot be efficiently sampled classically, even when the fidelity is low. Our method is based on a map from second-moment quantities in random quantum circuits to expectation values of certain stochastic processes for which we compute upper and lower bounds. -
Abstract For a smooth projective variety
X over an algebraic number fieldk a conjecture of Bloch and Beilinson predicts that the kernel of the Albanese map ofX is a torsion group. In this article we consider a product of smooth projective curves and show that if the conjecture is true for any subproduct of two curves, then it is true for$$X=C_1\times \cdots \times C_d$$ X . For a product of two curves over$$X=C_1\times C_2$$ with positive genus we construct many nontrivial examples that satisfy the weaker property that the image of the natural map$$\mathbb {Q} $$ is finite, where$$J_1(\mathbb {Q})\otimes J_2(\mathbb {Q})\xrightarrow {\varepsilon }{{\,\textrm{CH}\,}}_0(C_1\times C_2)$$ is the Jacobian variety of$$J_i$$ . Our constructions include many new examples of non-isogenous pairs of elliptic curves$$C_i$$ with positive rank, including the first known examples of rank greater than 1. Combining these constructions with our previous result, we obtain infinitely many nontrivial products$$E_1, E_2$$ for which the analogous map$$X=C_1\times \cdots \times C_d$$ has finite image.$$\varepsilon $$ -
Abstract Fix a positive integer
n and a finite field . We study the joint distribution of the rank$${\mathbb {F}}_q$$ , the$${{\,\mathrm{rk}\,}}(E)$$ n -Selmer group , and the$$\text {Sel}_n(E)$$ n -torsion in the Tate–Shafarevich group Equation missing<#comment/>asE varies over elliptic curves of fixed height over$$d \ge 2$$ . We compute this joint distribution in the large$${\mathbb {F}}_q(t)$$ q limit. We also show that the “largeq , then large height” limit of this distribution agrees with the one predicted by Bhargava–Kane–Lenstra–Poonen–Rains. -
Abstract We construct an example of a group
for a finite abelian group$$G = \mathbb {Z}^2 \times G_0$$ , a subset$$G_0$$ E of , and two finite subsets$$G_0$$ of$$F_1,F_2$$ G , such that it is undecidable in ZFC whether can be tiled by translations of$$\mathbb {Z}^2\times E$$ . In particular, this implies that this tiling problem is$$F_1,F_2$$ aperiodic , in the sense that (in the standard universe of ZFC) there exist translational tilings ofE by the tiles , but no periodic tilings. Previously, such aperiodic or undecidable translational tilings were only constructed for sets of eleven or more tiles (mostly in$$F_1,F_2$$ ). A similar construction also applies for$$\mathbb {Z}^2$$ for sufficiently large$$G=\mathbb {Z}^d$$ d . If one allows the group to be non-abelian, a variant of the construction produces an undecidable translational tiling with only one tile$$G_0$$ F . The argument proceeds by first observing that a single tiling equation is able to encode an arbitrary system of tiling equations, which in turn can encode an arbitrary system of certain functional equations once one has two or more tiles. In particular, one can use two tiles to encode tiling problems for an arbitrary number of tiles.