Zhuo Chen

Zhuo Chen

Auto-generated profile, based on publicly available information

Zhuo Chen

Department of Physics, MIT, Cambridge, MA 02139, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
28 February 2022 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
DLDi Luo
Di Luo
ZCZhuo Chen
Zhuo Chen
JCJuan Carrasquilla
Juan Carrasquilla
BCBryan K. Clark
Bryan K. Clark
The theory of open quantum systems lays the foundation for a substantial part of modern research in quantum science and engineering. Rooted in the dimensionality of their extended Hilbert spaces, the high computational complexity of simulating open quantum systems calls for the development of strategies to approximate their dynamics. In this Letter, we present an approach for tackling open quantum system dynamics. Using an exact probabilistic formulation of quantum physics based on positive operator-valued measure, we compactly represent quantum states with autoregressive neural networks; such networks bring significant algorithmic flexibility due to efficient exact sampling and tractable density. We further introduce the concept of string states to partially restore the symmetry of the autoregressive neural network and improve the description of local correlations. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator using a forward-backward trapezoid method and find the steady state via a variational formulation. Our approach is benchmarked on prototypical one-dimensional and two-dimensional systems, finding results which closely track the exact solution and achieve higher accuracy than alternative approaches based on using Markov chain Monte Carlo method to sample restricted Boltzmann machines. Our Letter provides general methods for understanding quantum dynamics in various contexts, as well as techniques for solving high-dimensional probabilistic differential equations in classical setups.

20 March 2024 in Nature
Verified
Journal Article
Open access
PDF file
ASAdam L. Shaw
Adam L. Shaw
ZCZhuo Chen
Zhuo Chen
JCJoonhee Choi
Joonhee Choi
DMDaniel K. Mark
Daniel K. Mark
PSPascal Scholl
Pascal Scholl
MEManuel Endres
Manuel Endres
Quantum systems have entered a competitive regime in which classical computers must make approximations to represent highly entangled quantum states1,2. However, in this beyond-classically-exact regime, fidelity comparisons between quantum and classical systems have so far been limited to digital quantum devices2–5, and it remains unsolved how to estimate the actual entanglement content of experiments6. Here, we perform fidelity benchmarking and mixed-state entanglement estimation with a 60-atom analogue Rydberg quantum simulator, reaching a high-entanglement entropy regime in which exact classical simulation becomes impractical. Our benchmarking protocol involves extrapolation from comparisons against an approximate classical algorithm, introduced here, with varying entanglement limits. We then develop and demonstrate an estimator of the experimental mixed-state entanglement6, finding our experiment is competitive with state-of-the-art digital quantum devices performing random circuit evolution2–5. Finally, we compare the experimental fidelity against that achieved by various approximate classical algorithms, and find that only the algorithm we introduce is able to keep pace with the experiment on the classical hardware we use. Our results enable a new model for evaluating the ability of both analogue and digital quantum devices to generate entanglement in the beyond-classically-exact regime, and highlight the evolving divide between quantum and classical systems.

29 March 2023 in Physical Review Research
Verified
Journal Article
Open access
PDF file
DLDi Luo
Di Luo
ZCZhuo Chen
Zhuo Chen
KHKaiwen Hu
Kaiwen Hu
ZZZhizhen Zhao
Zhizhen Zhao
Vera HurVera Hur
Vera Hur
BCBryan K. Clark
Bryan K. Clark
Symmetries such as gauge invariance and anyonic symmetry play a crucial role in quantum many-body physics. We develop a general approach to constructing gauge-invariant or anyonic-symmetric autoregressive neural networks, including a wide range of architectures such as transformer and recurrent neural network, for quantum lattice models. These networks can be efficiently sampled and explicitly obey gauge symmetries or anyonic constraint. We prove that our methods can provide exact representation for the ground and excited states of the two- and three-dimensional toric codes, and the X-cube fracton model. We variationally optimize our symmetry-incorporated autoregressive neural networks for ground states as well as real-time dynamics for a variety of models. We simulate the dynamics and the ground states of the quantum link model of U(1) lattice gauge theory, obtain the phase diagram for the two-dimensional Z2 gauge theory, determine the phase transition and the central charge of the SU(2)3 anyonic chain, and also compute the ground-state energy of the SU(2) invariant Heisenberg spin chain. Our approach provides powerful tools for exploring condensed-matter physics, high-energy physics, and quantum information science.

