Michael Newman

Michael Newman

Auto-generated profile, based on publicly available information

Michael Newman

Google Research, Mountain View, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
4 June 2025 in Nature
Verified
Journal Article
Open access
PDF file
TCT. A. Cochran
T. A. Cochran
BJB. Jobst
B. Jobst
ERE. Rosenberg
E. Rosenberg
YLY. D. Lensky
Y. D. Lensky
GGG. Gyawali
G. Gyawali
PRP. Roushan
P. Roushan
Lattice gauge theories (LGTs)1,2,3,4 can be used to understand a wide range of phenomena, from elementary particle scattering in high-energy physics to effective descriptions of many-body interactions in materials5,6,7. Studying dynamical properties of emergent phases can be challenging, as it requires solving many-body problems that are generally beyond perturbative limits8,9,10. Here we investigate the dynamics of local excitations in a \({{\mathbb{Z}}}_{2}\) LGT using a two-dimensional lattice of superconducting qubits. We first construct a simple variational circuit that prepares low-energy states that have a large overlap with the ground state; then we create charge excitations with local gates and simulate their quantum dynamics by means of a discretized time evolution. As the electric field coupling constant is increased, our measurements show signatures of transitioning from deconfined to confined dynamics. For confined excitations, the electric field induces a tension in the string connecting them. Our method allows us to experimentally image string dynamics in a (2+1)D LGT, from which we uncover two distinct regimes inside the confining phase: for weak confinement, the string fluctuates strongly in the transverse direction, whereas for strong confinement, transverse fluctuations are effectively frozen11,12. We also demonstrate a resonance condition at which dynamical string breaking is facilitated. Our LGT implementation on a quantum processor presents a new set of techniques for investigating emergent excitations and string dynamics.

26 May 2025 in Nature
Verified
Journal Article
Open access
PDF file
NLN. Lacroix
N. Lacroix
ABA. Bourassa
A. Bourassa
FHF. J. H. Heras
F. J. H. Heras
LZL. M. Zhang
L. M. Zhang
JBJ. Bausch
J. Bausch
KSK. J. Satzinger
K. J. Satzinger
Quantum error correction [1–4] is essential for bridging the gap between the error rates of physical devices and the extremely low error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors [5–8] have focused primarily on the surface code [9], which offers a high error threshold but poses limitations for logical operations. The color code [10] enables more efficient logic, but it requires more complex stabilizer measurements and decoding. Measuring these stabilizers in planar architectures like superconducting qubits is challenging, and realizations of color codes [11–19] have not addressed performance scaling with code size on any platform. Here, we present a comprehensive demonstration of the color code on a superconducting processor [8]. Scaling the code distance from three to five suppresses logical errors by a factor of Λ3/5 = 1.56(4). Simulations indicate this performance is below the threshold of the color code, and the color code may become more efficient than the surface code following modest device improvements. We test transversal Clifford gates with logical randomized benchmarking [20] and inject magic states [21], a key resource for universal computation, achieving fidelities exceeding 99 % with post-selection. Finally, we teleport logical states between color codes using lattice surgery [22]. This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future.

16 July 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
SHShilin Huang
Shilin Huang
MNMichael Newman
Michael Newman
KBKenneth R. Brown
Kenneth R. Brown
Quantum error correction requires decoders that are both accurate and efficient. To this end, union-find decoding has emerged as a promising candidate for error correction on the surface code. In this work, we benchmark a weighted variant of the union-find decoder on the toric code under circuit-level depolarizing noise. This variant preserves the almost-linear time complexity of the original while significantly increasing the performance in the fault-tolerance setting. In this noise model, weighting the union-find decoder increases the threshold from 0.38% to 0.62%, compared to an increase from 0.65% to 0.72% when weighting a matching decoder. Further assuming quantum nondemolition measurements, weighted union-find decoding achieves a threshold of 0.76% compared to the 0.90% threshold when matching. We additionally provide comparisons of timing as well as low error rate behavior.

29 May 2019 in Physical Review X
Verified
Journal Article
Open access
PDF file
MLMuyuan Li
Muyuan Li
DMDaniel Miller
Daniel Miller
MNMichael Newman
Michael Newman
YWYukai Wu
Yukai Wu
KBKenneth R. Brown
Kenneth R. Brown
The compass model on a square lattice provides a natural template for building subsystem stabilizer codes. The surface code and the Bacon-Shor code represent two extremes of possible codes depending on how many gauge qubits are fixed. We explore threshold behavior in this broad class of local codes by trading locality for asymmetry and gauge degrees of freedom for stabilizer syndrome information. We analyze these codes with asymmetric and spatially inhomogeneous Pauli noise in the code capacity and phenomenological models. In these idealized settings, we observe considerably higher thresholds against asymmetric noise. At the circuit level, these codes inherit the bare-ancilla fault tolerance of the Bacon-Shor code.

30 July 2020 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
NRNarayanan Rengaswamy
Narayanan Rengaswamy
RCRobert Calderbank
Robert Calderbank
MNMichael Newman
Michael Newman
HPHenry D. Pfister
Henry D. Pfister
In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an algebraic approach to characterize all stabilizer codes for which transversal T and T gates preserve the codespace. Our Heisenberg perspective reduces this question to a finite geometry problem that translates to the design of certain classical codes. We prove three corollaries of this result: (a) For any non-degenerate n,k,d stabilizer code supporting a physical transversal T (which might not be logical T), there exists an n,k,d CSS code with the same property; (b) Triorthogonal codes form the most general family of CSS codes that realize logical transversal T via physical transversal T; (c) Triorthogonality is necessary for physical transversal T on a CSS code to realize the logical identity. The main tool we use is a recent characterization of a particular family of diagonal gates in the Clifford hierarchy that are efficiently described by symmetric matrices over rings of integers N. Rengaswamy et al., Phys. Rev. A 100, 022304. We refer to these operations as Quadratic Form Diagonal (QFD) gates. Our framework generalizes all existing stabilizer code constructions that realize logical gates via transversal T. We provide several examples of codes and briefly discuss connections to decreasing monomial codes, pin codes, generalized triorthogonality and quasitransversality. We partially extend these results towards characterizing all stabilizer codes that support transversal π/2ℓ Z-rotations. In particular, using Ax’s theorem on residue weights of polynomials, we provide an alternate characterization of logical gates induced by transversal π/2ℓ Z-rotations on a family of quantum Reed-Muller codes. We also briefly discuss a general approach to analyze QFD gates that might lead to a characterization of all stabilizer codes that support any given physical transversal 1-or 2-local diagonal gate.

14 May 2025 in Nature Communications
Verified
Journal Article
Open access
PDF file
CGCraig Gidney
Craig Gidney
MNMichael Newman
Michael Newman
PBPeter Brooks
Peter Brooks
CJCody Jones
Cody Jones
One of the biggest obstacles to building a large scale quantum computer is the high qubit cost of protecting quantum information. For two-dimensional architectures, the surface code has long been the leading candidate quantum memory, but can require upwards of a thousand physical qubits per logical qubit to reach algorithmically-relevant logical error rates. In this work, we introduce a hierarchical memory formed from surface codes concatenated into high-density parity check codes. These yoked surface codes are arrayed in a rectangular grid, with parity checks (yokes) measured along each row, and optionally along each column, using lattice surgery. Our construction assumes no additional connectivity beyond a nearest-neighbor square qubit grid operating at a physical error rate of 10−3. At algorithmically-relevant logical error rates, yoked surface codes use as few as one-third the number of physical qubits per logical qubit as standard surface codes, enabling moderate-overhead fault-tolerant quantum memories in two dimensions.