Subset Sum Quantumly in 1.17 n .

DOI10.4230/LIPICS.TQC.2018.5OpenAlexW2886122829MaRDI QIDQ5889072FDOQ5889072

Alexander May, Alexander Helm

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)

Cites Work

• Search via Quantum Walk
• Title not available (Why is that?)
• Quantum walks on graphs
• Quantum Walk Algorithm for Element Distinctness
• Computing Partitions with Applications to the Knapsack Problem
• Improved Generic Algorithms for Hard Knapsacks
• Solving low-density subset sum problems
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• Solving Low Density Knapsacks
• Title not available (Why is that?)
• An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
• New generic algorithms for hard knapsacks
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• An Improved Low-Density Subset Sum Algorithm
• Quantum Algorithms for the Subset-Sum Problem
• Title not available (Why is that?)
• Chosen-Ciphertext Security from Subset Sum

Cited In (4)

• Title not available (Why is that?)
• 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)