scientific article

zbMath1302.68121arXivquant-ph/0507190MaRDI QIDQ2934718

Wim van Dam, Andrew M. Childs

Publication date: 18 December 2014

Full work available at URL: https://arxiv.org/abs/quant-ph/0507190

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (9)

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 ⋮ Full quantum equivalence of group action DLog and CDH, and more ⋮ Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem ⋮ Quantum pattern matching fast on average ⋮ Query complexity of generalized Simon's problem ⋮ Leveraging the hardness of dihedral coset problem for quantum cryptography ⋮ Deterministic algorithms for the hidden subgroup problem

This page was built for publication: