39 citations · 77 across the 10 of their papers we have counts for
11 papers
Complexity separations for optimal matchgate-Clifford synthesis
Berta Casas, Diego García-Martín, Yuxuan Zhang
Clifford and matchgate circuits are canonical families of classically simulable quantum circuits. Their intersection, the matchgate-Clifford group, plays an important role in rando…
Quantum Gaussian processes for prediction of channel observations
Jonas Jäger, Yaroslav Khmelnitskiy, Paolo Braccia +4
Given a set of input states, we consider the task of predicting the expectation value of a Pauli observable at the output of an unknown quantum evolution, using only a limited numb…
Exponentially many initializations to avoid barren plateaus
Ankit Kulshrestha, Ricard Puig, Diego García-Martín +4
Barren plateaus are stated as an average-case phenomenon: pick an ansatz, initialize it naively, and concentration follows. This has led to the common view that a potential cure fo…
Provable and scalable quantum Gaussian processes for quantum learning
Jonas Jäger, Paolo Braccia, Pablo Bermejo +3
Despite rapid recent advances in quantum machine learning, the field is in many ways stuck. Existing approaches can exhibit serious limitations, and we still lack learning framewor…
The commutant of fermionic Gaussian unitaries
Paolo Braccia, N. L. Diaz, Martin Larocca +2
In this work, we characterize the -th order commutants of fermionic Gaussian unitaries and of their particle-preserving subgroup acting on fermionic modes. These commutants…
Matchgate synthesis via Clifford matchgates and gates
Berta Casas, Paolo Braccia, Élie Gouzien +2
Matchgate unitaries are ubiquitous in quantum computation due to their relation to non-interacting fermions and because they can be used to benchmark quantum computers. Implementin…
Moments of Quantum Channel Ensembles
Matthew Duschenes, Diego García-Martín, Zoë Holmes +1
Moments of ensembles of unitaries play a central role in quantum information theory as they capture the statistical properties of dynamics of systems with some form of randomness.…
No-go theorems for sublinear-depth group designs
Maxwell West, Diego García-Martín, N. L. Diaz +2
Constructing ensembles of circuits which efficiently approximate the Haar measure over various groups is a long-standing and fundamental problem in quantum information theory. Rece…
Optimal Haar random fermionic linear optics circuits
Paolo Braccia, N. L. Diaz, Martin Larocca +2
Sampling unitary Fermionic Linear Optics (FLO), or matchgate circuits, has become a fundamental tool in quantum information. Such capability enables a large number of applications…
Algebraic Bethe Circuits
Alejandro Sopena, Max Hunter Gordon, Diego García-Martín +2
The Algebraic Bethe Ansatz (ABA) is a highly successful analytical method used to exactly solve several physical models in both statistical mechanics and condensed-matter physics.…
Five Experimental Tests on the 5-Qubit IBM Quantum Computer
Diego García-Martín, Germán Sierra
The 5-qubit quantum computer prototypes that IBM has given open access to on the cloud allow the implementation of real experiments on a quantum processor. We present the results o…