Subset Sum Quantumly in 1.17 n .

DOI10.4230/LIPICS.TQC.2018.5MaRDI QIDQ5889072zbMATH OpenOpenAlexFDO

Authors Alexander Helm, Alexander May

Publication date 26 April 2023

Full work available at URL https://dblp.uni-trier.de/db/conf/tqc/tqc2018.html#HelmM18

zbMATH Keywords

quantum walksubset sumrepresentation technique

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Improved classical and quantum algorithms for subset-sum
• Quantum algorithms for the subset-sum problem
• The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
• scientific article; zbMATH DE number 5320343
• Quantum algorithms for shifted subset problems

Cites work

• scientific article; zbMATH DE number 4213909 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1346512 (Why is no real title available?)
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
• An Improved Low-Density Subset Sum Algorithm
• Chosen-ciphertext security from subset sum
• Computing Partitions with Applications to the Knapsack Problem
• Improved Generic Algorithms for Hard Knapsacks
• New generic algorithms for hard knapsacks
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• Quantum Walk Algorithm for Element Distinctness
• Quantum algorithms for the subset-sum problem
• Quantum walks on graphs
• Search via Quantum Walk
• Solving low density knapsacks
• Solving low-density subset sum problems

Cited in

(4)

• scientific article; zbMATH DE number 2051219 (Why is no real title available?)
• The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
• Efficient reductions and algorithms for subset product
• Time and Query Complexity Tradeoffs for the Dihedral Coset Problem

This page was built for publication: Subset Sum Quantumly in 1.17 n .

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