68 citations · 257 across the 18 of their papers we have counts for
5 papers · 1 filter
Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard
Massimiliano Incudini, Casper Gyurik, Riccardo Molteni +1
Determining whether an abstract simplicial complex, a discrete object often approximating a manifold, contains multi-dimensional holes is a task deeply connected to quantum mechani…
Provable quantum speedups for computing persistence in topological data analysis
Casper Gyurik, Alexander Schmidhuber, Robbie King +2
Topological data analysis (TDA) aims to extract noise-robust features from a data set by examining the number and persistence of holes in its topology. We provide an efficient quan…
On the relation between trainability and dequantization of variational quantum learning models
Elies Gil-Fuster, Casper Gyurik, Adrián Pérez-Salinas +1
The quest for successful variational quantum machine learning (QML) relies on the design of suitable parametrized quantum circuits (PQCs), as analogues to neural networks in classi…
On Bounded Advice Classes
Simon Marshall, Casper Gyurik, Vedran Dunjko
Advice classes in computational complexity have frequently been used to model real-world scenarios encountered in cryptography, quantum computing and machine learning, where some c…
Exponential quantum advantages in learning quantum observables from classical data
Riccardo Molteni, Casper Gyurik, Vedran Dunjko
Quantum computers are believed to bring computational advantages in simulating quantum many body systems. However, recent works have shown that classical machine learning algorithm…