Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Routing Anonymity and Identifiability of Noisy Quantum Hardware
Ben Priestley, Mina Doosti
Present-day quantum computing is cloud-based, where a user submits a circuit to a service provider's proprietary backend hardware. While providers may wish to hide implementation d…
quant-ph2025
A Practically Scalable Approach to the Closest Vector Problem for Sieving via QAOA with Fixed Angles
Ben Priestley, Petros Wallden
The NP-hardness of the closest vector problem (CVP) is an important basis for quantum-secure cryptography, in much the same way that integer factorisation's conjectured hardness is…