Pages that link to "Item:Q4928586"
From MaRDI portal
The following pages link to Quantum Algorithms for the Subset-Sum Problem (Q4928586):
Displayed 18 items.
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- Quantum key search for ternary LWE (Q2118530) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- Naor-Yung Paradigm with Shared Randomness and Applications (Q2827710) (← links)
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
- (Q5092465) (← links)
- Subset Sum Quantumly in 1.17 n . (Q5889072) (← links)
- Lattice Sieving via Quantum Random Walks (Q6045073) (← links)
- Finding many collisions via reusable quantum walks. Application to lattice sieving (Q6083662) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)
- Efficient reductions and algorithms for subset product (Q6132518) (← links)
- Quantum time/memory/data tradeoff attacks (Q6146595) (← links)
- Quantum complexity for vector domination problem (Q6169538) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)