1 citations · 1 across the 7 of their papers we have counts for
8 papers
Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms
Francisco Escudero Gutiérrez, Miquel Saucedo, Carlos Palazuelos
We consider the problem of establishing limitations on the power of quantum query algorithms via the completely bounded polynomial method. In particular, we prove several optimal f…
Certifying and learning local quantum Hamiltonians
Andreas Bluhm, Matthias C. Caro, Francisco Escudero Gutiérrez +4
In this work, we study the problems of certifying and learning quantum -local Hamiltonians, for a constant . Our main contributions are as follows: - Certification of Hamilto…
Certifying and learning quantum Ising Hamiltonians
Andreas Bluhm, Matthias C. Caro, Francisco Escudero Gutiérrez +2
In this work, we study the problems of certifying and learning quantum Ising Hamiltonians. Our main contributions are as follows: Certification of Ising Hamiltonians. We show that…
Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
Amira Abbas, Nunzia Cerrato, Francisco Escudero Gutiérrez +3
We study the problem of learning Hamiltonians that are -sparse in the Pauli basis, given access to their time evolution. Although Hamiltonian learning has been extensively i…
Learning low-degree quantum objects
Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez +1
We consider the problem of learning low-degree quantum objects up to -error in -distance. We show the following results: unknown -qubit degree- (in…
All notions of quantum expansion are equivalent
Francisco Escudero Gutiérrez, Garazi Muguruza
In a recent work Li, Qiao, Wigderson, Wigderson and Zhang introduced notions of quantum expansion based on norms and posed as an open question if they were all equivalent. We…