Jérémie Roland
Jérémie Roland
QuIC - ULB - Ecole polytechnique de Bruxelles
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Quantum search by local adiabatic evolution
J Roland, NJ Cerf
Physical Review A 65 (4), 042308, 2002
Search via quantum walk
F Magniez, A Nayak, J Roland, M Santha
SIAM journal on computing 40 (1), 142-164, 2011
Anderson localization makes adiabatic quantum optimization fail
B Altshuler, H Krovi, J Roland
Proceedings of the National Academy of Sciences 107 (28), 12446-12450, 2010
Noise resistance of adiabatic quantum computation using random matrix theory
J Roland, NJ Cerf
Physical Review A 71 (3), 032330, 2005
Lower bounds on information complexity via zero-communication protocols and applications
I Kerenidis, S Laplante, V Lerays, J Roland, D Xiao
SIAM Journal on Computing 44 (5), 1550-1572, 2015
Quantum rejection sampling
M Ozols, M Roetteler, J Roland
ACM Transactions on Computation Theory (TOCT) 5 (3), 1-33, 2013
Quantum walks can find a marked element on any graph
H Krovi, F Magniez, M Ozols, J Roland
Algorithmica 74 (2), 851-907, 2016
Quantum entanglement enhances the capacity of bosonic channels with memory
NJ Cerf, J Clavareau, C Macchiavello, J Roland
Physical Review A 72 (4), 042330, 2005
Simulating quantum correlations as a distributed sampling problem
J Degorre, S Laplante, J Roland
Physical Review A 72 (6), 062314, 2005
Bell inequalities resistant to detector inefficiency
S Massar, S Pironio, J Roland, B Gisin
Physical Review A 66 (5), 052112, 2002
Solving the resonating-group equation on a Lagrange mesh
M Hesse, J Roland, D Baye
Nuclear Physics A 709 (1-4), 184-200, 2002
Symmetry-assisted adversaries for quantum state generation
A Ambainis, L Magnin, M Roetteler, J Roland
2011 IEEE 26th Annual Conference on Computational Complexity, 167-177, 2011
Quantum-circuit model of Hamiltonian search algorithms
J Roland, NJ Cerf
Physical Review A 68 (6), 062311, 2003
The communication complexity of non-signaling distributions
J Degorre, M Kaplan, S Laplante, J Roland
Mathematical Foundations of Computer Science 2009: 34th International …, 2009
Finding is as easy as detecting for quantum walks
H Krovi, F Magniez, M Ozols, J Roland
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
Optimality of spatial search via continuous-time quantum walks
S Chakraborty, L Novo, J Roland
Physical Review A 102 (3), 032214, 2020
Adiabatic quantum search algorithm for structured problems
J Roland, NJ Cerf
Physical Review A 68 (6), 062312, 2003
Quadratic speedup for spatial search by continuous-time quantum walk
S Apers, S Chakraborty, L Novo, J Roland
Physical review letters 129 (16), 160502, 2022
Adiabatic condition and the quantum hitting time of Markov chains
H Krovi, M Ozols, J Roland
Physical Review A 82 (2), 022333, 2010
A strong direct product theorem for quantum query complexity
T Lee, J Roland
computational complexity 22, 429-462, 2013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20