15 citations · 24 across the 4 of their papers we have counts for
4 papers
Heuristic Time Complexity of NISQ Shortest-Vector-Problem Solvers
Miloš Prokop, Petros Wallden
Shortest Vector Problem is believed to be hard both for classical and quantum computers. Two of the three NIST post-quantum cryptosystems standardised by NIST rely on its hardness.…
Grover's oracle for the Shortest Vector Problem and its application in hybrid classical-quantum solvers
Milos Prokop, Petros Wallden, David Joseph
Finding the shortest vector in a lattice is a problem that is believed to be hard both for classical and quantum computers. Many major post-quantum secure cryptosystems base their…
Adiabatic quantum computing with parameterized quantum circuits
Ioannis Kolotouros, Ioannis Petrongonas, Miloš Prokop +1
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fa…
Variational quantum solutions to the Shortest Vector Problem
Martin R. Albrecht, Miloš Prokop, Yixin Shen +1
A fundamental computational problem is to find a shortest non-zero vector in Euclidean lattices, a problem known as the Shortest Vector Problem (SVP). This problem is believed to b…