Xun Gao

Xun Gao

Auto-generated profile, based on publicly available information

Xun Gao

JILA

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
3 November 2025 in Physical Review X
Verified
Journal Article
Open access
TSThomas Schuster
Thomas Schuster
CYChao Yin
Chao Yin
XGXun Gao
Xun Gao
NYNorman Y. Yao
Norman Y. Yao
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational basis). Our approach is based upon the intuition that noise exponentially damps nonlocal correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by keeping track of only the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasipolynomial time, so long as the distribution anticoncentrates. A number of implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: For constant noise rates, any quantum circuit for which error mitigation succeeds in polynomial-time on most input states can also be classically simulated in polynomial-time on most input states. Our algorithms scale exponentially in the inverse noise rate, which is fundamental and makes them impractical for current quantum devices.

1 January 2025 in Quantum Science and Technology
Verified
Journal Article
Open access
RBRodrigo Araiza Bravo
Rodrigo Araiza Bravo
TPTaylor L Patti
Taylor L Patti
KNKhadijeh Najafi
Khadijeh Najafi
XGXun Gao
Xun Gao
SYSusanne F Yelin
Susanne F Yelin
Quantum neuromorphic computing (QNC) is a sub-field of quantum machine learning (QML) that capitalizes on inherent system dynamics. As a result, QNC can run on contemporary, noisy quantum hardware and is poised to realize challenging algorithms in the near term. One key issue in QNC is the characterization of the requisite dynamics for ensuring expressive quantum neuromorphic computation. We address this issue by adapting previous proposals of quantum perceptrons (QPs), a quantum version of a simplistic model for neural computation, to the QNC setting. Our QPs compute based on the analog dynamics of interacting qubits with tunable coupling constants. We show that QPs are, with restricted resources, a quantum equivalent to the classical perceptron, a simple mathematical model for a neuron that is the building block of various machine learning architectures. Moreover, we show that QPs are theoretically capable of producing any unitary operation. Thus, QPs are computationally more expressive than their classical counterparts. As a result, QNC architectures built using our QPs are, theoretically, universal. We introduce a technique for mitigating barren plateaus in QPs called entanglement thinning. We demonstrate QPs’ effectiveness by applying them to numerous QML problems, including calculating the inner products between quantum states, energy measurements, and time reversal. Finally, we discuss potential implementations of QPs and how they can be used to build more complex QNC architectures such as quantum reservoir computers.

12 June 2026 in Physical Review B
Verified
Journal Article
Closed access
BKByungmin Kang
Byungmin Kang
CZChen Zhao
Chen Zhao
ZLZhengwei Liu
Zhengwei Liu
XGXun Gao
Xun Gao
SCSoonwon Choi
Soonwon Choi