202 citations · 225 across the 4 of their papers we have counts for
8 papers · 1 filter
Efficient re-sampling in quasi-probability decompositions
Sara Santos, Stefan Woerner, Vincenzo Savona +1
Near-term quantum devices are limited by noise and hardware constraints, motivating algorithmic approaches that trade circuit complexity for increased sampling overhead. Quasi-prob…
Quantum computing with Qiskit
Ali Javadi-Abhari, Matthew Treinish, Kevin Krsulich +9
We describe Qiskit, a software development kit for quantum information science. We discuss the key design decisions that have shaped its development, and examine the software archi…
Scalable Quantum Algorithms for Noisy Quantum Computers
Julien Gacon
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due…
Challenges and Opportunities in Quantum Optimization
Amira Abbas, Andris Ambainis, Brandon Augustino +43
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum a…
Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information
Julien Gacon, Christa Zoufal, Giuseppe Carleo +1
The Quantum Fisher Information matrix (QFIM) is a central metric in promising algorithms, such as Quantum Natural Gradient Descent and Variational Quantum Imaginary Time Evolution.…
Efficient calculation of gradients in classical simulations of variational quantum algorithms
Tyson Jones, Julien Gacon
Calculating the energy gradient in parameter space has become an almost ubiquitous subroutine of variational near-term quantum algorithms. "Faithful" classical emulation of this su…