activity
20132025
most citedMitigating depolarizing noise on quantum computers with noise-estimation circuits

167 citations · 389 across the 8 of their papers we have counts for

collaborators

8 papers

quant-ph2025

Disambiguating Pauli noise in quantum computers

Edward H. Chen, Senrui Chen, Laurin E. Fischer +7

To successfully perform quantum computations, it is often necessary to first accurately characterize the noise in the underlying hardware. However, it is well known that fundamenta…

quant-ph2025★ 1 cited

Improved Quantum Computation using Operator Backpropagation

Bryce Fuller, Minh C. Tran, Danylo Lykov +10

Decoherence of quantum hardware is currently limiting its practical applications. At the same time, classical algorithms for simulating quantum circuits have progressed substantial…

quant-ph2024★ 15 cited

Dynamical simulations of many-body quantum chaos on a quantum computer

Laurin E. Fischer, Matea Leahy, Andrew Eddins +16

Quantum circuits with local unitaries have emerged as a rich playground for the exploration of many-body quantum dynamics of discrete-time systems. While the intrinsic locality mak…

quant-ph2021★ 43 cited

Computationally Efficient Zero Noise Extrapolation for Quantum Gate Error Mitigation

Vincent R. Pascuzzi, Andre He, Christian W. Bauer +2

Zero noise extrapolation (ZNE) is a widely used technique for gate error mitigation on near term quantum computers because it can be implemented in software and does not require kn…

quant-ph2021★ 167 cited

Mitigating depolarizing noise on quantum computers with noise-estimation circuits

Miroslav Urbanek, Benjamin Nachman, Vincent R. Pascuzzi +3

A significant problem for current quantum computers is noise. While there are many distinct noise channels, the depolarizing noise model often appropriately describes average noise…

quant-ph2020★ 162 cited

Resource Efficient Zero Noise Extrapolation with Identity Insertions

Andre He, Benjamin Nachman, Wibe A. de Jong +1

In addition to readout errors, two-qubit gate noise is the main challenge for complex quantum algorithms on noisy intermediate-scale quantum (NISQ) computers. These errors are a si…

math.CO2014

An Elementary Proof of the Cayley Formula Using Random Maps

Steven Hao, Andrew He, Ray Li +1

Cayley's formula states that the number of labelled trees on vertices is , and many of the current proofs involve complex structures or rigorous computation. We presen…

math.CO2013★ 1 cited

A Simple Proof of the Cayley Formula using Random Graphs

Scott Wu, Ray Li, Andrew He +1

We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous…