Asynchronous reference frame agreement in a quantum network

DOI10.1088/1367-2630/18/3/033018MaRDI QIDQ5854987zbMATH OpenOpenAlexFDO

Authors Tanvirul Islam, S. Wehner

Publication date 12 March 2021

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

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

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) LOCC, teleportation, dense coding, remote state operations, distillation (81P48)

Abstract: An efficient implementation of many multiparty protocols for quantum networks requires that all the nodes in the network share a common reference frame. Establishing such a reference frame from scratch is especially challenging in an asynchronous network where network links might have arbitrary delays and the nodes do not share synchronised clocks. In this work, we study the problem of establishing a common reference frame in an asynchronous network of $n$ nodes of which at most $t$ are affected by arbitrary unknown error, and the identities of the faulty nodes are not known. We present a protocol that allows all the correctly functioning nodes to agree on a common reference frame as long as the network graph is complete and not more than $t<n/4$ nodes are faulty. As the protocol is asynchronous, it can be used with some assumptions to synchronise clocks over a network. Also, the protocol has the appealing property that it allows any existing two-node asynchronous protocol for reference frame agreement to be lifted to a robust protocol for an asynchronous quantum network.

Recommendations

• Spatial reference frame agreement in quantum networks
• Quantum synchronization over quantum networks
• Optimal covariant quantum networks
• Quantum frequency synchronization of distant clock oscillators
• Demonstration of multiparty quantum clock synchronization

Cites work

• ALIGNING SPATIAL FRAMES THROUGH QUANTUM CHANNELS
• Demonstration of Blind Quantum Computing
• Efficient distributed quantum computing
• Extremal covariant positive operator valued measures
• Optimal Extraction of Information from Finite Quantum Ensembles
• Reaching Agreement in the Presence of Faults
• Reference frames, superselection rules, and quantum information
• Resilient-optimal interactive consistency in constant time
• Spatial reference frame agreement in quantum networks
• The Byzantine Generals Problem

Cited in

(1)

• Spatial reference frame agreement in quantum networks

This page was built for publication: Asynchronous reference frame agreement in a quantum network

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