Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

物理学前沿:英文版

Quantum information density and network

Bi Qiao, Fang Jin-Qing, Liu Gui-ping

Published Dec 6, 2008• 1 citation
Publisher
DOI
10.1007/s11467-009-0004-z

Related papers

Quantum information and atomic networks

Erika Andersson

•Jan 1, 2000•0 citations

Training quantum neural networks using the quantum information bottleneck method

Ahmet Burak Çatlı, Nathan Wiebe

Abstract We provide in this paper a concrete method for training a quantum neural network to maximize the relevant information about a property that is transmitted through the network. This is significant because it gives an operationally well founded quantity to optimize when training autoencoders for problems where the inputs and outputs are fully quantum. We provide a rigorous algorithm for computing the value of the quantum information bottleneck quantity within error ε that requires O ( log 2 ⁡ ( 1 / ϵ ) + 1 / δ 2 ) queries to a purification of the input density operator if its spectrum is supported on { 0 } ⋃ [ δ , 1 − δ ] for δ > 0 and the kernels of the relevant density matrices are disjoint. We further provide algorithms for estimating the derivatives of the QIB function, showing that quantum neural networks can be trained efficiently using the QIB quantity given that the number of gradient steps required is polynomial.

arXiv:2212.02600•Journal of Physics A Mathematical and Theoretical•Aug 9, 2024•4 citations

Quantum Information Theory - A Quantum Bayesian Net Perspective

Robert R. Tucci

The main goal of this paper is to give a pedagogical introduction to Quantum Information Theory-to do this in a new way, using network diagrams called Quantum Bayesian Nets. A lesser goal of the paper is to propose a few new ideas, such as associating with each quantum Bayesian net a very useful density matrix that we call the meta density matrix.

arXiv:quant-ph/9909039•Sep 13, 1999•12 citations

Quantum Information Science

Chopin Soo, Weimin Zhang

•Oct 1, 2005•0 citations

Quantum communication capacity transition of complex quantum networks

Quntao Zhuang, 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.

arXiv:2011.07397•Physical Review A•Aug 16, 2021•29 citations

Quantum information science

David Peter Divincenzo

Quantum Electronics and Laser Science Conference•May 6, 2001•6 citations
Abstract We provide in this paper a concrete method for training a quantum neural network to maximize the relevant information about a property that is transmitted through the network. This is significant because it gives an operationally well founded quantity to optimize when training autoencoders for problems where the inputs and outputs are fully quantum. We provide a rigorous algorithm for computing the value of the quantum information bottleneck quantity within error ε that requires O ( log 2 ⁡ ( 1 / ϵ ) + 1 / δ 2 ) queries to a purification of the input density operator if its spectrum is supported on { 0 } ⋃ [ δ , 1 − δ ] for δ > 0 and the kernels of the relevant density matrices are disjoint. We further provide algorithms for estimating the derivatives of the QIB function, showing that quantum neural networks can be trained efficiently using the QIB quantity given that the number of gradient steps required is polynomial.
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.