Bingzhi Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Bingzhi Zhang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Quntao Zhuang
University of Southern California
11 shared publications - Akira Sone
Department of Physics University of Massachusetts 02125 Boston Massachusetts USA
1 shared publication Fangjun Hu
Princeton University
1 shared publication- Gino Kwun
University of Southern California
1 shared publication - Hakan E. Türeci
Princeton University
1 shared publication Haowei Shi
Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, California 90089, USA
1 shared publication
Latest Publications
- Open Access
- 6 May 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (2)
Scaling Laws of Quantum Information Lifetime in Monitored Quantum Dynamics
Quantum information is typically fragile under measurements and environmental coupling. Remarkably, we find that its lifetime can scale exponentially with system size when the environment is continuously monitored via midcircuit measurements—regardless of bath size. Starting from a maximally entangled state with a reference, we analytically prove this exponential scaling for typical Haar-random unitaries and confirm it through numerical simulations in both random unitary circuits and chaotic Hamiltonian systems. In the absence of bath monitoring, the lifetime exhibits a markedly different scaling: It grows at most linearly—or remains constant—with system size and decays inversely with the bath size. We further extend our findings numerically to a broad class of initial states. In the intermediate regime of partial monitoring, we identify and prove a two-scale transition, where the quantum mutual information decays logarithmically at microscopic timescales but linearly at macroscopic timescales. We discuss implications for monitored quantum circuits in the weak-measurement limit, quantum algorithms such as quantum diffusion models and quantum reservoir computing, and quantum communication. Finally, we experimentally verify the gap of persisted information on IBM Quantum hardware.
- 6 May 2026
- Published by American Physical Society (APS) in Physical Review X
- Vol. 16 (2)
Open AccessScaling Laws of Quantum Information Lifetime in Monitored Quantum Dynamics
Quantum information is typically fragile under measurements and environmental coupling. Remarkably, we find that its lifetime can scale exponentially with system size when the environment is continuously monitored via midcircuit measurements—regardless of bath size. Starting from a maximally entangled state with a reference, we analytically prove this exponential scaling for typical Haar-random unitaries and confirm it through numerical simulations in both random unitary circuits and chaotic Hamiltonian systems. In the absence of bath monitoring, the lifetime exhibits a markedly different scaling: It grows at most linearly—or remains constant—with system size and decays inversely with the bath size. We further extend our findings numerically to a broad class of initial states. In the intermediate regime of partial monitoring, we identify and prove a two-scale transition, where the quantum mutual information decays logarithmically at microscopic timescales but linearly at macroscopic timescales. We discuss implications for monitored quantum circuits in the weak-measurement limit, quantum algorithms such as quantum diffusion models and quantum reservoir computing, and quantum communication. Finally, we experimentally verify the gap of persisted information on IBM Quantum hardware.
- Open Access
- 9 July 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-9
Holographic deep thermalization for secure and efficient quantum random state generation
Quantum randomness, especially random pure states, underpins fundamental questions like black hole physics and quantum complexity, as well as in practical applications such as quantum device benchmarking and quantum advantage certification. The conventional approach for generating genuine random states, known as ‘deep thermalization’, faces significant challenges, including scalability issues due to the need for a large ancilla system and susceptibility to attacks, as demonstrated in this work. We introduce holographic deep thermalization, a secure and hardware-efficient quantum random state generator. Via a sequence of scrambling-measure-reset processes, it continuously trades space with time, and substantially reduces the required ancilla size to as small as a system-size-independent constant; at the same time, it guarantees security by eliminating quantum correlation between the data system and potential attackers. Thanks to the resource reduction, our circuit-based implementation on IBM Quantum devices achieves genuine 5-qubit random state generation utilizing only a total of 8 qubits.
- 9 July 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-9
Open AccessHolographic deep thermalization for secure and efficient quantum random state generation
Quantum randomness, especially random pure states, underpins fundamental questions like black hole physics and quantum complexity, as well as in practical applications such as quantum device benchmarking and quantum advantage certification. The conventional approach for generating genuine random states, known as ‘deep thermalization’, faces significant challenges, including scalability issues due to the need for a large ancilla system and susceptibility to attacks, as demonstrated in this work. We introduce holographic deep thermalization, a secure and hardware-efficient quantum random state generator. Via a sequence of scrambling-measure-reset processes, it continuously trades space with time, and substantially reduces the required ancilla size to as small as a system-size-independent constant; at the same time, it guarantees security by eliminating quantum correlation between the data system and potential attackers. Thanks to the resource reduction, our circuit-based implementation on IBM Quantum devices achieves genuine 5-qubit random state generation utilizing only a total of 8 qubits.
- 14 March 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (3)
Mixed-state quantum denoising diffusion probabilistic model
- 14 March 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (3)
Mixed-state quantum denoising diffusion probabilistic model
- Open Access
- 29 October 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-12
Dynamical transition in controllable quantum neural networks with large depth
Understanding the training dynamics of quantum neural networks is a fundamental task in quantum information science with wide impact in physics, chemistry and machine learning. In this work, we show that the late-time training dynamics of quantum neural networks with a quadratic loss function can be described by the generalized Lotka-Volterra equations, leading to a transcritical bifurcation transition in the dynamics. When the targeted value of loss function crosses the minimum achievable value from above to below, the dynamics evolve from a frozen-kernel dynamics to a frozen-error dynamics, showing a duality between the quantum neural tangent kernel and the total error. In both regions, the convergence towards the fixed point is exponential, while at the critical point becomes polynomial. We provide a non-perturbative analytical theory to explain the transition via a restricted Haar ensemble at late time, when the output state approaches the steady state. Via mapping the Hessian to an effective Hamiltonian, we also identify a linearly vanishing gap at the transition point. Compared with the linear loss function, we show that a quadratic loss function within the frozen-error dynamics enables a speedup in the training convergence. The theory findings are verified experimentally on IBM quantum devices.
- 29 October 2024
- Published by Springer Nature in Nature Communications
- Vol. 15 (1) , 1-12
Open AccessDynamical transition in controllable quantum neural networks with large depth
Understanding the training dynamics of quantum neural networks is a fundamental task in quantum information science with wide impact in physics, chemistry and machine learning. In this work, we show that the late-time training dynamics of quantum neural networks with a quadratic loss function can be described by the generalized Lotka-Volterra equations, leading to a transcritical bifurcation transition in the dynamics. When the targeted value of loss function crosses the minimum achievable value from above to below, the dynamics evolve from a frozen-kernel dynamics to a frozen-error dynamics, showing a duality between the quantum neural tangent kernel and the total error. In both regions, the convergence towards the fixed point is exponential, while at the critical point becomes polynomial. We provide a non-perturbative analytical theory to explain the transition via a restricted Haar ensemble at late time, when the output state approaches the steady state. Via mapping the Hessian to an effective Hamiltonian, we also identify a linearly vanishing gap at the transition point. Compared with the linear loss function, we show that a quadratic loss function within the frozen-error dynamics enables a speedup in the training convergence. The theory findings are verified experimentally on IBM quantum devices.
- Open Access
- 15 October 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (1) , 015009
Energy-dependent barren plateau in bosonic variational quantum circuits
Bosonic variational quantum circuits (VQCs) are crucial for information processing in microwave cavities, trapped ions, and optical systems, widely applicable in quantum communication, sensing and error correction. The trainability of such VQCs is less understood, hindered by the lack of theoretical tools such as t-design due to the infinite dimension of the continuous-variable systems involved. We overcome this difficulty to reveal an energy-dependent barren plateau in such VQCs. The variance of the gradient decays as 1 / E M ν , exponential in the number of modes M but polynomial in the (per-mode) circuit energy E. The exponent ν = 1 for shallow circuits and ν = 2 for deep circuits. We prove these results for state preparation of general Gaussian states and number states. We also provide numerical evidence demonstrating that the results extend to general state preparation tasks. As circuit energy is a controllable parameter, we provide a strategy to mitigate the barren plateau in bosonic continuous-variable VQCs.
- 15 October 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (1) , 015009
Open AccessEnergy-dependent barren plateau in bosonic variational quantum circuits
Bosonic variational quantum circuits (VQCs) are crucial for information processing in microwave cavities, trapped ions, and optical systems, widely applicable in quantum communication, sensing and error correction. The trainability of such VQCs is less understood, hindered by the lack of theoretical tools such as t-design due to the infinite dimension of the continuous-variable systems involved. We overcome this difficulty to reveal an energy-dependent barren plateau in such VQCs. The variance of the gradient decays as 1 / E M ν , exponential in the number of modes M but polynomial in the (per-mode) circuit energy E. The exponent ν = 1 for shallow circuits and ν = 2 for deep circuits. We prove these results for state preparation of general Gaussian states and number states. We also provide numerical evidence demonstrating that the results extend to general state preparation tasks. As circuit energy is a controllable parameter, we provide a strategy to mitigate the barren plateau in bosonic continuous-variable VQCs.
- 4 March 2024
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 21 (3) , 034004
Optimal entanglement-assisted electromagnetic sensing and communication in the presence of noise
High time-bandwidth product signal and idler pulses comprised of independent identically distributed two-mode squeezed vacuum (TMSV) states are readily produced by spontaneous parametric down-conversion. These pulses are virtually unique among entangled states in that they offer quantum performance advantages—over their best classical-state competitors—in scenarios whose loss and noise break their initial entanglement. Broadband TMSV states’ quantum advantage derives from its signal and idler having a strongly nonclassical phase-sensitive cross correlation, which leads to information-bearing signatures in lossy, noisy scenarios stronger than what can be obtained from classical-state systems of the same transmitted energy. Previous broadband TMSV receiver architectures focused on converting phase-sensitive cross correlation into phase-insensitive cross correlation, which can be measured in second-order interference. In general, however, these receivers fail to deliver broadband TMSV states’ full quantum advantage, even if they are implemented with ideal equipment. This paper introduces the correlation-to-displacement receiver—an alternative architecture comprised of a correlation-to-displacement converter, a programmable mode selector, and a coherent-state information extractor—that can be configured to achieve quantum optimal performance in known sensing and communication protocols for which broadband TMSV provides quantum advantage that is robust against entanglement-breaking loss and noise.
- 4 March 2024
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 21 (3) , 034004
Optimal entanglement-assisted electromagnetic sensing and communication in the presence of noise
High time-bandwidth product signal and idler pulses comprised of independent identically distributed two-mode squeezed vacuum (TMSV) states are readily produced by spontaneous parametric down-conversion. These pulses are virtually unique among entangled states in that they offer quantum performance advantages—over their best classical-state competitors—in scenarios whose loss and noise break their initial entanglement. Broadband TMSV states’ quantum advantage derives from its signal and idler having a strongly nonclassical phase-sensitive cross correlation, which leads to information-bearing signatures in lossy, noisy scenarios stronger than what can be obtained from classical-state systems of the same transmitted energy. Previous broadband TMSV receiver architectures focused on converting phase-sensitive cross correlation into phase-insensitive cross correlation, which can be measured in second-order interference. In general, however, these receivers fail to deliver broadband TMSV states’ full quantum advantage, even if they are implemented with ideal equipment. This paper introduces the correlation-to-displacement receiver—an alternative architecture comprised of a correlation-to-displacement converter, a programmable mode selector, and a coherent-state information extractor—that can be configured to achieve quantum optimal performance in known sensing and communication protocols for which broadband TMSV provides quantum advantage that is robust against entanglement-breaking loss and noise.
- Open Access
- 22 July 2022
- Published by Springer Nature in npj Quantum Information
- Vol. 8 (1) , 1-11
Quantum computational phase transition in combinatorial problems
Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.
- 22 July 2022
- Published by Springer Nature in npj Quantum Information
- Vol. 8 (1) , 1-11
Open AccessQuantum computational phase transition in combinatorial problems
Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.
- 6 June 2022
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 7 (3) , 035017
Fast decay of classification error in variational quantum circuits
Variational quantum circuits (VQCs) have shown great potential in near-term applications. However, the discriminative power of a VQC, in connection to its circuit architecture and depth, is not understood. To unleash the genuine discriminative power of a VQC, we propose a VQC system with the optimal classical post-processing—maximum-likelihood estimation on measuring all VQC output qubits. Via extensive numerical simulations, we find that the error of VQC quantum data classification typically decays exponentially with the circuit depth, when the VQC architecture is extensive—the number of gates does not shrink with the circuit depth. This fast error suppression ends at the saturation towards the ultimate Helstrom limit of quantum state discrimination. On the other hand, non-extensive VQCs such as quantum convolutional neural networks are sub-optimal and fail to achieve the Helstrom limit, demonstrating a trade-off between ansatz complexity and classification performance in general. To achieve the best performance for a given VQC, the optimal classical post-processing is crucial even for a binary classification problem. To simplify VQCs for near-term implementations, we find that utilizing the symmetry of the input properly can improve the performance, while oversimplification can lead to degradation.
- 6 June 2022
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 7 (3) , 035017
Fast decay of classification error in variational quantum circuits
Variational quantum circuits (VQCs) have shown great potential in near-term applications. However, the discriminative power of a VQC, in connection to its circuit architecture and depth, is not understood. To unleash the genuine discriminative power of a VQC, we propose a VQC system with the optimal classical post-processing—maximum-likelihood estimation on measuring all VQC output qubits. Via extensive numerical simulations, we find that the error of VQC quantum data classification typically decays exponentially with the circuit depth, when the VQC architecture is extensive—the number of gates does not shrink with the circuit depth. This fast error suppression ends at the saturation towards the ultimate Helstrom limit of quantum state discrimination. On the other hand, non-extensive VQCs such as quantum convolutional neural networks are sub-optimal and fail to achieve the Helstrom limit, demonstrating a trade-off between ansatz complexity and classification performance in general. To achieve the best performance for a given VQC, the optimal classical post-processing is crucial even for a binary classification problem. To simplify VQCs for near-term implementations, we find that utilizing the symmetry of the input properly can improve the performance, while oversimplification can lead to degradation.
- 16 August 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (2) , 022608
Quantum communication capacity transition of complex quantum networks
Quantum network is the key to enable distributed quantum information processing. As the single-link communication rate decays exponentially with the distance, to enable reliable end-to-end quantum communication, the number of nodes needs to grow with the network scale. For highly connected networks, we identify a threshold transition in the capacity as the density of network nodes increases: below a critical density the rate is almost zero, while above the threshold the rate increases linearly with the density. Surprisingly, above the threshold the typical communication capacity between two nodes is independent of the distance between them, due to multipath routing enabled by the quantum network. In contrast, for less connected networks such as scale-free networks, the end-to-end capacity saturates to constants as the number of nodes increases, and always decays with the distance. Our results are based on capacity evaluations, therefore the minimum density requirement for an appreciable capacity applies to any general protocols of quantum networks.
- 16 August 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (2) , 022608
Quantum communication capacity transition of complex quantum networks
Quantum network is the key to enable distributed quantum information processing. As the single-link communication rate decays exponentially with the distance, to enable reliable end-to-end quantum communication, the number of nodes needs to grow with the network scale. For highly connected networks, we identify a threshold transition in the capacity as the density of network nodes increases: below a critical density the rate is almost zero, while above the threshold the rate increases linearly with the density. Surprisingly, above the threshold the typical communication capacity between two nodes is independent of the distance between them, due to multipath routing enabled by the quantum network. In contrast, for less connected networks such as scale-free networks, the end-to-end capacity saturates to constants as the number of nodes increases, and always decays with the distance. Our results are based on capacity evaluations, therefore the minimum density requirement for an appreciable capacity applies to any general protocols of quantum networks.
- 16 July 2021
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 6 (4) , 045007
Quantum internet under random breakdowns and intentional attacks
Quantum networks (QNs) will play a key role in distributed quantum information processing. As the network size increases, network-level errors like random breakdown and intentional attack are inevitable; therefore, it is important to understand the robustness of large-scale QNs, similar to what has been done for the classical counterpart—the internet. For exponential networks such as Waxman networks, errors simply re-parameterize the network and lead to a linear decrease of the quantum capacity with the probability of error. The same linear decay happens for scale-free QNs under random breakdowns, despite the previously discovered robustness in terms of the connectivity. In presence of attack, however, the capacity of scale-free QNs shows a sharp exponential decay with the increasing attack fraction. Our results apply to quantum internet based on fibers for all kinds of quantum communications and provide implications for the future construction of QNs with regard to its robustness.
- 16 July 2021
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 6 (4) , 045007
Quantum internet under random breakdowns and intentional attacks
Quantum networks (QNs) will play a key role in distributed quantum information processing. As the network size increases, network-level errors like random breakdown and intentional attack are inevitable; therefore, it is important to understand the robustness of large-scale QNs, similar to what has been done for the classical counterpart—the internet. For exponential networks such as Waxman networks, errors simply re-parameterize the network and lead to a linear decrease of the quantum capacity with the probability of error. The same linear decay happens for scale-free QNs under random breakdowns, despite the previously discovered robustness in terms of the connectivity. In presence of attack, however, the capacity of scale-free QNs shows a sharp exponential decay with the increasing attack fraction. Our results apply to quantum internet based on fibers for all kinds of quantum communications and provide implications for the future construction of QNs with regard to its robustness.