Simon Apers

(photo courtesy CWI)

smgapers at gmaildotcom

CNRS researcher at IRIF (Université de Paris)

focus on quantum algorithms. broader interest in theoretical computer science (random walks, graph theory, combinatorial optimization)

editor for the journal Quantum. PC member for SODA'23, ESA '21

work: google scholar

• S. Apers, Y. Efron, P. Gawrychowski, T. Lee, S. Mukhopadhyay, D. Nanongkai.
  "Cut query algorithms with star contraction."
  preprint. arXiv:2201.05674


• S. Apers, S. Chakraborty, L. Novo, J. Roland.
  "Quadratic speedup for spatial search by continuous-time quantum walk."
  preprint. arXiv:2112.12746
  accepted for TQC '22


• S. Apers, P. Gawrychowski and T. Lee.
  "Finding the KT partition of a weighted graph in near-linear time."
  preprint. arXiv:2111.01378


• S. Apers, A. Auza and T. Lee.
  "A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs."
  preprint. arXiv:2110.15587


• F. Adriaens and S. Apers.
  "Testing properties of signed graphs."
  preprint. arXiv:2102.07587


• A. Leverrier, S. Apers and C. Vuillot.
  "Quantum XYZ product codes."
  preprint. arXiv:2011.09746


• S. Apers and T. Lee.
  "Quantum complexity of minimum cut."
  in Computational Complexity Conference (CCC '21) arXiv:2011.09823, video
  accepted for QIP '21, merged with arXiv:1911.07306


• S. Apers, A. Gilyén and S. Jeffery.
  "A Unified Framework of Quantum Walk Search."
  in 38th Symposium on Theoretical Aspects of Computer Science (STACS '21) arXiv:1912.04233, video


• S. Apers and R. de Wolf.
  "Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving."
  in 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20) arXiv:1911.07306, slides, video
  accepted for QIP '21, merged with arXiv:2011.09823


• S. Apers.
  "Expansion Testing using Quantum Fast-Forwarding and Seed Sets."
  in Quantum, 4 (323), 2020. arXiv:1907.02369, slides


• S. Apers.
  "Quantum Walk Sampling by Growing Seed Sets."
  in 27th Annual European Symposium on Algorithms (ESA '19). arXiv:1904.11446, slides


• S. Apers and A. Sarlette.
  "Quantum Fast-Forwarding: Markov Chains and Graph Property Testing."
  in Quantum Information and Computation, 19(3&4):191-213, 2019. arXiv:1804.02321


• S. Apers, A. Sarlette and F. Ticozzi.
  "Simulation of Quantum Walks and Fast Mixing with Classical Processes."
  in Physical Review A, 98(3), 2018. arXiv:1712.01609


• W.W. Zhang, B.C. Sanders, S. Apers, S.K. Goyal and D.L. Feder.
  "Detecting Topological Transitions in Two Dimensions by Hamiltonian Evolution."
  in Physical Review Letters, 119(19), 2017. arXiv:1707.01839


• S. Apers, F. Ticozzi and A. Sarlette.
  "Characterizing limits and opportunities in speeding up Markov chain mixing."
  in Stochastic Processes and their Applications, 136:145-191, 2021. arXiv:1705.08253


• S. Apers, A. Sarlette and F. Ticozzi.
  "Bounding the Convergence Time of Local Probabilistic Evolution."
  in 3rd International Conference on Geometric Science of Information (GSI '17). arXiv:1711.06024, slides, video


• S. Apers and A. Sarlette.
  "Accelerating Consensus by Spectral Clustering and Polynomial Filters."
  in IEEE Transactions on Control of Network Systems, 4(3), 2016. arXiv:1503.01269


• S. Apers. "Quantum Walks: Speed Limits on Mixing and Fast-Forwarding Classical Walks."
  Ghent University, 2019. supervisor: Alain Sarlette. pdf, slides. PhD thesis.