相关论文: Quantum integers and cyclotomy
For $q$ a prime power and $\phi$ a rational function with coefficients in $\mathbb{F}_q$, let $p(q,\phi)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_q)$ that is periodic with respect to $\phi$. And if $d$ is a positive integer, let $Q_d$…
The (small) quantum cohomology ring of a flag manifold F encodes enumerative geometry of rational curves on F. We give a proof of the presentation of the ring and of a quantum Giambelli formula, which is more direct and geometric than the…
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…
We determine all degree-4 rational functions f(X) in F_q(X) which permute P^1(F_q), and answer two questions of Ferraguti and Micheli about the number of such functions and the number of equivalence classes of such functions up to composing…
Fourier expansion of the integrand in the path integral formula for the partition function of quantum systems leads to a deterministic expression which, though still quite complex, is easier to process than the original functional integral.…
A formulation of quaternionic quantum mechanics ($\mathbb{H}$QM) is presented in terms of a real Hilbert space. Using a physically motivated scalar product, we prove the spectral theorem and obtain a novel quaternionic Fourier series. After…
Quantum signal processing allows for quantum eigenvalue transformation with Hermitian matrices, in which each eigenspace component of an input vector gets transformed according to its eigenvalue. In this work, we introduce the multivariate…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
Let $C_n(q)$ be the number of ideals of codimension $n$ of $\mathbb{F}_q\left[x, y, x^{-1}, y^{-1} \right]$, where $\mathbb{F}_q$ is the finite field with $q$ elements. Kassel and Reutenauer [KasselReutenauer2015A] proved that $C_n(q)$ is a…
In this note, we characterize all functions $f : \mathbb{N} \rightarrow \mathbb{C}$ such that $f(x_1^2+ \cdots + x_k^2)=f(x_1)^2+ \cdots + f(x_k)^2$, where $k \geq 3$ and $x_1, \cdots, x_k$ are positive integers.
Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in…
We give an $n$-space generalized $q$-binomial theorem, and some new $q$ series identities that resemble the traditional $q$ series partition generating functions. These identities enumerate stepping stone weighted vector partitions.
We define a series $\mathcal{F}_{M,N}$ as a certain generalization of $q$-hypergeometric function. We study its duality and the system of $q$-difference nonlinear equations which admits particular solutions in terms of $\mathcal{F}_{1,M}$.
A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in…
A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host structure where nuclear spin-spin coupling is mediated by laser pulse controlled electron-nuclear transferred…
For any positive integers $s$ and $t$, let $Q_{t}^{s}(n)$ denotes the number of partitions of a positive integer $n$ into distinct parts such that no part is congruent to $s$ or $t-s$ modulo $t$. We prove some Ramanujan-type congruences for…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
The mathematical formalism of Quantum Mechanics is derived or "reconstructed" from more basic considerations of probability theory and information geometry. The starting point is the recognition that probabilities are central to QM: the…
We show how the Shannon entropy function H(p,q)is expressible as a linear combination of other Shannon entropy functions involving quotients of polynomials in p,q of degree n for any given positive integer n. An application to cryptographic…
For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…