12 April 2021 in Physical Review D
Verified
Journal Article
Closed access
PDF file
ZCZhuo Chen
Zhuo Chen
EHEliu A Huerta
Eliu A Huerta
JAJoseph Adamo
Joseph Adamo
RHRoland Haas
Roland Haas
EOEamonn O’sHea
Eamonn O’sHea
CMChristopher Moore
Christopher Moore
We introduce an improved version of the eccentric, nonspinning, inspiral-Gaussian-process merger approximant (ENIGMA) waveform model that utilizes a more stable and robust numerical method to smoothly connect the analytical relativity-based inspiral evolution with the numerical relativity-based merger phase. We find that this ready-to-use model can: (i) produce physically consistent signals, without reporting any failures, when sampling over 1M samples that were randomly chosen over the m{1,2}∈[5M⊙,50M⊙] parameter space, and the entire range of binary inclination angles; (ii) produce waveforms within 0.04 seconds, averaged over 1000 iterations, from an initial gravitational wave frequency fGW=15  Hz and at a sample rate of 8192 Hz; and (iii) reproduce the physics of quasicircular mergers, since its overlap with SEOBNRv4 waveforms is O≥0.99 assuming advanced LIGO zero detuned high power noise configuration, and signals generated from fGW=15  Hz. We utilize ENIGMA to compute the expected signal-to-noise ratio (SNR) distributions of eccentric binary black hole mergers assuming the existence of second and third generation gravitational wave detector networks. For second generation detectors, we assume the geographical location and detection sensitivities of the twin LIGO detectors, Virgo, KAGRA, LIGO-India, and a LIGO-type detector in Australia. For third generation detectors, we assume the geographical location of second generation detectors, and use the proposed sensitivities of the Cosmic Explorer and the Einstein Telescope. In the context of advanced LIGO-type detectors, we find that the SNR of eccentric mergers is always larger than quasicircular mergers for systems with e0≤0.4 at fGW=10  Hz, even if the timespan of eccentric signals is just a third of quasicircular systems with identical total mass and mass-ratio. For Cosmic Explorer-type detector networks, we find that eccentric mergers have similar SNRs than quasicircular systems for e0≤0.3 at fGW=10  Hz. Systems with e0∼0.5 at fGW=10  Hz have SNRs that range between 50%-90% of the SNR produced by quasicircular mergers, even if these eccentric signals are just between a third to a tenth the length of quasicircular systems. For Einstein Telescope-type detectors, we find that eccentric mergers have similar SNRs than quasicircular systems for e0≤0.4 at fGW=5  Hz. The most eccentric events in our sample, e0∼0.6 at fGW=5  Hz, merge at least five times faster than quasicircular systems, and may be detectable with SNRs between 50%–85% the SNR of quasicircular mergers with identical binary components.

5 September 2024 in Nature Communications
Verified
Journal Article
Open access
PDF file
SCSeou Choi
Seou Choi
YSYannick Salamin
Yannick Salamin
CRCharles Roques-Carmes
Charles Roques-Carmes
RDRumen Dangovski
Rumen Dangovski
DLDi Luo
Di Luo
MSMarin Soljačić
Marin Soljačić
Probabilistic machine learning utilizes controllable sources of randomness to encode uncertainty and enable statistical modeling. Harnessing the pure randomness of quantum vacuum noise, which stems from fluctuating electromagnetic fields, has shown promise for high speed and energy-efficient stochastic photonic elements. Nevertheless, photonic computing hardware which can control these stochastic elements to program probabilistic machine learning algorithms has been limited. Here, we implement a photonic probabilistic computer consisting of a controllable stochastic photonic element – a photonic probabilistic neuron (PPN). Our PPN is implemented in a bistable optical parametric oscillator (OPO) with vacuum-level injected bias fields. We then program a measurement-and-feedback loop for time-multiplexed PPNs with electronic processors (FPGA or GPU) to solve certain probabilistic machine learning tasks. We showcase probabilistic inference and image generation of MNIST-handwritten digits, which are representative examples of discriminative and generative models. In both implementations, quantum vacuum noise is used as a random seed to encode classification uncertainty or probabilistic generation of samples. In addition, we propose a path towards an all-optical probabilistic computing platform, with an estimated sampling rate of ~1 Gbps and energy consumption of ~5 fJ/MAC. Our work paves the way for scalable, ultrafast, and energy-efficient probabilistic machine learning hardware.

6 December 2024 in Physical Review Letters
Verified
Journal Article
Closed access
ZCZhuo Chen
Zhuo Chen
YBYimu Bao
Yimu Bao
SCSoonwon Choi
Soonwon Choi
The dynamics of open quantum systems can be simulated by unraveling it into an ensemble of pure state trajectories undergoing nonunitary monitored evolution, which has recently been shown to undergo measurement-induced entanglement phase transition. Here, we show that, for an arbitrary decoherence channel, one can optimize the unraveling scheme to lower the threshold for entanglement phase transition, thereby enabling efficient classical simulation of the open dynamics for a broader range of decoherence rates. Taking noisy random unitary circuits as a paradigmatic example, we analytically derive the optimum unraveling basis that on average minimizes the threshold. Moreover, we present a heuristic algorithm that adaptively optimizes the unraveling basis for given noise channels, also significantly extending the simulatable regime. When applied to noisy Hamiltonian dynamics, the heuristic approach indeed extends the regime of efficient classical simulation based on matrix product states beyond conventional quantum trajectory methods. Finally, we assess the possibility of using a quasi-local unraveling, which involves multiple qubits and time steps, to efficiently simulate open systems with an arbitrarily small but finite decoherence rate.