ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Modified graph-state codes for single-node recovery in quantum distributed storage

Nadkarni, PJ and Raina, A and Garani, SS (2020) Modified graph-state codes for single-node recovery in quantum distributed storage. In: Physical Review A, 102 (6).

[img] PDF
phy_rev_102-6_2020.pdf - Published Version
Restricted to Registered users only

Download (572kB) | Request a copy
[img] PDF
Supplemental_Material quantum distributed storage.pdf - Published Supplemental Material
Restricted to Registered users only

Download (359kB) | Request a copy
Official URL: https://dx.doi.org/10.1103/PhysRevA.102.062430

Abstract

Distributed quantum information stored over nodes within a quantum network are prone to node failures, motivating the need for coded quantum networks. We encode k qubits of quantum information over an n-node network in a distributed fashion, with one qubit per node, using modified graph-state codes. We devise a procedure to recover the encoded quantum information in any given arbitrary network after a detected node fails. The recovery procedure is locally within four edges of the failed node. For a network with even number of nodes, we provide a class of scalable modified graph-state codes with rate (n-2)/n, saturating the quantum Singleton bound. This yields higher coding rates than Grassl et al.'s well-known erasure codes and has asymptotic rate 1. For odd node size n, we design the network links to obtain an (n-3)/n rate-optimal modified graph state code. © 2020 American Physical Society.

Item Type: Journal Article
Publication: Physical Review A
Publisher: American Physical Society
Additional Information: The copyright of this article belongs to American Physical Society
Keywords: Codes (symbols); Computer system recovery; Optimal systems; Quantum optics; Qubits; Recovery, Arbitrary networks; Asymptotic rate; Distributed storage; Of quantum-information; Quantum Information; Quantum network; Recovery procedure; Singleton bound, Graph theory
Department/Centre: Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited: 28 Jan 2021 08:06
Last Modified: 28 Jan 2021 08:06
URI: http://eprints.iisc.ac.in/id/eprint/67828

Actions (login required)

View Item View Item