Zero sum subsequences and hidden subgroups
From MaRDI portal
Publication:6182403
DOI10.1007/s11128-023-04228-2arXiv2304.08376MaRDI QIDQ6182403
No author found.
Publication date: 25 January 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.08376
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving systems of diagonal polynomial equations over finite fields
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Hidden shift quantum cryptanalysis and implications
- The hidden subgroup problem and post-quantum group-based cryptography
- Optimal separation in exact query complexities for Simon's problem
- Uniformity of quantum circuit families for error-free algorithms
- Tight bounds for Simon's algorithm
- The quantum query complexity of the hidden subgroup problem is polynomial
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
- Is Grover's algorithm a quantum hidden subgroup algorithm?
- A combinatorial problem on finite Abelian groups. I
- Quantum and classical query complexities for generalized Simon's problem
- Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem
- Quantum Computation and Quantum Information
- Quantum Complexity Theory
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- Quantum algorithms for solvable groups
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- Hidden Translation and Translating Coset in Quantum Computing
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Two remarks on the vectorization problem
This page was built for publication: Zero sum subsequences and hidden subgroups
