Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem

DOI10.1007/s11128-021-03290-yOpenAlexW3207095836MaRDI QIDQ2685660

Eunok Bae, Soojoon Lee

Publication date: 22 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.06225

zbMATH Keywords

quantum algorithm\(\varepsilon\)-random linear disequationscontinuous hidden shift problem

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Zero sum subsequences and hidden subgroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hidden shift quantum cryptanalysis and implications
• The quantum query complexity of the hidden subgroup problem is polynomial
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Quantum Algorithm for the Boolean Hidden Shift Problem
• Quantum Algorithms for Some Hidden Shift Problems
• Hidden translation and orbit coset in quantum computing
• Fast quantum algorithms for computing the unit group and class group of a number field
• Polynomial time quantum algorithm for the computation of the unit group of a number field
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Quantum Computation and Lattice Problems
• A quantum algorithm for computing the unit group of an arbitrary degree number field
• Hidden Symmetry Subgroup Problems
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
• On quantum algorithms for noncommutative hidden subgroups

This page was built for publication: Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem