BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:592dda95d35dab90637a3c550470aa00
DTSTAMP:20240620T023317Z
SUMMARY:Quantum Ising algorithm for the shortest vector problem in lattice-
based encryption
DESCRIPTION:Quantum computers are expected to break today’s public key cr
yptography within a few decades. New cryptosystems are being designed and
standardised for the post-quantum era\, and a significant proportion of th
ese rely on the hardness of problems like the Shortest Vector Problem to a
quantum adversary. We describe two variants of a quantum Ising algorithm
to solve this problem. One variant is spatially efficient\, requiring only
O(N log N) qubits where N is the lattice dimension\, while the other vari
ant is more robust to noise. Analysis of the algorithms’ performance on
a quantum annealer and in numerical simulations show that the more qubit-
efficient variant will outperform in the long run\, while the other varian
t is more suitable for near-term implementation.\nThis work was done in co
llaboration with David Joseph\, Adam Callison and Florian Mintert\, using
D-Wave Systems quantum computing resources.\nSpeaker short biography\nDr C
ong Ling is currently a Reader in the Electrical and Electronic Engineerin
g Department at Imperial College London. He leads the QUAIL (Quantum Artif
icial Intelligence Lab) at Imperial-X\, White City Campus.\n For further
information please see Dr Ling’s homepage.
URL:https://www.imperial.ac.uk/events/142025/quantum-ising-algorithm-for-th
e-shortest-vector-problem-in-lattice-based-encryption/
DTSTART;TZID=Europe/London:20211201T120000
DTEND;TZID=Europe/London:20211201T130000
LOCATION:United Kingdom
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:STANDARD
DTSTART:20211201T120000
TZNAME:GMT
TZOFFSETTO:+0000
TZOFFSETFROM:+0000
END:STANDARD
END:VTIMEZONE
END:VCALENDAR