ﻻ يوجد ملخص باللغة العربية
In this paper, we target the practical implementation issues of quantum multicast networks. First, we design a recursive lossless compression that allows us to control the trade-off between the circuit complexity and the dimension of the compressed quantum state. We give a formula that describes the trade-off, and further analyze how the formula is affected by the controlling parameter of the recursive procedure. Our recursive lossless compression can be applied in a quantum multicast network where the source outputs homogeneous quantum states (many copies of a quantum state) to a set of destinations through a bottleneck. Such a recursive lossless compression is extremely useful in the current situation where the technology of producing large-scale quantum circuits is limited. Second, we develop two lossless compression schemes that work for heterogeneous quantum states (many copies of a set of quantum states) when the set of quantum states satisfies a certain structure. The heterogeneous compression schemes provide extra compressing power over the homogeneous compression scheme. Finally, we realize our heterogeneous compression schemes in several quantum multicast networks, including the single-source multi-terminal model, the multi-source multi-terminal model, and the ring networks. We then analyze the bandwidth requirements for these network models.
Recent advances in quantum technologies are rapidly stimulating the building of quantum networks. With the parallel development of multiple physical platforms and different types of encodings, a challenge for present and future networks is to uphold
Considering a network of dissipative quantum harmonic oscillators we deduce and analyze the optimum topologies which are able to store, for the largest period of time, a quantum superposition previously prepared in one of the network oscillators. The
Quantum multipartite entangled states play significant roles in quantum information processing. By using difference schemes and orthogonal partitions, we construct a series of infinite classes of irredundant mixed orthogonal arrays (IrMOAs) and thus
Large multipartite quantum systems tend to rapidly reach extraordinary levels of complexity as their number of constituents and entanglement links grow. Here we use complex network theory to study a class of continuous variables quantum states that p
The relation between completely positive maps and compound states is investigated in terms of the notion of quantum conditional probability.