Corpus ID: 1218552

Single query learning from abelian and non-abelian Hamming distance oracles

  title={Single query learning from abelian and non-abelian Hamming distance oracles},
  author={D. Meyer and J. Pommersheim},
  journal={Chic. J. Theor. Comput. Sci.},
  • D. Meyer, J. Pommersheim
  • Published 2010
  • Mathematics, Physics, Computer Science
  • Chic. J. Theor. Comput. Sci.
  • We study the problem of identifying an n-bit string using a single quantum query to an oracle that computes the Hamming distance between the query and hidden strings. The standard action of the oracle on a response register of dimension r is by powers of the cycle (1...r), all of which, of course, commute. We introduce a new model for the action of an oracle--by general permutations in S_r--and explore how the success probability depends on r and on the map from Hamming distances to… CONTINUE READING
    7 Citations
    Single-query quantum algorithms for symmetric problems
    • 2
    On the uselessness of quantum queries
    • 11
    • PDF
    Uselessness for an Oracle model with internal randomness
    • 9
    • Highly Influenced
    • PDF
    Blind Oracular Quantum Computation
    • PDF
    Quantum Computation and Isomorphism Testing
    • 2
    A quantum algorithm for Viterbi decoding of classical convolutional codes
    • 1
    • PDF


    Quantum Algorithms for Highly Structured Search Problems
    • 10
    The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
    • 23
    • PDF
    Quantum Complexity Theory
    • 835
    Quantum complexity theory
    • 734
    • PDF
    A fast quantum mechanical algorithm for database search
    • 4,741
    • PDF
    Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle
    • 56
    • PDF
    Quantum Mechanics Helps in Searching for a Needle in a Haystack
    • 2,972
    • PDF
    Algorithms for quantum computation: discrete logarithms and factoring
    • P. Shor
    • Mathematics, Computer Science
    • Proceedings 35th Annual Symposium on Foundations of Computer Science
    • 1994
    • 4,847
    • PDF
    A quantum decoding algorithm of the simplex code
    • 6
    • PDF
    Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
    • P. Shor
    • Computer Science, Mathematics
    • 1999
    • 325