Multicast quantum network coding as optimal symmetric universal cloning over a quantum network

• URL: http://arxiv.org/abs/2608.18471v1
• Date: Wed, 19 Aug 2026 02:57:22 GMT
• Title: Multicast quantum network coding as optimal symmetric universal cloning over a quantum network
• Abstract summary: We study the problem of multicasting symmetric universal clones of unknown quantum states over quantum networks with free classical communication.<n>We show that perfect multicast of the corresponding symmetric universal clone is achievable using a small amount of entanglement shared among the target nodes.
• Score: 1.019561860229868
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the problem of perfectly multicasting symmetric universal clones of unknown quantum states over quantum networks with free classical communication. We construct a protocol that multicasts symmetric universal clones of input states from multiple source nodes by extending the quantum network coding protocol proposed by Kobayashi et al. We further establish a sufficient condition for perfect multicast in the single-source setting. Specifically, we show that when a single copy of a $q^r$-dimensional input state is available at the source node, where $q$ is a sufficiently large prime power, perfect multicast of the corresponding symmetric universal clone is achievable using a small amount of entanglement shared among the target nodes. This result holds for quantum networks represented by an undirected graph $G$, where each edge corresponds to a noiseless $q$-dimensional quantum channel, provided that there exists an acyclic directed graph $G'$ obtained by assigning directions to the edges of $G$ such that the minimum cut of $G'$ is at least $r$.

Related papers

• Distributed Quantum Property Testing with Quantum Carrier Pigeons [2.764897610820182]
  We introduce a framework for distributed quantum inference under communication constraints.<n>We focus on the fundamental problem of quantum state certification.<n>We show that the copy complexity of distributed state certification is $(fracd22n_q 2n_c/22)$.
  arXiv  Detail & Related papers  (2026-09-08T15:09:45Z)
• Optimal GHZ-State Distribution in LOSR Quantum Networks via Local Decoding from Information Sets [40.76168869865134]
  We prove the conjecture for regular and uniform networks of arbitrary size.<n>By identifying the hyperedges of the network with the coordinates of a linear code, we show that whenever the edges incident to each node form an information set, a fixed collection of local unitaries transforms the source state into an (N)-party GHZ state with fidelity (dm-M)<n>These results demonstrate that multipartite sources, together with shared randomness, can replace real-time classical communication for entanglement distribution.
  arXiv  Detail & Related papers  (2026-06-19T14:53:28Z)
• Heterogeneous entanglement between a trapped ion and a solid-state quantum memory [18.022941619093235]
  Hybrid quantum networks offer a promising architecture for scalable quantum information processing and a future quantum internet.<n>We demonstrate a hybrid quantum network that entangles a single trapped $mathrm171Yb+$ ion and achieves a quantum memory based on $rm 153Eu3+!Y_SiO5$ crystal over a 75-m separation.<n>This work establishes entanglement between a quantum processing module with a multiplexed quantum memory node, representing a key step toward a scalable, multifunctional quantum internet.
  arXiv  Detail & Related papers  (2026-03-06T02:44:40Z)
• Universal Nested Quantum Switch [0.15293427903448023]
  We show that the same functionality can be achieved with a different geometry that does not rely on a powerful and large central unit.<n>We provide a nested construction with logarithmically many qubits per node and a total of $O(nlog n)$ Bell pairs.<n>We also present a graph state variant with just one qubit per node, which allows one to generate $O(n/log2 n)$ Bell pairs.
  arXiv  Detail & Related papers  (2026-02-27T19:00:10Z)
• Design and Optimization of Adaptive Diversity Schemes in Quantum MIMO Channels [45.812053169933705]
  We study an adaptive diversity strategy for discrete-variable QuMIMO systems based on universal asymmetric cloning at the transmitter and probabilistic purification at the receiver.<n>Results show that the proposed scheme yields significant fidelity gains in crosstalk-dominated settings and automatically adapts to channel symmetry and channel conditions.<n>This work provides design guidelines for future QuMIMO systems and establishes a robust baseline for more advanced transmission and decoding strategies.
  arXiv  Detail & Related papers  (2025-11-19T15:58:10Z)
• Full programmable quantum computing with trapped-ions using semi-global fields [0.0]
  Trapped-ion quantum computing can utilize all motional modes of the ion-crystal, to entangle multiple qubits simultaneously.<n>We explore global and semi-global drives combined with single-qubit flips and show that these can reproduce the full set of multi-qubit gates.<n>Our results pave the way for efficient implementations of quantum algorithms in large-scale trapped-ion quantum systems.
  arXiv  Detail & Related papers  (2025-09-17T18:01:37Z)
• Modular quantum processor with an all-to-all reconfigurable router [34.39074227074929]
  We propose a high-speed on-chip quantum processor that supports reconfigurable all-to-all coupling with a large on-off ratio. We demonstrate reconfigurable controlled-Z gates across all qubit pairs, with a benchmarked average fidelity of $96.00%pm0.08%$. We also generate multi-qubit entanglement, distributed across the separate modules, demonstrating GHZ-3 and GHZ-4 states with fidelities of $88.15%pm0.24%$ and $75.18%pm0.11%$, respectively.
  arXiv  Detail & Related papers  (2024-07-29T16:02:03Z)
• Single Qubit Multi-Party Transmission Using Universal Symmetric Quantum Cloning [1.0878040851638]
  We consider a hypothetical quantum network where Alice wishes to transmit one qubit of information to $M$ parties.<n>We show that Alice can send significantly fewer qubits compared to direct transmission of the message qubits to each of the $M$ remote receivers.
  arXiv  Detail & Related papers  (2023-10-07T21:19:54Z)
• Parallel self-testing of EPR pairs under computational assumptions [12.847847919343646]
  We show that a single EPR pair of a single quantum device can be self-tested under computational assumptions. We show that our protocol can be passed with probability negligibly close to $1$ by an honest quantum device. A simplified version of our protocol is the first that can efficiently certify an arbitrary number of qubits of a single cloud quantum computer.
  arXiv  Detail & Related papers  (2022-01-31T18:42:45Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Secure multi-party quantum computation with few qubits [0.0]
  We consider the task of secure multi-party distributed quantum computation on a quantum network. We propose a protocol based on quantum error correction which reduces the number of necessary qubits. We showcase our protocol on a small example for a 7-node network.
  arXiv  Detail & Related papers  (2020-04-22T10:48:30Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.