Quantum partial search algorithm with smaller oracles for multiple target items
From MaRDI portal
Publication:2107919
Recommendations
Cites work
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Discrete-time quantum walk search on Johnson graphs
- Implementing Grover oracles for quantum key search on AES and LowMC
- Novel methods to construct nonlocal sets of orthogonal product states in an arbitrary bipartite high-dimensional system
- On the hardness of the NTRU problem
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum partial search for uneven distribution of multiple target items
- Quantum partial search of a database with several target items
- Simple algorithm for partial quantum search
- Szegedy quantum walks with memory on regular graphs
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
Cited in
(2)
This page was built for publication: Quantum partial search algorithm with smaller oracles for multiple target items
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107919)