Francisco Escudero Gutiérrez

Francisco Escudero Gutiérrez

Auto-generated profile, based on publicly available information

Francisco Escudero Gutiérrez

QuSoft and CWI, Amsterdam, The Netherlands

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 September 2023 in Physical Review Applied
Verified
Journal Article
Closed access
PDF file
FEFrancisco Escudero
Francisco Escudero
DFDavid Fernández-Fernández
David Fernández-Fernández
GJGabriel Jaumà
Gabriel Jaumà
GPGuillermo F. Peñas
Guillermo F. Peñas
LPLuciano Pereira
Luciano Pereira
Variational algorithms have received significant attention in recent years due to their potential to solve practical problems using noisy intermediate-scale quantum (NISQ) devices. A fundamental step of these algorithms is the evaluation of the expected value of Hamiltonians, and hence efficient schemes to perform this task are required. The standard approach employs local measurements of Pauli operators and requires a large number of circuits. An alternative is to use entangled measurements, which might introduce additional gates between physically disconnected qubits that harm the performance. To solve this problem, we propose hardware-efficient entangled measurements (HEEMs), that is, measurements that permit only entanglement between physically connected qubits. We show that this strategy enhances the evaluation of molecular Hamiltonians in NISQ devices by reducing the required circuits without increasing their depth. We provide quantitative metrics of how this approach offers better results than local measurements and arbitrarily entangled measurements. We estimate the ground-state energy of the H2O molecule with classical simulators and quantum hardware using the variational quantum eigensolver with HEEM.

15 June 2025
Verified
Conference Paper
Open access
SASrinivasan Arunachalam
Srinivasan Arunachalam
ADArkopal Dutt
Arkopal Dutt
FGFrancisco Escudero Gutiérrez
Francisco Escudero Gutiérrez

8 December 2025 in Communications in Mathematical Physics
Verified
Journal Article
Open access
PDF file
SASrinivasan Arunachalam
Srinivasan Arunachalam
ADArkopal Dutt
Arkopal Dutt
FGFrancisco Escudero Gutiérrez
Francisco Escudero Gutiérrez
We consider the problems of testing and learning an n-qubit Hamiltonian \(H=\sum _x \lambda _x \sigma _x\) expressed in its Pauli basis, from queries to its evolution operator \(U=e^{-iHt}\). To this end, we prove the following results. 1. Testing: We give a tolerant testing protocol to decide if a Hamiltonian is \(\varepsilon _1\)-close to k-local or \(\varepsilon _2\)-far from k-local in the \(\ell _2\) norm of the coefficients, with \(O(1/(\varepsilon _2-\varepsilon _1)^{4})\) queries, thereby solving two open questions posed in a recent work by Bluhm, Caro and Oufkir (Bluhm, A., Caro, M.C., Oufkir, A.). We give a protocol for testing whether a Hamiltonian is \(\varepsilon _1\)-close to being s-sparse or \(\varepsilon _2\)-far from being s-sparse in the \(\ell _2\) norm of the coefficients, with \(O(s^{6}/(\varepsilon _2^2-\varepsilon _1^2)^{6})\) queries. 2. Learning: We give a protocol to \(\varepsilon \)-learn unstructured Hamiltonian in the \(\ell _\infty \) norm of the coefficients with \(O(1/\varepsilon ^4)\) queries. Combining this with the non-commutative Bohnenblust-Hille inequality, we obtain an algorithm for learning k-local Hamiltonians in \(\ell _2\) norm of the coefficients that only uses \(O(\exp (k^2+k\log (1/\varepsilon )))\) queries. For Hamiltonians that are s-sparse in the Pauli basis, we can learn them in the \(\ell _2\) norm with \(O(s^2/\varepsilon ^4)\) queries. 3. Learning without quantum memory: The learning results stated above have no dependence on the system size n, but require n-qubit quantum memory. We give subroutines that allow us to reproduce all the above learning results without quantum memory; squaring the query complexity and paying a \((\log n)\)-factor in the local case and an n-factor in the sparse case. 4. Testing without quantum memory: We give a new subroutine called Pauli hashing, which allows one to tolerantly test s-sparse Hamiltonians in the \(\ell _2\) norm using \(\tilde{O}(s^{14}/(\varepsilon _2^2-\varepsilon _1^2)^{18})\) query complexity. A key ingredient is showing that s-sparse Pauli channels can be tested in a tolerant fashion as being \(\varepsilon _1\)-close to being s-sparse or \(\varepsilon _2\)-far under the diamond norm, using \(\tilde{O}(s^2/(\varepsilon _2-\varepsilon _1)^6)\) queries via Pauli hashing. In order to prove these results, we prove new structural theorems for local Hamiltonians, sparse Pauli channels and sparse Hamiltonians. We complement our learning algorithms with lower bounds that are polynomially weaker. Furthermore, our algorithms use short time evolutions and do not assume prior knowledge of the terms on which the Pauli spectrum is supported on, i.e., we do not require prior knowledge of the support of the Hamiltonian.

18 November 2024 in Quantum
Verified
Journal Article
Open access
PDF file
JBJop Briët
Jop Briët
FGFrancisco Escudero Gutiérrez
Francisco Escudero Gutiérrez
SGSander Gribling
Sander Gribling
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the famous Grothendieck constant. Here we show that such a result does not generalize to quartic polynomials and 2-query algorithms, even when we allow for additive approximations. We also show that the additive approximation implied by their result is tight for bounded bilinear forms, which gives a new characterization of the Grothendieck constant in terms of 1-query quantum algorithms. Along the way we provide reformulations of the completely bounded norm of a form, and its dual norm.

9 April 2024 in arXiv
Verified
Preprint
Open access
PDF file
FGFrancisco Escudero Gutiérrez
Francisco Escudero Gutiérrez
We consider the problems of testing and learning an $n$-qubit $k$-local Hamiltonian from queries to its evolution operator with respect the 2-norm of the Pauli spectrum, or equivalently, the normalized Frobenius norm. For testing whether a Hamiltonian is $ε_1$-close to $k$-local or $ε_2$-far from $k$-local, we show that $O(1/(ε_2-ε_1)^{8})$ queries suffice. This solves two questions posed in a recent work by Bluhm, Caro and Oufkir. For learning up to error $ε$, we show that $\exp(O(k^2+k\log(1/ε)))$ queries suffice. Our proofs are simple, concise and based on Pauli-analytic techniques.

6 May 2025 in Mathematische Annalen
Verified
Journal Article
Open access
PDF file
SASrinivasan Arunachalam
Srinivasan Arunachalam
ADArkopal Dutt
Arkopal Dutt
FGFrancisco Escudero Gutiérrez
Francisco Escudero Gutiérrez
CPCarlos Palazuelos
Carlos Palazuelos
The main result of this work shows that Bohnenblust–Hille inequality for m-homogeneous polynomials holds with constant one when the infinity norm is replaced by the completely bounded norm. Moreover, we show that this inequality finds some interesting consequences in quantum learning theory. In the second part of this paper, we broaden our investigation of the Bohnenblust–Hille inequality to other contexts. In particular, we extend recent results by Volberg and Zhang, demonstrating its applicability within a framework we have termed “Learning Low-Degree Quantum Objects”.