Retrieving and routing quantum information in a quantum network

DOI10.1007/S11128-015-1109-7zbMATH Open1333.81087arXiv1311.5378OpenAlexW1615763772MaRDI QIDQ264891FDOQ264891

Authors: V. Chiranjeevi, Sk Sazim, Indranil Chakrabarty, Kannan Srinathan 

Publication date: 1 April 2016

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: In extant quantum secret sharing protocols, once the secret is shared in a quantum network ( extsc{qnet}) it can not be retrieved back, even if the dealer wishes that her secret no longer be available in the network. For instance, if the dealer is part of two extsc{qnet}s, say $mathcal{Q}_1$ and $mathcal{Q}_2$ and subsequently finds that $mathcal{Q}_2$ is more reliable than $mathcal{Q}_1$, the dealer may wish to transfer all her secrets from $mathcal{Q}_1$ to $mathcal{Q}_2$. In this work we address this problem by designing a protocol that enables the source/dealer to bring back the information shared in the network, if desired. Unlike classical revocation, no-cloning-theorem automatically ensures that the secret is no longer shared in the network. The implications of our results are multi-fold. One interesting implication of our technique is the possibility of routing qubits in asynchronous extsc{qnets}. By asynchrony we mean that the requisite data/resources are intermittently available (but not necessarily simultaneously) in the extsc{qnet}. For example, we show that a source $S$ can send quantum information to a destination $R$ even though (a) $S$ and $R$ share no quantum resource, (b) $R$'s identity is {em unknown}/ to $S$ initially, (c) $S$ herself can be $R$ at a later date and/or in a different location to bequeath her information and (d) the path chosen for routing the secret may hit a dead-end due to resource constraints. Another implication of our technique is the possibility of using {em insecure}/ resources. For instance, it may safely store its private information with a neighboring organization without revealing data to the host and losing control over retrieving the data. Putting the two implications together, namely routing and secure storage, it is possible to envision applications like quantum mail (qmail) as an outsourced service.

Full work available at URL: https://arxiv.org/abs/1311.5378

Recommendations

• Practical sharing of quantum secrets over untrusted channels
• Expansible quantum secret sharing network
• Single-shot secure quantum network coding for general multiple unicast network with free public communication
• Quantum Network Coding
• Anonymous quantum communication (extended abstract)

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Experimental test of relativistic quantum state collapse with moving reference frames.
• Security of a kind of quantum secret sharing with single photons
• Probabilistic secret sharing through noisy quantum channel
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Graph states for quantum secret sharing
• Quantum secret sharing
• Experimental quantum teleportation
• Quantum cryptography

Cited In (7)

• Cryptanalysis of secret sharing with a single \(d\)-level quantum system
• Quantum key distribution in large scale quantum network assisted by classical routing information
• Revealing advantage in a quantum network
• Temperature-dependent remote control of polarization and coherence intensity with sender's pure initial state
• Broadcasting of entanglement via orthogonal and non-orthogonal state-dependent cloners
• Efficient routing quantum information in one-dimensional tight-binding array
• Single-photon router: implementation of information-holding of quantum states

This page was built for publication: Retrieving and routing quantum information in a quantum network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264891)