Matthew P. Harrigan

Matthew P. Harrigan

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

Matthew P. Harrigan

Google Research, Mountain View, CA, USA

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
23 October 2019 in Nature
Verified
Journal Article
Open access
PDF file
FAFrank Arute
Frank Arute
KAKunal Arya
Kunal Arya
RBRyan Babbush
Ryan Babbush
DBDave Bacon
Dave Bacon
JBJoseph C Bardin
Joseph C Bardin
JMJohn M Martinis
John M Martinis
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits2,3,4,5,6,7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy8,9,10,11,12,13,14 for this specific computational task, heralding a much-anticipated computing paradigm.

26 July 2017 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
PEPeter Eastman
Peter Eastman
JSJason Swails
Jason Swails
JCJohn Chodera
John Chodera
RMRobert T McGibbon
Robert T McGibbon
YZYutong Zhao
Yutong Zhao
VPVijay S Pande
Vijay S Pande
OpenMM is a molecular dynamics simulation toolkit with a unique focus on extensibility. It allows users to easily add new features, including forces with novel functional forms, new integration algorithms, and new simulation protocols. Those features automatically work on all supported hardware types (including both CPUs and GPUs) and perform well on all of them. In many cases they require minimal coding, just a mathematical description of the desired function. They also require no modification to OpenMM itself and can be distributed independently of OpenMM. This makes it an ideal tool for researchers developing new simulation methods, and also allows those new methods to be immediately available to the larger community.

1 October 2015 in Biophysical Journal
Verified
Journal Article
Closed access
RMRobert T. McGibbon
Robert T. McGibbon
KBKyle A. Beauchamp
Kyle A. Beauchamp
MHMatthew P. Harrigan
Matthew P. Harrigan
CKChristoph Klein
Christoph Klein
JSJason M. Swails
Jason M. Swails
VPVijay S. Pande
Vijay S. Pande

22 February 2023 in Nature
Verified
Journal Article
Open access
PDF file
RARajeev Acharya
Rajeev Acharya
IAIgor Aleiner
Igor Aleiner
RARichard Allen
Richard Allen
TATrond I. Andersen
Trond I. Andersen
MAMarkus Ansmann
Markus Ansmann
NZNingfeng Zhu
Ningfeng Zhu
Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10−6 logical error per cycle floor set by a single high-energy event (1.6 × 10−7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.

9 December 2024 in Nature
Verified
Journal Article
Open access
PDF file
HNHartmut Neven
Hartmut Neven
DADmitry A. Abanin
Dmitry A. Abanin
LALaleh Aghababaie-Beni
Laleh Aghababaie-Beni
IAIgor Aleiner
Igor Aleiner
TATrond I. Andersen
Trond I. Andersen
NZNicholas Zobrist
Nicholas Zobrist
Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of \(\varLambda \mathrm{=2.14}\pm 0.02\) when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit’s lifetime by a factor of \(2.4\pm 0.3\). Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or \(3\) \(\times \) \({10}^{9}\) cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.

4 February 2021 in Nature Physics
Verified
Journal Article
Closed access
PDF file
MHMatthew P. Harrigan
Matthew P. Harrigan
MNMatthew Neeley
Matthew Neeley
KSKevin J. Satzinger
Kevin J. Satzinger
FAFrank Arute
Frank Arute
KAKunal Arya
Kunal Arya
RBRyan Babbush
Ryan Babbush