相关论文: Quadratic Frobenius probable prime tests costing t…
We bound the time necessary to implement the shift unitary on a one-dimensional ring, both using local Hamiltonians and those with power-law interactions. This time is constrained by the Frobenius light cone; hence we prove that (for…
We formulate and solve the fixed horizon linear quadratic covariance steering problem in continuous time with a terminal cost measured in Hilbert-Schmidt (i.e., Frobenius) norm error between the desired and the controlled terminal…
We prove an exponential integral estimate for the quadratic partial sums of multiple Fourier series on large sets that implies some new properties of Fourier series.
We investigate the average distribution of primes represented by positive definite integral binary quadratic forms, the average being taken over negative fundamental discriminants in long ranges. In particular, we prove corresponding…
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open…
The theory of Frobenius groups with Frobenius complements of even order largely reduces to tractable algebraic number theory. If we consider only Frobenius complements with an upper bound $s$ on the number of distinct primes dividing the…
The optimal estimation of a quantum mechanical 2-state system (qubit) - with N identically prepared qubits available - is obtained by measuring all qubits simultaneously in an entangled basis. We report the experimental estimation of qubits…
A quantum Frobenius map a la Lusztig for $\mathfrak{sl}_2$ is categorified at a prime root of unity.
We prove the numerical Hodge standard conjecture for the square of a simple abelian variety of prime dimension, and also in some related cases.
The paper contains results in three areas: First we present a general estimate for tail probabilities of Gaussian quadratic forms with known expectation and variance. Thereafter we analyze the distribution of norms of complex Gaussian…
Generating primes is a fundamental problem in modern cryptography. Deterministic primality tests work well for special integers such as Mersenne or Proth primes, but these forms are quite restrictive. In this paper, we give a direct method…
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
This work builds a unified framework for the study of quadratic form distance measures as they are used in assessing the goodness of fit of models. Many important procedures have this structure, but the theory for these methods is dispersed…
We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…
We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with non destructive single-shot readout of the two qubits. With this processor, we run the Grover…
In this paper, we characterize the (generalized) Frobenius powers and critical exponents of two classes of monomial ideals of a polynomial ring in positive characteristic: powers of the homogeneous maximal ideal, and ideals generated by…
We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…
We construct a Bayesian sequential test of two simple hypotheses about the value of the unobservable drift coefficient of a Brownian motion, with a possibility to change the initial decision at subsequent moments of time for some penalty.…
We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes $p$ in a dyadic interval $[Q,2Q]$ for which a given interval $[u+1,u+\psi(Q)]$ does not contain a quadratic non-residue modulo $p$. The bound…
We investigate possible linear, algebraic, and Frobenius flock characteristic sets of matroids. In particular, we classify possible combinations of linear and algebraic characteristic sets when the algebraic characteristic set is finite or…