Searching hidden linear structures with quantum computer

MaRDI QIDQ6901151zbMATH OpenFDO

Authors Maxim V. Polyakov, Marina A. Pudovkina

Publication date 12 November 2025

Published in Prikladnaya Diskretnaya Matematika. Supplement (Search for Journal in Brave)

zbMATH Keywords

hidden subgroup problemlinear structures of mappingsquantum algorithmsquantum cryptanalysisSimon's problem

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites work

• scientific article; zbMATH DE number 3952651 (Why is no real title available?)
• scientific article; zbMATH DE number 4079313 (Why is no real title available?)
• scientific article; zbMATH DE number 1030974 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups

This page was built for publication: Searching hidden linear structures with quantum computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6901151)