Diego García-Martín

Diego García-Martín

Auto-generated profile, based on publicly available information

Diego García-Martín

Los Alamos National Laboratory

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
16 December 2021 in Quantum Science and Technology
Verified
Journal Article
Closed access
SEStavros Efthymiou
Stavros Efthymiou
SRSergi Ramos-Calderer
Sergi Ramos-Calderer
CBCarlos Bravo-Prieto
Carlos Bravo-Prieto
APAdrián Pérez-Salinas
Adrián Pérez-Salinas
DGDiego García-Martín
Diego García-Martín
SCStefano Carrazza
Stefano Carrazza
We present Qibo , a new open-source software for fast evaluation of quantum circuits and adiabatic evolution which takes full advantage of hardware accelerators. The growing interest in quantum computing and the recent developments of quantum hardware devices motivates the development of new advanced computational tools focused on performance and usage simplicity. In this work we introduce a new quantum simulation framework that enables developers to delegate all complicated aspects of hardware or platform implementation to the library so they can focus on the problem and quantum algorithms at hand. This software is designed from scratch with simulation performance, code simplicity and user friendly interface as target goals. It takes advantage of hardware acceleration such as multi-threading Central Processing Unit (CPU), single Graphics Processing Unit (GPU) and multi-GPU devices.

25 August 2025 in Nature Communications
Verified
Journal Article
Open access
PDF file
MCM. Cerezo
M. Cerezo
MLMartin Larocca
Martin Larocca
DGDiego García-Martín
Diego García-Martín
NDN. L. Diaz
N. L. Diaz
PBPaolo Braccia
Paolo Braccia
ZHZoë Holmes
Zoë Holmes
A large amount of effort has recently been put into understanding the barren plateau phenomenon. In this perspective article, we face the increasingly loud elephant in the room and ask a question that has been hinted at by many but not explicitly addressed: Can the structure that allows one to avoid barren plateaus also be leveraged to efficiently simulate the loss classically? We collect evidence-on a case-by-case basis-that many commonly used models whose loss landscapes avoid barren plateaus can also admit classical simulation, provided that one can collect some classical data from quantum devices during an initial data acquisition phase. This follows from the observation that barren plateaus result from a curse of dimensionality, and that current approaches for solving them end up encoding the problem into some small, classically simulable, subspaces. Thus, while stressing that quantum computers can be essential for collecting data, our analysis sheds doubt on the information processing capabilities of many parametrized quantum circuits with provably barren plateau-free landscapes. We end by discussing the (many) caveats in our arguments including the limitations of average case arguments, the role of smart initializations, models that fall outside our assumptions, the potential for provably superpolynomial advantages and the possibility that, once larger devices become available, parametrized quantum circuits could heuristically outperform our analytic expectations.

4 June 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
CBCarlos Bravo-Prieto
Carlos Bravo-Prieto
DGDiego García-Martín
Diego García-Martín
JLJosé I. Latorre
José I. Latorre
We present a variational quantum circuit that produces the singular value decomposition of a bipartite pure state. The proposed circuit, which we name quantum singular value decomposer or QSVD, is made of two unitaries respectively acting on each part of the system. The key idea of the algorithm is to train this circuit so that the final state displays exact output coincidence from both subsystems for every measurement in the computational basis. Such circuit preserves entanglement between the parties and acts as a diagonalizer that delivers the eigenvalues of the Schmidt decomposition. Our algorithm only requires measurements in one single setting, in striking contrast to the 3n settings required by state tomography. Furthermore, the adjoints of the unitaries making the circuit are used to create the eigenvectors of the decomposition up to a global phase. Some further applications of QSVD are readily obtained. The proposed QSVD circuit allows us to construct a SWAP between the two parties of the system without the need of any quantum gate communicating them. We also show that a circuit made with QSVD and CNOTs acts as an encoder of information of the original state onto one of its parties. This idea can be reversed and used to create random states with a precise entanglement structure.

15 March 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
SRSergi Ramos-Calderer
Sergi Ramos-Calderer
APAdrián Pérez-Salinas
Adrián Pérez-Salinas
DGDiego García-Martín
Diego García-Martín
CBCarlos Bravo-Prieto
Carlos Bravo-Prieto
JCJorge Cortada
Jorge Cortada
JLJosé I. Latorre
José I. Latorre
We present a quantum algorithm for European option pricing in finance, where the key idea is to work in the unary representation of the asset value. The algorithm needs novel circuitry and is divided in three parts: first, the amplitude distribution corresponding to the asset value at maturity is generated using a low-depth circuit; second, the computation of the expected return is computed with simple controlled gates; and third, standard amplitude estimation is used to gain quantum advantage. On the positive side, unary representation remarkably simplifies the structure and depth of the quantum circuit. Amplitude distributions use quantum superposition to bypass the role of classical Monte Carlo simulation. The unary representation also provides a postselection consistency check that allows for a substantial mitigation in the error of the computation. On the negative side, unary representation requires linearly many qubits to represent a target probability distribution, as compared to the logarithmic scaling of binary algorithms. We compare the performance of both unary vs binary option pricing algorithms using error maps, and find that unary representation may bring a relevant advantage in practice for near-term devices.

18 March 2024 in Physical Review Research
Verified
Journal Article
Open access
PDF file
DGDiego García-Martín
Diego García-Martín
MLMartín Larocca
Martín Larocca
MCM. Cerezo
M. Cerezo
Overparametrization is one of the most surprising and notorious phenomena in machine learning. Recently, there have been several efforts to study if, and how, quantum neural networks (QNNs) acting in the absence of hardware noise can be overparametrized. In particular, it has been proposed that a QNN can be defined as overparametrized if it has enough parameters to explore all available directions in state space. That is, if the rank of the quantum Fisher information matrix (QFIM) for the QNN's output state is saturated. Here, we explore how the presence of noise affects the overparametrization phenomenon. Our results show that noise can “turn on” previously zero eigenvalues of the QFIM. This enables the parametrized state to explore directions that were otherwise inaccessible, thus potentially turning an overparametrized QNN into an underparametrized one. For small noise levels, the QNN is quasioverparametrized, as large eigenvalues coexists with small ones. Then, we prove that as the magnitude of noise increases all the eigenvalues of the QFIM become exponentially suppressed, indicating that the state becomes insensitive to any change in the parameters. As such, there is a pull-and-tug effect where noise can enable new directions but also suppress the sensitivity to parameter updates. Finally, our results imply that current QNN capacity measures are ill-defined when hardware noise is present. Published by the American Physical Society 2024

21 May 2025 in Nature Physics
Verified
Journal Article
Open access
PDF file
DGDiego García-Martín
Diego García-Martín
MLMartín Larocca
Martín Larocca
MCM. Cerezo
M. Cerezo
Classical artificial neural networks initialized from independent and identically distributed priors converge to Gaussian processes in the limit of a large number of neurons per hidden layer. This correspondence plays an important role in the current understanding of the capabilities of neural networks. Here we prove an analogous result for quantum neural networks. We show that the outputs of certain models based on Haar-random unitary or orthogonal quantum neural networks converge to Gaussian processes in the limit of large Hilbert space dimension d. The derivation of this result is more nuanced than in the classical case due to the role played by the input states, the measurement observable and because the entries of unitary matrices are not independent. We show that the efficiency of predicting measurements at the output of a quantum neural network using Gaussian process regression depends on the number of measured qubits. Furthermore, our theorems imply that the concentration of measure phenomenon in Haar-random quantum neural networks is worse than previously thought, because expectation values and gradients concentrate as \({\mathcal{O}}\left({1}/{\operatorname{e}^{d}\sqrt{d}}\right)\).