Patrick Joseph Coles

Patrick Joseph Coles

Top Cited Scholar 2026
Auto-generated profile, based on publicly available information

Patrick Joseph Coles

Theoretical Division Los Alamos National Laboratory 87545 Los Alamos NM USA

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
12 August 2021 in Nature Reviews Physics
Verified
Journal Article
Closed access
PDF file
MCM. Cerezo
M. Cerezo
AAAndrew Arrasmith
Andrew Arrasmith
RBRyan Babbush
Ryan Babbush
SBSimon C. Benjamin
Simon C. Benjamin
SESuguru Endo
Suguru Endo
PCPatrick J. Coles
Patrick J. Coles

19 March 2021 in Nature Communications
Verified
Journal Article
Open access
PDF file
MCM. Cerezo
M. Cerezo
Akira SoneAkira Sone
Akira Sone
TVTyler Volkoff
Tyler Volkoff
LCLukasz Cincio
Lukasz Cincio
PCPatrick J. Coles
Patrick J. Coles
Variational quantum algorithms (VQAs) optimize the parameters θ of a parametrized quantum circuit V(θ) to minimize a cost function C. While VQAs may enable practical applications of noisy quantum computers, they are nevertheless heuristic methods with unproven scaling. Here, we rigorously prove two results, assuming V(θ) is an alternating layered ansatz composed of blocks forming local 2-designs. Our first result states that defining C in terms of global observables leads to exponentially vanishing gradients (i.e., barren plateaus) even when V(θ) is shallow. Hence, several VQAs in the literature must revise their proposed costs. On the other hand, our second result states that defining C with local observables leads to at worst a polynomially vanishing gradient, so long as the depth of V(θ) is $${\mathcal{O}}(\mathrm{log}\,n)$$ O ( log n ) . Our results establish a connection between locality and trainability. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.

29 November 2021 in Nature Communications
Verified
Journal Article
Open access
PDF file
SWSamson Wang
Samson Wang
EFEnrico Fontana
Enrico Fontana
MCM. Cerezo
M. Cerezo
KSKunal Sharma
Kunal Sharma
Akira SoneAkira Sone
Akira Sone
PCPatrick J. Coles
Patrick J. Coles
Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubitsnif the depth of the ansatz grows linearly withn. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.

15 September 2022 in Nature Computational Science
Verified
Journal Article
Closed access
PDF file
MCM. Cerezo
M. Cerezo
GVGuillaume Verdon
Guillaume Verdon
HHHsin-Yuan Huang
Hsin-Yuan Huang
LCLukasz Cincio
Lukasz Cincio
PCPatrick J. Coles
Patrick J. Coles

22 August 2022 in Nature Communications
Verified
Journal Article
Open access
PDF file
MCMatthias C. Caro
Matthias C. Caro
Hsin-Yuan HuangHsin-Yuan Huang
Hsin-Yuan Huang
MCM. Cerezo
M. Cerezo
KSKunal Sharma
Kunal Sharma
ASAndrew Sornborger
Andrew Sornborger
PCPatrick J. Coles
Patrick J. Coles
Modern quantum machine learning (QML) methods involve variationally optimizing a parameterized quantum circuit on a training data set, and subsequently making predictions on a testing data set (i.e., generalizing). In this work, we provide a comprehensive study of generalization performance in QML after training on a limited number N of training data points. We show that the generalization error of a quantum machine learning model with T trainable gates scales at worst as $$\sqrt{T/N}$$ T / N . When only K ≪ T gates have undergone substantial change in the optimization process, we prove that the generalization error improves to $$\sqrt{K/N}$$ K / N . Our results imply that the compiling of unitaries into a polynomial number of native gates, a crucial application for the quantum computing industry that typically uses exponential-size training data, can be sped up significantly. We also show that classification of quantum states across a phase transition with a quantum convolutional neural network requires only a very small training data set. Other potential applications include learning quantum error correcting codes or quantum dynamical simulation. Our work injects new hope into the field of QML, as good generalization is guaranteed from few training data.

26 June 2023 in Nature Computational Science
Verified
Journal Article
Closed access
PDF file
MLMartín Larocca
Martín Larocca
NJNathan Ju
Nathan Ju
DGDiego García-Martín
Diego García-Martín
PCPatrick J. Coles
Patrick J. Coles
MCM. Cerezo
M. Cerezo