Pith. sign in

REVIEW 1 cited by

A Diagrammatic Approach to Information Transmission in Generalised Switches

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.08224 v3 pith:I4FFD27N submitted 2020-03-18 quant-ph

classification quant-ph
keywords quantumswitchtermsapproachcdpcschannelsconditiondiagrammatic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The quantum switch is a higher-order operation that takes as an input two quantum processes and combines them in a coherent superposition of two alternative orders. Here we provide an approach to the quantum switch based on the methods of categorical quantum mechanics. Specifically, we represent the quantum switch as a sum of diagrams in the category of finite dimensional Hilbert spaces, or, equivalently, as a sum of diagrams built from Selinger's CPM construction. The sum-of-diagrams picture provides intuition for the activation of classical capacity of completely depolarising channels (CDPCs) and allows for generalisation to N-channel switches. We demonstrate the use of these partially diagrammatic methods by deriving a permutation condition for computing the output of any N-channel switch of CDPCs, we then use that condition to prove that amongst all possible terms, the interference terms associated to cyclic permutations of the N channels are the information-transmitting terms with maximum normalisation

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension

    quant-ph 2022-07 unverdicted novelty 7.0 of 10

    Defines polyslot pslot[C] and srep[C] constructions on symmetric monoidal categories that reconstruct unitary supermaps and forbid time-loops in composition, with equivalence shown on path-contraction groupoids.

Pith tools