Quantum partial search algorithm with smaller oracles for multiple target items
From MaRDI portal
Publication:2107919
DOI10.1007/S11128-022-03496-8OpenAlexW4224939133MaRDI QIDQ2107919FDOQ2107919
Dan Li, L. Qian, Yuqian Zhou, Yu-Guang Yang
Publication date: 5 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-022-03496-8
Recommendations
Cites Work
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Simple algorithm for partial quantum search
- Quantum partial search of a database with several target items
- Discrete-time quantum walk search on Johnson graphs
- Implementing Grover oracles for quantum key search on AES and LowMC
- 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
- Quantum partial search for uneven distribution of multiple target items
- Novel methods to construct nonlocal sets of orthogonal product states in an arbitrary bipartite high-dimensional system
- Szegedy quantum walks with memory on regular graphs
- On the hardness of the NTRU problem
Cited In (1)
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)
