Pages that link to "Item:Q3581285"
From MaRDI portal
The following pages link to Hidden translation and orbit coset in quantum computing (Q3581285):
Displaying 17 items.
- Solving systems of diagonal polynomial equations over finite fields (Q507442) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- Quantum property testing of group solvability (Q627520) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups (Q1865128) (← links)
- Deterministic algorithms for the hidden subgroup problem (Q2105456) (← links)
- Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups (Q2428678) (← links)
- Sample complexity of hidden subgroup problem (Q2672576) (← links)
- Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem (Q2685660) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm (Q3182964) (← links)
- On the Complexity of the Hidden Subgroup Problem (Q3502634) (← links)
- Quantum Algorithms for a Set of Group Theoretic Problems (Q5261611) (← links)
- Two remarks on the vectorization problem (Q6169495) (← links)
- Post-quantum \(\kappa\)-to-1 trapdoor claw-free functions from extrapolated dihedral cosets (Q6550807) (← links)
