pith. sign in

arxiv: 0812.3922 · v1 · submitted 2008-12-20 · 🪐 quant-ph

Optimal covariant quantum networks

classification 🪐 quant-ph
keywords quantumcommunicationalignmentcovariantnetworksoptimalactionallowing
0
0 comments X
read the original abstract

A sequential network of quantum operations is efficiently described by its quantum comb, a non-negative operator with suitable normalization constraints. Here we analyze the case of networks enjoying symmetry with respect to the action of a given group of physical transformations, introducing the notion of covariant combs and testers, and proving the basic structure theorems for these objects. As an application, we discuss the optimal alignment of reference frames (without pre-established common references) with multiple rounds of quantum communication, showing that i) allowing an arbitrary amount of classical communication does not improve the alignment, and ii) a single round of quantum communication is sufficient.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Advantage in Storage and Retrieval of Isometry Channels

    quant-ph 2025-07 unverdicted novelty 7.0

    Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).