General quantum meet-in-the-middle search algorithm based on target solution of fixed weight

DOI10.1088/0253-6102/66/4/401MaRDI QIDQ4596743zbMATHOpenAlexFDO

Authors Xiang Wang, Xiang-Qun Fu, Wan-Su Bao, Jianhong Shi

Publication date 8 December 2017

Published in Communications in Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/0253-6102/66/4/401

zbMATH Keywords

knapsack problemmeet-in-the-middlequantum search algorithmpublic-key crypto

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Quantum binary search algorithm
• Quantum algorithm to find invariant linear structure of \(MD\) hash functions
• Grover quantum searching algorithm based on weighted targets
• Quantum partial search algorithm with smaller oracles for multiple target items
• Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms

This page was built for publication: General quantum meet-in-the-middle search algorithm based on target solution of fixed weight

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