Dynamic Network Formation for FSO Satellite Communication

Satellite network optimization is essential, particularly since the cost of manufacturing, launching and maintaining each satellite is significant. Moreover, classical communication optimization methods, such as Minimal Spanning Tree, cannot be applied directly in dynamic scenarios where the satellite constellation is constantly changing. Motivated by the rapid growth of the Star-Link constellation that, as of Q4 2021, consists of over 1600 operational LEO satellites with thousands more expected in the coming years, this paper focuses on the problem of constructing an optimal inter-satellite (laser) communication network. More formally, given a large set of LEO satellites, each equipped with a fixed number of laser links, we direct each laser module on each satellite such that the underlying laser network will be optimal with respect to a given objective function and communication demand. In this work, we present a novel heuristic to create an optimal dynamic optical network communication using an Ant Colony algorithm. This method takes into account both the time it takes to establish an optical link (acquisition time) and the bounded number of communication links, as each satellite has a fixed amount of optical communication modules installed. Based on a large number of simulations, we conclude that, although the underlying problem of bounded-degree-spanning-tree is NP-hard (even for static cases), the suggested ant-colony heuristic is able to compute cost-efficient solutions in semi-real-time.

Multipoint-Interconnected Quantum Communication Networks

As quantum computers with sufficient computational power are becoming mature, the security of classical communication and cryptography may compromise, which is based on the mathematical complexity. Quantum communication technology is a promising solution to secure communication based on quantum mechanics. To meet the secure communication requirements of multiple users, multipoint-interconnected quantum communication networks are specified, including quantum key distribution networks and quantum teleportation networks. The enabling technologies for quantum communication are the important bases for multipoint-interconnected quantum communication networks. To achieve the better connection, resource utilization, and resilience of multipoint-interconnected quantum communication networks, the efficient network architecture and optimization methods are summarized, and open issues in quantum communication networks are discussed.

Applying Infinite Petri Nets to the Cybersecurity of Intelligent Networks, Grids and Clouds

Correctness of networking protocols represents the principal requirement of cybersecurity. Correctness of protocols is established via the procedures of their verification. A classical communication system includes a pair of interacting systems. Recent developments of computing and communication grids for radio broadcasting, cellular networks, communication subsystems of supercomputers, specialized grids for numerical methods and networks on chips require verification of protocols for any number of devices. For analysis of computing and communication grid structures, a new class of infinite Petri nets has been introduced and studied for more than 10 years. Infinite Petri nets were also applied for simulating cellular automata. Rectangular, triangular and hexagonal grids on plane, hyper cube and hyper torus in multidimensional space have been considered. Composing and solving in parametric form infinite Diophantine systems of linear equations allowed us to prove the protocol properties for any grid size and any number of dimensions. Software generators of infinite Petri net models have been developed. Special classes of graphs, such as a graph of packet transmission directions and a graph of blockings, have been introduced and studied. Complex deadlocks have been revealed and classified. In the present paper, infinite Petri nets are divided into two following kinds: a single infinite construct and an infinite set of constructs of specified size (and number of dimensions). Finally, the paper discusses possible future work directions.

Nonlocal implementation of multi-qubit controlled unitary quantum gates with quantum channel

Quantum computers are very efficient in terms of speed and security. Decoherence and architectural complexity restrict the control of sensitive quantum information as the number of qubits in a quantum computer increases. Therefore, it is more convenient to make a device with multiple quantum processors with small number of qubits instead of making a device with a large number of qubits quantum processors. The implementation of controlled unitary gates is a problem in such nonlocal systems. The methods in the literature for this problem use entangled qubit pairs, classical communication channels and classical bits. The existing methods perform some unitary operations on the target state for reconstruction after sending information through classical communication channels and applying quantum measurements on control states. In this study, a generalized method for nonlocal implementation of multi-qubit controlled unitary quantum gates with quantum channel is proposed. The proposed method can implement any controlled gate on the control and target qubits that are far from each other in terms of location. The method does not require classical channels and classical bits, any extra unitary operation for reconstruction. The proposed method is both more secure and uses less resources for operations than the other hybrid methods in the literature. Comparisons with existing studies are given in terms of required entangled qubit pairs, classical channels and bits, extra unitary operations for reconstruction the target state, and the advantages of the proposed method are revealed.

Experimental demonstration of confidential communication with quantum security monitoring

Security issues and attack management of optical communication have come increasingly important. Quantum techniques are explored to secure or protect classical communication. In this paper, we present a method for in-service optical physical layer security monitoring that has vacuum-noise level sensitivity without classical security loopholes. This quantum-based method of eavesdropping detection, similar to that used in conventional pilot tone systems, is achieved by sending quantum signals, here comprised of continuous variable quantum states, i.e. weak coherent states modulated at the quantum level. An experimental demonstration of attack detection using the technique was presented for an ideal fibre tapping attack that taps 1% of the ongoing light in a 10 dB channel, and also an ideal correlated jamming attack in the same channel that maintains the light power with excess noise increased by 0.5 shot noise unit. The quantum monitoring system monitors suspicious changes in the quantum signal with the help of advanced data processing algorithms. In addition, unlike the CV-QKD system which is very sensitive to channel excess noise and receiver system noise, the quantum monitoring is potentially more compatible with current optical infrastructure, as it lowers the system requirements and potentially allows much higher classical data rate communication with links length up to 100 s km.

Practical distributed quantum information processing with LOCCNet

Distributed quantum information processing is essential for building quantum networks and enabling more extensive quantum computations. In this regime, several spatially separated parties share a multipartite quantum system, and the most natural set of operations is Local Operations and Classical Communication (LOCC). As a pivotal part in quantum information theory and practice, LOCC has led to many vital protocols such as quantum teleportation. However, designing practical LOCC protocols is challenging due to LOCC’s intractable structure and limitations set by near-term quantum devices. Here we introduce LOCCNet, a machine learning framework facilitating protocol design and optimization for distributed quantum information processing tasks. As applications, we explore various quantum information tasks such as entanglement distillation, quantum state discrimination, and quantum channel simulation. We discover protocols with evident improvements, in particular, for entanglement distillation with quantum states of interest in quantum information. Our approach opens up new opportunities for exploring entanglement and its applications with machine learning, which will potentially sharpen our understanding of the power and limitations of LOCC. An implementation of LOCCNet is available in Paddle Quantum, a quantum machine learning Python package based on PaddlePaddle deep learning platform.

Quantum communication complexity of distribution testing

The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over $[n]$, and the goal is to decide whether their two distributions are equal, or are $\epsilon$-far apart in the $l_1$-distance. In the present paper we show that the quantum communication complexity of this problem is $\tilde{O}(n/(t\epsilon^2))$ qubits when the distributions have low $l_2$-norm, which gives a quadratic improvement over the classical communication complexity obtained by Andoni, Malkin and Nosatzki. We also obtain a matching lower bound by using the pattern matrix method. Let us stress that the samples received by each of the parties are classical, and it is only communication between them that is quantum. Our results thus give one setting where quantum protocols overcome classical protocols for a testing problem with purely classical samples.

Operator and Graph Theoretic Techniques for Distinguishing Quantum States via One-Way LOCC

We bring together in one place some of the main results and applications from our recent work on quantum information theory, in which we have brought techniques from operator theory, operator algebras, and graph theory for the first time to investigate the topic of distinguishability of sets of quantum states in quantum communication, with particular reference to the framework of one-way local quantum operations and classical communication (LOCC). We also derive a new graph-theoretic description of distinguishability in the case of a single-qubit sender.