Grover's Oracle for the Shortest Vector Problem and Its Application in Hybrid Classical–Quantum Solvers

Grover's Oracle for the Shortest Vector Problem and Its Application in Hybrid Classical–Quantum Solvers

Finding the shortest vector in a lattice is a problem that is believed to be hard both for classical and quantum computers. Many major postquantum secure cryptosystems base their security on the hardness of the shortest vector problem (SVP) (Moody, 2023). Finding the best classical, quantum, or hybr...

Full description

Bibliographic Details
Main Authors: Milos Prokop, Petros Wallden, David Joseph
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Transactions on Quantum Engineering
Subjects:
Grover's search
postquantum cryptography (PQC)
quantum algorithm
quantum circuit
shortest vector problem (SVP)
Online Access:https://ieeexplore.ieee.org/document/10756628/

Internet

https://ieeexplore.ieee.org/document/10756628/

Similar Items