9 citations · 22 across the 13 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
quant-ph2023
(Quantum) complexity of testing signed graph clusterability
Kuo-Chin Chen, Simon Apers, Min-Hsiu Hsieh
This study examines clusterability testing for a signed graph in the bounded-degree model. Our contributions are two-fold. First, we provide a quantum algorithm with query complexi…
quant-ph2023
Quantum speedups for linear programming via interior point methods
Simon Apers, Sander Gribling
We describe a quantum algorithm based on an interior point method for solving a linear program with inequality constraints on variables. The algorithm explicitly returns a…