相关论文: Quantum Computing and Zeroes of Zeta Functions
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
The quantum walk is a quantum counterpart of the classical random walk. On the other hand, the absolute zeta function can be considered as a zeta function over F_1. This paper presents a connection between the quantum walk and the absolute…
The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic…
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
The Riemann Hypothesis has been of central interest to mathematicians for a long time and many unsuccessful attempts have been made to either prove or disprove it. Since the Riemann zeta function is defined as a sum of the infinite number…
The Argand diagram is used to display some characteristics of the Riemann Zeta function. The zeros of the Zeta function on the complex plane give rise to an infinite sequence of closed loops, all passing through the origin of the diagram.…
The hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simulations of a possible hypercomputational algorithm based on…
Necessary and sufficient conditions are given for the construction of a hybrid quantum computer that operates on both continuous and discrete quantum variables. Such hybrid computers are shown to be more efficient than conventional quantum…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
We extend the approach Abbott, Kedlaya and Roe to computation of the zeta function of a projective hypersurface with $\tau$ isolated ordinary double points over a finite field $\mathbb{F}_q$ given by the reduction of a homogeneous…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…
The non-trivial zeros of the Riemann zeta function and the prime numbers can be plotted by a modified von Mangoldt function. The series of non-trivial zeta zeros and prime numbers can be given explicitly by superposition of harmonic waves.…
Concordant computation is a circuit-based model of quantum computation for mixed states, that assumes that all correlations within the register are discord-free (i.e. the correlations are essentially classical) at every step of the…
The Riemann Hypothesis (RH), one of the most profound unsolved problems in mathematics, concerns the nontrivial zeros of the Riemann zeta function. Establishing connections between the RH and physical phenomena could offer new perspectives…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
We present a numerical study of Riemann's formula for the oscillating part of the density of the primes and their powers. The formula is comprised of an infinite series of oscillatory terms, one for each zero of the zeta function on the…
The relationship between quantum physics and discrete mathematics is reviewed in this article. The Boolean functions unitary representation is considered. The relationship between Zhegalkin polynomial, which defines the algebraic normal…
We develop a practical method for computing local zeta functions of groups, algebras, and modules in fortunate cases. Using our method, we obtain a complete classification of generic local representation zeta functions associated with…
This is the first of two papers in which we introduce and study two bivariate zeta functions associated to unipotent group schemes over rings of integers of number fields. One of these zeta functions encodes the numbers of isomorphism…