Quantum Network Coding
From MaRDI portal
Publication:3590966
DOI10.1007/978-3-540-70918-3_52zbMATH Open1186.81040arXivquant-ph/0601088OpenAlexW1580277690MaRDI QIDQ3590966FDOQ3590966
Authors: Masahito Hayashi, Harumichi Nishimura, Rudy Raymond, S. Yamasita, Kazuo Iwama 
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Abstract: Since quantum information is continuous, its handling is sometimes surprisingly harder than the classical counterpart. A typical example is cloning; making a copy of digital information is straightforward but it is not possible exactly for quantum information. The question in this paper is whether or not quantum network coding is possible. Its classical counterpart is another good example to show that digital information flow can be done much more efficiently than conventional (say, liquid) flow. Our answer to the question is similar to the case of cloning, namely, it is shown that quantum network coding is possible if approximation is allowed, by using a simple network model called Butterfly. In this network, there are two flow paths, s_1 to t_1 and s_2 to t_2, which shares a single bottleneck channel of capacity one. In the classical case, we can send two bits simultaneously, one for each path, in spite of the bottleneck. Our results for quantum network coding include: (i) We can send any quantum state |psi_1> from s_1 to t_1 and |psi_2> from s_2 to t_2 simultaneously with a fidelity strictly greater than 1/2. (ii) If one of |psi_1> and |psi_2> is classical, then the fidelity can be improved to 2/3. (iii) Similar improvement is also possible if |psi_1> and |psi_2> are restricted to only a finite number of (previously known) states. (iv) Several impossibility results including the general upper bound of the fidelity are also given.
Full work available at URL: https://arxiv.org/abs/quant-ph/0601088
Recommendations
- General Scheme for Perfect Quantum Network Coding with Free Classical Communication
- On quantum network coding
- Quantum network coding for general repeater networks
- Quantum network coding on networks with arbitrarily distributed hidden channels
- Continuous-variable quantum network coding for coherent states
Cited In (40)
- General Scheme for Perfect Quantum Network Coding with Free Classical Communication
- A Poisson model for entanglement optimization in the quantum Internet
- Butterfly network coding based on bidirectional hybrid controlled quantum communication
- Retrieving and routing quantum information in a quantum network
- Generalized asymmetric phase-covariant quantum cloning within a nonextensive approach
- Controllable quantum network coding scheme based on quantum walk
- High-dimensional bidirectional controlled teleportation based on network coding
- Quantum network coding on networks with arbitrarily distributed hidden channels
- Theory behind quantum error correcting codes: an overview
- Quantum network coding utilizing quantum discord resource fully
- Topology adaption for the quantum Internet
- Quantum network coding without loss of information
- Opportunistic quantum network coding based on quantum teleportation
- On quantum network coding
- Quantum information becomes classical when distributed to many users
- Continuous-variable quantum network coding for coherent states
- Entanglement accessibility measures for the quantum Internet
- Quantum network coding for general repeater networks
- Multiparty-controlled joint remote preparation of an arbitrary four-qubit cluster-type state via two different entangled quantum channels
- Network Coding for Distributed Quantum Computation Over Cluster and Butterfly Networks
- Deterministic clone of an unknown \(N\)-qubit entangled state with assistance
- Multicharacters remote rotation sharing with five-particle cluster state
- Secure quantum network coding for controlled repeater networks
- Quantum channels over graph states using generalized measurement-based quantum computation framework
- Quantum network coding reducing decoherence effect
- Entanglement concentration service for the quantum Internet
- Emerging applications of measurement-based quantum computing
- Quantum network probing with indefinite routing
- A review of quantum correlation sharing: the recycling of quantum correlations triggered by quantum measurements
- Heralded quantum network coding of multi-particle states based on quantum time-bin multiplexing
- Building Blocks for Communication Over Noisy Quantum Networks
- Implementation of quantum key distribution network simulation module in the network simulator NS-3
- Adaptive routing for quantum memory failures in the quantum Internet
- Entanglement access control for the quantum Internet
- Secure quantum network coding based on quantum homomorphic message authentication
- Theoretical framework for quantum networks
- Quantum network code for multiple-unicast network with quantum invertible linear operations
- Hierarchical quantum rotation operation sharing with multiparty users
- Network coding for quantum cooperative multicast
- Transitions in Quantum Networks
This page was built for publication: Quantum Network Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590966)
