Follow
Simon Apers
Simon Apers
CNRS, IRIF, Université Paris-Cité
Verified email at irif.fr - Homepage
Title
Cited by
Cited by
Year
A unified framework of quantum walk search
S Apers, A Gilyén, S Jeffery
arXiv preprint arXiv:1912.04233, 2019
432019
Quantum fast-forwarding: Markov chains and graph property testing
S Apers, A Sarlette
Quantum Information & Computation 19 (3 & 4), 181-213, 2019
38*2019
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
332022
Quantum speedup for graph sparsification, cut approximation and Laplacian solving
S Apers, R de Wolf
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
312020
Accelerating consensus by spectral clustering and polynomial filters
S Apers, A Sarlette
IEEE Transactions on Control of Network Systems 4 (3), 544-554, 2016
252016
Simulation of quantum walks and fast mixing with classical processes
S Apers, A Sarlette, F Ticozzi
Physical Review A 98 (3), 032115, 2018
192018
Characterizing limits and opportunities in speeding up Markov chain mixing
S Apers, A Sarlette, F Ticozzi
Stochastic Processes and their Applications 136, 145-191, 2021
15*2021
A (simple) classical algorithm for estimating Betti numbers
S Apers, S Gribling, S Sen, D Szabó
Quantum 7, 1202, 2023
122023
Cut query algorithms with star contraction
S Apers, Y Efron, P Gawrychowski, T Lee, S Mukhopadhyay, ...
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
102022
Detecting topological transitions in two dimensions by Hamiltonian evolution
WW Zhang, BC Sanders, S Apers, SK Goyal, DL Feder
Physical Review Letters 119 (19), 197401, 2017
102017
Quantum XYZ product codes
A Leverrier, S Apers, C Vuillot
Quantum 6, 766, 2022
82022
Quantum complexity of minimum cut
S Apers, T Lee
arXiv preprint arXiv:2011.09823, 2020
8*2020
Quantum Walk Sampling by Growing Seed Sets
S Apers
27th Annual European Symposium on Algorithms (ESA 2019) 144, 9:1-9:12, 2019
52019
Quantum speedups for linear programming via interior point methods
S Apers, S Gribling
arXiv preprint arXiv:2311.03215, 2023
42023
Expansion Testing using Quantum Fast-Forwarding and Seed Sets
S Apers
Quantum 4, 323, 2020
42020
Fast Mixing with Quantum Walks vs. Classical Processes
S Apers, A Sarlette, F Ticozzi
42017
Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps
S Apers, S Gribling, D Szilágyi
arXiv preprint arXiv:2209.12771, 2022
32022
When does memory speed-up mixing?
S Apers, A Sarlette, F Ticozzi
2017 IEEE 56th Annual Conference on Decision and Control (CDC), 4940-4945, 2017
32017
Testing Cluster Properties of Signed Graphs
F Adriaens, S Apers
Proceedings of the ACM Web Conference 2023, 49-59, 2023
2*2023
Elfs, trees and quantum walks
S Apers, S Piddock
arXiv preprint arXiv:2211.16379, 2022
22022
The system can't perform the operation now. Try again later.
Articles 1–20