1.3k citations · 5.6k across the 37 of their papers we have counts for
5 papers · 2 filters
Sample complexity of device-independently certified "quantum supremacy"
Dominik Hangleiter, Martin Kliesch, Jens Eisert +1
Results on the hardness of approximate sampling are seen as important stepping stones towards a convincing demonstration of the superior computational power of quantum devices. The…
Evaluating analytic gradients on quantum hardware
Maria Schuld, Ville Bergholm, Christian Gogolin +2
An important application for near-term quantum computing lies in optimization tasks, with applications ranging from quantum chemistry and drug discovery to machine learning. In man…
PennyLane: Automatic differentiation of hybrid quantum-classical computations
Ville Bergholm, Josh Izaac, Maria Schuld +65
PennyLane is a Python 3 software framework for differentiable programming of quantum computers. The library provides a unified architecture for near-term quantum computing devices,…
Verifying the output of quantum optimizers with ground-state energy lower bounds
Flavio Baccari, Christian Gogolin, Peter Wittek +1
Solving optimisation problems encoded in the ground state of classical-spin systems is a focus area for quantum computing devices, providing upper bounds to the unknown solution. T…
Automated discovery of characteristic features of phase transitions in many-body localization
Patrick Huembeli, Alexandre Dauphin, Peter Wittek +1
We identify a new "order parameter" for the disorder driven many-body localization (MBL) transition by leveraging artificial intelligence. This allows us to pin down the transition…