Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
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.…
quant-ph2024
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…