Simon Apers

According to our database, Simon Apers authored at least 26 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Quantum walks, the discrete wave equation and Chebyshev polynomials.

Simon Apers, Laurent Miclo

CoRR, 2024

Holey graphs: very large Betti numbers are testable.

Dániel Szabó, Simon Apers

CoRR, 2024

2023

A (simple) classical algorithm for estimating Betti numbers.

Simon Apers, Sander Gribling, Sayantan Sen, Dániel Szabó

Quantum, December, 2023

(Quantum) complexity of testing signed graph clusterability.

Kuo-Chin Chen, Simon Apers, Min-Hsiu Hsieh

CoRR, 2023

Quantum speedups for linear programming via interior point methods.

Simon Apers, Sander Gribling

CoRR, 2023

Testing Cluster Properties of Signed Graphs.

Florian Adriaens, Simon Apers

Proceedings of the ACM Web Conference 2023, 2023

(No) Quantum Space-Time Tradeoff for USTCON.

Simon Apers, Stacey Jeffery, Galina Pass, Michael Walter

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving.

Simon Apers, Ronald de Wolf

SIAM J. Comput., 2022

Quantum XYZ Product Codes.

Anthony Leverrier, Simon Apers, Christophe Vuillot

Quantum, 2022

Elfs, trees and quantum walks.

Simon Apers, Stephen Piddock

CoRR, 2022

A (simple) classical algorithm for estimating Betti numbers.

Simon Apers, Sayantan Sen, Dániel Szabó

CoRR, 2022

Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps.

Simon Apers, Sander Gribling, Dániel Szilágyi

CoRR, 2022

Cut Query Algorithms with Star Contraction.

Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Finding the KT Partition of a Weighted Graph in Near-Linear Time.

Simon Apers, Pawel Gawrychowski, Troy Lee

Proceedings of the Approximation, 2022

2021

Quadratic speedup for spatial search by continuous-time quantum walk.

Simon Apers, Shantanav Chakraborty, Leonardo Novo, Jérémie Roland

CoRR, 2021

A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs.

Simon Apers, Arinta Auza, Troy Lee

CoRR, 2021

Testing properties of signed graphs.

Florian Adriaens, Simon Apers

CoRR, 2021

A Unified Framework of Quantum Walk Search.

Simon Apers, András Gilyén, Stacey Jeffery

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Quantum Complexity of Minimum Cut.

Simon Apers, Troy Lee

Proceedings of the 36th Computational Complexity Conference, 2021

2020

Expansion Testing using Quantum Fast-Forwarding and Seed Sets.

Simon Apers

Quantum, 2020

Quantum query complexity of edge connectivity.

Simon Apers, Troy Lee

CoRR, 2020

2019

Quantum fast-forwarding: Markov chains and graph property testing.

Simon Apers, Alain Sarlette

Quantum Inf. Comput., 2019

Quantum Walk Sampling by Growing Seed Sets.

Simon Apers

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2017

Accelerating Consensus by Spectral Clustering and Polynomial Filters.

Simon Apers, Alain Sarlette

IEEE Trans. Control. Netw. Syst., 2017

Bounding the Convergence Time of Local Probabilistic Evolution.

Simon Apers, Alain Sarlette, Francesco Ticozzi

Proceedings of the Geometric Science of Information - Third International Conference, 2017

When does memory speed-up mixing?

Simon Apers, Alain Sarlette, Francesco Ticozzi

Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017