Quantum algorithm for the Boolean hidden shift problem

@inproceedings{Gavinsky2011QuantumAF,
  title={Quantum algorithm for the Boolean hidden shift problem},
  author={Dmitry Gavinsky and Martin Roetteler and J{\'e}r{\'e}mie Roland},
  booktitle={COCOON},
  year={2011}
}
  • Dmitry Gavinsky, Martin Roetteler, Jérémie Roland
  • Published in COCOON 2011
  • Computer Science, Physics
  • The hidden shift problem is a natural place to look for new separations between classical and quantum models of computation. One advantage of this problem is its flexibility, since it can be defined for a whole range of functions and a whole range of underlying groups. In a way, this distinguishes it from the hidden subgroup problem where more stringent requirements about the existence of a periodic subgroup have to be made. And yet, the hidden shift problem proves to be rich enough to capture… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 15 CITATIONS

    Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound

    • Aleksandrs Belovs
    • Computer Science, Mathematics
    • Computational Complexity Conference
    • 2014

    Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound

    • Aleksandrs Belovs
    • Computer Science, Physics, Mathematics
    • 2014 IEEE 29th Conference on Computational Complexity (CCC)
    • 2014
    VIEW 1 EXCERPT
    CITES BACKGROUND

    Quantum advantage with shallow circuits

    VIEW 1 EXCERPT
    CITES BACKGROUND

    The non-injective hidden shift problem

    VIEW 10 EXCERPTS
    CITES METHODS, BACKGROUND & RESULTS
    HIGHLY INFLUENCED

    The non-injective hidden shift problem by Mirmojtaba Gharibi

    VIEW 13 EXCERPTS
    CITES METHODS, BACKGROUND & RESULTS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES