arXiv subjects

Bingzhi Zhang

Publications and source records attributed to Bingzhi Zhang.

22 records · Page 2Linked to original sources

arXiv2021

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 multi-path 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.

quant-ph↗

arXiv2021

Quantum Internet under random breakdowns and intentional attacks

Quantum networks 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 quantum networks, 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 quantum networks under random breakdowns, despite the previously discovered robustness in terms of the connectivity. In presence of attack, however, the capacity of scale-free quantum networks 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 quantum networks with regard to its robustness.

quant-ph↗

arXiv2021

Fast suppression 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 decay 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. 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.

quant-ph↗

arXiv2020

Entanglement formation in continuous-variable random quantum networks

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. While previous works on entanglement formation and networking focus on discrete-variable systems, light---as the only travelling carrier of quantum information in a network---is bosonic and thus requires a continuous-variable description in general. In this work, 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 and reveal unique phenomena. We identify squeezing as the source of entanglement generation, which triggers a diffusive spread of entanglement with a parabolic light cone. The entanglement distribution is directly connected to the probability distribution of the random walk, while the scrambling time is determined by the mixing time of the random walk. The dynamics of bipartite entanglement is determined by the boundary of the bipartition; An operational witness of multipartite entanglement, based on advantages in sensing tasks, is introduced to characterize the multipartite entanglement growth. A surprising linear superposition law in the entanglement growth is predicted by the theory and numerically verified, when the squeezers are sparse in space-time, despite the nonlinear nature of the entanglement dynamics. We also give exact solution to the equilibrium entanglement distribution (Page curves), including its fluctuations, and found various shapes dependent on the average squeezing density and strength.

quant-ph↗