4
$\begingroup$

The diamond norm distance between two operations is the maximum trace distance between their outputs for any input (including inputs entangled with qubits not being operated on).

Is it the case that the Diamond norm is subadditive under composition?

$$\text{Diamond}(U_1 U_2, V_1 V_2) \stackrel{?}{\leq} \text{Diamond}(U_1, V_1) + \text{Diamond}(U_2, V_2)$$

$\endgroup$
  • $\begingroup$ Your notation is cumbersome/unclear in more than one way: Are U,V etc. TPCP maps? What set is A from? What is the definition of "Trace"? (Also, in the example a dagger seems to be missing?) [Note that without you saying what your definition of "Trace" you use, it will be hard to say if you are right or wrong!!] $\endgroup$ – Norbert Schuch Aug 17 '19 at 22:40
  • $\begingroup$ Could it be that you are not using the correct definition of the diamond norm either -- see, e.g. cstheory.stackexchange.com/a/4920/4047? There, it is defined over all extensions of the map to larger systems! $\endgroup$ – Norbert Schuch Aug 18 '19 at 13:20
  • 1
    $\begingroup$ @NorbertSchuch It absolutely could be a slightly wrong definition. Feel free to edit the question to have the correct definition. $\endgroup$ – Craig Gidney Aug 18 '19 at 17:32
  • $\begingroup$ What do you mean by "slightly" wrong?? -- The definition is in the linked question, feel free to copy it. After all, you have to know what is your question - maybe you are after the quantity you defined above rather than the diamond norm distance?? $\endgroup$ – Norbert Schuch Aug 18 '19 at 17:47
  • $\begingroup$ @NorbertSchuch I mean slightly wrong in the sense that the edit distance is small. I only included the definition as a clarification of what "diamond distance" means, and if I got that wrong then I want it corrected. $\endgroup$ – Craig Gidney Aug 18 '19 at 20:55
5
$\begingroup$

For arbitrary linear super-operators $U_j$ and $V_j\def\D{\mathrm{Diamond}} \def\Dn#1{\lVert #1 \rVert_\diamond}\def\le{\leqslant} $, we have $$\def\D{\mathrm{Diamond}} \def\Dn#1{\lVert #1 \rVert_\diamond}\def\le{\leqslant} \begin{aligned} \D(U_1 U_2, V_1 V_2) &= \Dn{U_1 U_2 - V_1 V_2} \\&\le \Dn{U_1 U_2 - V_1 U_2} + \Dn{V_1 U_2 - V_1 V_2} \\&= \Dn{(U_1 - V_1) U_2} + \Dn{V_1(U_2-V_2)} \\&\le \Dn{U_1 - V_1} \Dn{U_2} + \Dn{V_1} \Dn{U_2 - V_2}, \end{aligned}$$ writing compositions by juxtaposition for brevity. In the case that $U_j$ and $V_j$ are CPTP maps, we have $\Dn{U_j} = \Dn{V_j} = 1$, so that $$\begin{aligned} \D(U_1 U_2, V_1 V_2) &\le \Dn{U_1 - V_1} \Dn{U_2} + \Dn{V_1} \Dn{U_2 - V_2} \\&= \Dn{U_1 - V_1} + \Dn{U_2 - V_2} \\&= \D(U_1,V_1) + \D(U_2,V_2).\end{aligned}$$

| improve this answer | |
$\endgroup$
  • 1
    $\begingroup$ Basically all you use is that the diamond norm is an operator norm and thus sub-multiplicative? $\endgroup$ – Norbert Schuch Aug 18 '19 at 17:48
  • 1
    $\begingroup$ @NorbertSchuch: yeah, that's it. $\endgroup$ – Niel de Beaudrap Aug 18 '19 at 19:03

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.