On Tractable Exponential Sums

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}}$, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate polynomial with integer coefficients. We show that the sum can be evaluated in polynomial time in n and log N when f is a quadratic polynomial. This is true even when the factorization of N is unknown. Previously, this was known for a prime modulus N. On the other hand, for very specific families of polynomials of degree \ge 3, we show the problem is #P-hard, even for any fixed prime or prime power modulus. This leads to a complexity dichotomy theorem - a complete classification of each problem to be either computable in polynomial time or #P-hard - for a class of exponential sums. These sums arise in the classifications of graph homomorphisms and some other counting CSP type problems, and these results lead to complexity dichotomy theorems. For the polynomial-time algorithm, Gauss sums form the basic building blocks. For the hardness results, we prove group-theoretic necessary conditions for tractability. These tests imply that the problem is #P-hard for even very restricted families of simple cubic polynomials over fixed modulus N

Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture

We relate the construction of a complete set of cyclic mutually unbiased bases, i. e., mutually unbiased bases generated by a single unitary operator, in power-of-two dimensions to the problem of finding a symmetric matrix over F_2 with an irreducible characteristic polynomial that has a given Fibonacci index. For dimensions of the form 2^(2^k) we present a solution that shows an analogy to an open conjecture of Wiedemann in finite field theory. Finally, we discuss the equivalence of mutually unbiased bases.Comment: 11 pages, added chapter on equivalenc

Graph states in phase space

The phase space for a system of $n$ qubits is a discrete grid of $2^{n} \times 2^{n}$ points, whose axes are labeled in terms of the elements of the finite field \Gal{2^n} to endow it with proper geometrical properties. We analyze the representation of graph states in that phase space, showing that these states can be identified with a class of non-singular curves. We provide an algebraic representation of the most relevant quantum operations acting on these states and discuss the advantages of this approach.Comment: 14 pages. 2 figures. Published in Journal of Physics

Geometrical approach to mutually unbiased bases

We propose a unifying phase-space approach to the construction of mutually unbiased bases for a two-qubit system. It is based on an explicit classification of the geometrical structures compatible with the notion of unbiasedness. These consist of bundles of discrete curves intersecting only at the origin and satisfying certain additional properties. We also consider the feasible transformations between different kinds of curves and show that they correspond to local rotations around the Bloch-sphere principal axes. We suggest how to generalize the method to systems in dimensions that are powers of a prime.Comment: 10 pages. Some typos in the journal version have been correcte

Complete Solving for Explicit Evaluation of Gauss Sums in the Index 2 Case

Let $p$ be a prime number, $q=p^f$ for some positive integer $f$, $N$ be a positive integer such that $\gcd(N,p)=1$, and let \k be a primitive multiplicative character of order $N$ over finite field \fq. This paper studies the problem of explicit evaluation of Gauss sums in "\textsl{index 2 case}" (i.e. f=\f{\p(N)}{2}=[\zn:\pp], where \p(\cd) is Euler function). Firstly, the classification of the Gauss sums in index 2 case is presented. Then, the explicit evaluation of Gauss sums G(\k^\la) (1\laN-1) in index 2 case with order $N$ being general even integer (i.e. N=2^{r}\cd N_0 where $r,N_0$ are positive integers and $N_03$ is odd.) is obtained. Thus, the problem of explicit evaluation of Gauss sums in index 2 case is completely solved

On Approximately Symmetric Informationally Complete Positive Operator-Valued Measures and Related Systems of Quantum States

We address the problem of constructing positive operator-valued measures (POVMs) in finite dimension $n$ consisting of $n^2$ operators of rank one which have an inner product close to uniform. This is motivated by the related question of constructing symmetric informationally complete POVMs (SIC-POVMs) for which the inner products are perfectly uniform. However, SIC-POVMs are notoriously hard to construct and despite some success of constructing them numerically, there is no analytic construction known. We present two constructions of approximate versions of SIC-POVMs, where a small deviation from uniformity of the inner products is allowed. The first construction is based on selecting vectors from a maximal collection of mutually unbiased bases and works whenever the dimension of the system is a prime power. The second construction is based on perturbing the matrix elements of a subset of mutually unbiased bases. Moreover, we construct vector systems in \C^n which are almost orthogonal and which might turn out to be useful for quantum computation. Our constructions are based on results of analytic number theory.Comment: 29 pages, LaTe

A note on the sign (unit root) ambiguities of Gauss sums in index 2 and 4 cases

Recently, the explicit evaluation of Gauss sums in the index 2 and 4 cases have been given in several papers (see [2,3,7,8]). In the course of evaluation, the sigh (or unit root) ambiguities are unavoidably occurred. This paper presents another method, different from [7] and [8], to determine the sigh (unit root) ambiguities of Gauss sums in the index 2 case, as well as the ones with odd order in the non-cyclic index 4 case. And we note that the method in this paper are more succinct and effective than [8] and [7]

Discrete coherent and squeezed states of many-qudit systems

We consider the phase space for a system of $n$ identical qudits (each one of dimension $d$, with $d$ a primer number) as a grid of $d^{n} \times d^{n}$ points and use the finite field $GF(d^{n})$ to label the corresponding axes. The associated displacement operators permit to define $s$-parametrized quasidistribution functions in this grid, with properties analogous to their continuous counterparts. These displacements allow also for the construction of finite coherent states, once a fiducial state is fixed. We take this reference as one eigenstate of the discrete Fourier transform and study the factorization properties of the resulting coherent states. We extend these ideas to include discrete squeezed states, and show their intriguing relation with entangled states between different qudits.Comment: 11 pages, 3 eps figures. Submitted for publicatio

On a q-extension of Mehta's eigenvectors of the finite Fourier transform for q a root of unity

It is shown that the continuous q-Hermite polynomials for q a root of unity have simple transformation properties with respect to the classical Fourier transform. This result is then used to construct q-extended eigenvectors of the finite Fourier transform in terms of these polynomials.Comment: 12 pages, thoroughly rewritten, the q-extended eigenvectors now N-periodic with q an M-th root of

The invertibility of the XOR of rotations of a binary word

We prove the following result regarding operations on a binary word whose length is a power of two: computing the exclusive-or of a number of rotated versions of the word is an invertible (one-to-one) operation if and only if the number of versions combined is odd. (This result is not new; there is at least one earlier proof, due to Thomsen [Cryptographic hash functions, PhD thesis, Technical University of Denmark, 28 November 2008]. Our proof may be new.