41 research outputs found

    On the connection between mutually unbiased bases and orthogonal Latin squares

    Full text link
    We offer a piece of evidence that the problems of finding the number of mutually unbiased bases (MUB) and mutually orthogonal Latin squares (MOLS) might not be equivalent. We study a particular procedure which has been shown to relate the two problems and generates complete sets of MUBs in power-of-prime dimensions and three MUBs in dimension six. For these cases, every square from an augmented set of MOLS has a corresponding MUB. We show that this no longer holds for certain composite dimensions.Comment: 6 pages, submitted to Proceedings of CEWQO 200

    Hjelmslev Geometry of Mutually Unbiased Bases

    Full text link
    The basic combinatorial properties of a complete set of mutually unbiased bases (MUBs) of a q-dimensional Hilbert space H\_q, q = p^r with p being a prime and r a positive integer, are shown to be qualitatively mimicked by the configuration of points lying on a proper conic in a projective Hjelmslev plane defined over a Galois ring of characteristic p^2 and rank r. The q vectors of a basis of H\_q correspond to the q points of a (so-called) neighbour class and the q+1 MUBs answer to the total number of (pairwise disjoint) neighbour classes on the conic.Comment: 4 pages, 1 figure; extended list of references, figure made more illustrative and in colour; v3 - one more figure and section added, paper made easier to follow, references update

    Approximating Turaev-Viro 3-manifold invariants is universal for quantum computation

    Get PDF
    The Turaev-Viro invariants are scalar topological invariants of compact, orientable 3-manifolds. We give a quantum algorithm for additively approximating Turaev-Viro invariants of a manifold presented by a Heegaard splitting. The algorithm is motivated by the relationship between topological quantum computers and (2+1)-D topological quantum field theories. Its accuracy is shown to be nontrivial, as the same algorithm, after efficient classical preprocessing, can solve any problem efficiently decidable by a quantum computer. Thus approximating certain Turaev-Viro invariants of manifolds presented by Heegaard splittings is a universal problem for quantum computation. This establishes a novel relation between the task of distinguishing non-homeomorphic 3-manifolds and the power of a general quantum computer.Comment: 4 pages, 3 figure

    Constructing Mutually Unbiased Bases in Dimension Six

    Full text link
    The density matrix of a qudit may be reconstructed with optimal efficiency if the expectation values of a specific set of observables are known. In dimension six, the required observables only exist if it is possible to identify six mutually unbiased complex 6x6 Hadamard matrices. Prescribing a first Hadamard matrix, we construct all others mutually unbiased to it, using algebraic computations performed by a computer program. We repeat this calculation many times, sampling all known complex Hadamard matrices, and we never find more than two that are mutually unbiased. This result adds considerable support to the conjecture that no seven mutually unbiased bases exist in dimension six.Comment: As published version. Added discussion of the impact of numerical approximations and corrected the number of triples existing for non-affine families (cf Table 3

    Exotic complex Hadamard matrices, and their equivalence

    Full text link
    In this paper we use a design theoretical approach to construct new, previously unknown complex Hadamard matrices. Our methods generalize and extend the earlier results of de la Harpe--Jones and Munemasa--Watatani and offer a theoretical explanation for the existence of some sporadic examples of complex Hadamard matrices in the existing literature. As it is increasingly difficult to distinguish inequivalent matrices from each other, we propose a new invariant, the fingerprint of complex Hadamard matrices. As a side result, we refute a conjecture of Koukouvinos et al. on (n-8)x(n-8) minors of real Hadamard matrices.Comment: 10 pages. To appear in Cryptography and Communications: Discrete Structures, Boolean Functions and Sequence

    Affine Constellations Without Mutually Unbiased Counterparts

    Full text link
    It has been conjectured that a complete set of mutually unbiased bases in a space of dimension d exists if and only if there is an affine plane of order d. We introduce affine constellations and compare their existence properties with those of mutually unbiased constellations, mostly in dimension six. The observed discrepancies make a deeper relation between the two existence problems unlikely.Comment: 8 page

    Certainty relations between local and nonlocal observables

    Full text link
    We demonstrate that for an arbitrary number of identical particles, each defined on a Hilbert-space of arbitrary dimension, there exists a whole ladder of relations of complementarity between local, and every conceivable kind of joint (or nonlocal) measurements. E.g., the more accurate we can know (by a measurement) some joint property of three qubits (projecting the state onto a tripartite entangled state), the less accurate some other property, local to the three qubits, become. We also show that the corresponding complementarity relations are particularly tight for particles defined on prime dimensional Hilbert spaces.Comment: 4 pages, no figure

    Quantum geometry and quantum algorithms

    Get PDF
    Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the colored Jones polynomial. The construction is based on the complete solution of Chern-Simons topological quantum field theory and its connection to Wess-Zumino-Witten conformal field theory. The colored Jones polynomial is expressed as the expectation value of the evolution of the q-deformed spin-network quantum automaton. A quantum circuit is constructed capable of simulating the automaton and hence of computing such expectation value. The latter is efficiently approximated using a standard sampling procedure in quantum computation.Comment: Submitted to J. Phys. A: Math-Gen, for the special issue ``The Quantum Universe'' in honor of G. C. Ghirard

    Multicomplementary operators via finite Fourier transform

    Full text link
    A complete set of d+1 mutually unbiased bases exists in a Hilbert spaces of dimension d, whenever d is a power of a prime. We discuss a simple construction of d+1 disjoint classes (each one having d-1 commuting operators) such that the corresponding eigenstates form sets of unbiased bases. Such a construction works properly for prime dimension. We investigate an alternative construction in which the real numbers that label the classes are replaced by a finite field having d elements. One of these classes is diagonal, and can be mapped to cyclic operators by means of the finite Fourier transform, which allows one to understand complementarity in a similar way as for the position-momentum pair in standard quantum mechanics. The relevant examples of two and three qubits and two qutrits are discussed in detail.Comment: 15 pages, no figure
    corecore