462 citations · 1.4k across the 56 of their papers we have counts for
12 papers · 2 filters
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…
Variational Quantum Generative Modeling by Sampling Expectation Values of Tunable Observables
Kevin Shen, Andrii Kurkin, Adrián Pérez-Salinas +3
Expectation Value Samplers (EVSs) are quantum generative models that can learn high-dimensional continuous distributions by measuring the expectation values of parameterized quantu…
Error and Resource Estimates of Variational Quantum Algorithms for Solving Differential Equations Based on Runge-Kutta Methods
David Dechant, Liubov Markovich, Vedran Dunjko +1
A focus of recent research in quantum computing has been on developing quantum algorithms for differential equations solving using variational methods on near-term quantum devices.…
Universal approximation of continuous functions with minimal quantum circuits
Adrián Pérez-Salinas, Mahtab Yaghubi Rad, Alice Barthe +1
The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for cla…
Multiple-basis representation of quantum states
Adrián Pérez-Salinas, Patrick Emonts, Jordi Tura +1
Classical simulation of quantum physics is a central approach to investigating physical phenomena. Quantum computers enhance computational capabilities beyond those of classical re…
Improved separation between quantum and classical computers for sampling and functional tasks
Simon C. Marshall, Scott Aaronson, Vedran Dunjko
This paper furthers existing evidence that quantum computers are capable of computations beyond classical computers. Specifically, we strengthen the collapse of the polynomial hier…