2 citations · 2 across the 4 of their papers we have counts for
4 papers
Alternative adiabatic quantum dynamics with algorithmic applications
Joseph Cunningham, Jérémie Roland
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolut…
Elfs, transducers and quantum walks
Simon Apers, Jérémie Roland, Yuxin Zhang
Electric flow sampling (elfs) is a new tool in the quantum walk toolbox and a useful primitive for solving search, sampling and optimization problems on graphs. We refine this tool…
Protocols for Quantum Weak Coin Flipping
Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou +1
Weak coin flipping is an important cryptographic primitive$\unicode{x2013}$it is the strongest known secure two-party computation primitive that classically becomes secure only und…
Non-Local Box Complexity and Secure Function Evaluation
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante +1
A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distributed and th…