Bingzhi Zhang

Bingzhi Zhang

Auto-generated profile, based on publicly available information

Bingzhi Zhang

University of Southern California

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
22 July 2022 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
BZBingzhi Zhang
Bingzhi Zhang
Akira SoneAkira Sone
Akira Sone
QZQuntao Zhuang
Quntao Zhuang
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.

16 August 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
QZQuntao Zhuang
Quntao Zhuang
BZBingzhi Zhang
Bingzhi Zhang
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 February 2021 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
BZBingzhi Zhang
Bingzhi Zhang
QZQuntao Zhuang
Quntao Zhuang
Entanglement is not only important for understanding the fundamental properties of many-body systems, but also the crucial resource enabling quantum advantages in practical information processing tasks. Although previous works on quantum networks focus on discrete-variable systems, light—as the only traveling carrier of quantum information in a network—is bosonic and thus requires a continuous-variable description. We extend the study to continuous-variable quantum networks. By mapping the ensemble-averaged entanglement dynamics on an arbitrary network to a random-walk process on a graph, we are able to exactly solve the entanglement dynamics. We identify squeezing as the source of entanglement generation, which triggers a diffusive spread of entanglement with a "parabolic light cone”. A surprising linear superposition law in the entanglement growth is predicted by the theory and numerically verified, despite the nonlinear nature of the entanglement dynamics. The equilibrium entanglement distribution (Page curves) is exactly solved and has various shapes depending on the average squeezing density and strength.

4 March 2024 in Physical Review Applied
Verified
Journal Article
Closed access
PDF file
HSHaowei Shi
Haowei Shi
BZBingzhi Zhang
Bingzhi Zhang
JSJeffrey H Shapiro
Jeffrey H Shapiro
ZZZheshen Zhang
Zheshen Zhang
QZQuntao Zhuang
Quntao Zhuang
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.

15 October 2024 in Quantum Science and Technology
Verified
Journal Article
Open access
BZBingzhi Zhang
Bingzhi Zhang
QZQuntao Zhuang
Quntao Zhuang
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.

16 July 2021 in Quantum Science and Technology
Verified
Journal Article
Closed access
BZBingzhi Zhang
Bingzhi Zhang
QZQuntao Zhuang
Quntao Zhuang
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.