Hidden translation and orbit coset in quantum computing
From MaRDI portal
Publication:3581285
DOI10.1145/780542.780544zbMath1192.81066OpenAlexW2035742807MaRDI QIDQ3581285
Frédéric Magniez, Gábor Ivanyos, Miklos Santha, Katalin Friedl, Pranab Sen
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780544
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm ⋮ Quantum algorithms for variants of average-case lattice problems via filtering ⋮ Sample complexity of hidden subgroup problem ⋮ On the Complexity of the Hidden Subgroup Problem ⋮ Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem ⋮ Quantum property testing of group solvability ⋮ Two remarks on the vectorization problem ⋮ An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ Solving systems of diagonal polynomial equations over finite fields ⋮ New Algorithms for Learning in Presence of Errors ⋮ Quantum pattern matching fast on average ⋮ Adversary lower bounds for nonadaptive quantum algorithms ⋮ Complexity classes of equivalence problems revisited ⋮ Deterministic algorithms for the hidden subgroup problem ⋮ New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
This page was built for publication: Hidden translation and orbit coset in quantum computing
