25 citations · 27 across the 8 of their papers we have counts for
3 papers · 1 filter
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming
Jonathan Allcock, Yassine Hamoudi, Antoine Joux +2
Subset-Sum is an NP-complete problem where one must decide if a multiset of integers contains a subset whose elements sum to a target value . The best-known classical and qu…
Discrete logarithm and Diffie-Hellman problems in identity black-box groups
Gabor Ivanyos, Antoine Joux, Miklos Santha
We investigate the computational complexity of the discrete logarithm, the computational Diffie-Hellman and the decisional Diffie-Hellman problems in some identity black-box groups…
Optimal quantum-programmable projective measurement with linear optics
Ulysse Chabaud, Eleni Diamanti, Damian Markham +2
We present a scheme for a universal device which can be programmed by quantum states to approximate a chosen projective measurement to a given precision. Our scheme can be viewed a…