相关论文: Pseudorandom number generation by p-adic ergodic t…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…
It is shown that superefficient Monte Carlo computations can be carried out by using chaotic dynamical systems as non-uniform random-number generators. Here superefficiency means that the expectation value of the square of the error…
Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…
Random numbers are central to various applications such as secure communications, quantum key distribution theory (QKD), statistics, and other tasks. One of today's most popular generators is quantum random numbers (QRNGs). The inherent…
Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical…
In the quantum Monte Carlo (QMC) method, the Pseudo-Random Number Generator (PRNG) plays a crucial role in determining the computation time. However, the hidden structure of the PRNG may lead to serious issues such as the breakdown of the…
It is shown that the $M$-algebra related with the $M$ theory comes in two variants. Besides the standard $M$ algebra based on the real structure, an alternative octonionic formulation can be consistently introduced. This second variant has…
We consider classes of pseudo-random graphs on $n$ vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^\delta,np+Cn^\delta)$ and $(np^2- C n^\delta, np^2 +C…
We develop a pseudo-random generator to fool degree-$d$ polynomial threshold functions with respect to the Gaussian distribution. For $c>0$ any constant, we construct a pseudo-random generator that fools such functions to within $\epsilon$…
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem…
In this paper, we establish a general representation theorem for generator of backward stochastic differential equation (BSDE), whose generator has a quadratic growth in $z$. As some applications, we obtain a general converse comparison…
We generalize Sepasdar's method for finding a generator matrix of two-dimensional cyclic codes to find an independent subset of a general multicyclic code, which may form a basis of the code as a vector subspace. A generator matrix can be…
We study, from the viewpoint of metrical number theory and (infinite) ergodic theory, the probabilistic laws governing the occurrence of prime numbers as digits in continued fraction expansions of real numbers.
The increasing availability of relational data has contributed to a growing reliance on network-based representations of complex systems. Over time, these models have evolved to capture more nuanced properties, such as the heterogeneity of…
We explore the implementation of pseudo-random single-qubit rotations and multi-qubit pseudo-random circuits constructed only from Clifford gates and the T-gate, a phase rotation of pi/4. Such a gate set would be appropriate for…
The number of inversions is a statistic on permutation groups measuring the degree to which the entries of a permutation are out of order. We provide a generalization of that statistic by introducing the statistic number of pseudoinversions…
Let $A$ be a hereditary artin algebra and $A^{(m)}$ be the $m$-replicated algebra of $A$. We investigate the possibilities for the global dimensions of the endomorphism algebras of generator-cogenerators over $A^{(m)}$.
We present a quantum random number generator (QRNG) based on the random outcomes inherent in projective measurements on a superposition of quantum states of light. Firstly, we use multiplexed holograms encoded on a spatial light modulator…
We study the spectrum generating closed nonlinear superconformal algebra that describes $\mathcal{N}=2$ super-extensions of rationally deformed quantum harmonic oscillator and conformal mechanics models with coupling constant $g=m(m+1)$,…
Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements…