Recently, Chau [Quant. Inform. & Comp. 11, 721 (2011)] found a family of metrics and pseudo-metrics on
n-dimensional unitary operators that can be interpreted as the minimum resources (given by certain tight quantum speed limit bounds) needed to transform one unitary operator to another. This result is closely related to the weighted
ℓ1-norm on
Rn. Here we generalize this finding by showing that every weighted
ℓp-norm on
Rn with $1\le p \le \limitingp$ induces a metric and a pseudo-metric on
n-dimensional unitary operators with quantum information-theoretic meanings related to certain tight quantum speed limit bounds. Besides, we investigate how far the correspondence between the existence of metrics and pseudo-metrics of this type and the quantum speed limits can go.
Lifted product (LP) codes form an important class of quantum error correcting codes with favorable code parameters. We introduce a systematic construction of LP code families based on group extensions and graph lifts. The construction increases the code size while preserving the local structure of the Tanner graph, and relates code parameters, logical operators, and fault-tolerant logical-operation gadgets within the families through chain and cochain maps.
As a first application, we obtain LP codes with better code parameters than previously reported ones. We then demonstrate that code-surgery gadgets can be transferred across the selected finite lifts through chain maps and, in several cases, implemented with lower space overhead. We also develop parallel product surgery for lifted clustered cyclic codes. Finally, we propose lifting as a systematic first step toward defining thermodynamic families for algebraically defined qLDPC codes without an underlying Euclidean lattice. For several base codes and selected lifts, coherent information exhibits finite-size crossings, while our results also indicate that additional conditions are needed to determine a unique family.
We consider a family of vector and operator norms defined by the Schmidt decomposition theorem for quantum states. We use these norms to tackle two fundamental problems in quantum information theory: the classification problem for k-positive linear maps and entanglement witnesses, and the existence problem for nonpositive partial transpose bound entangled states. We begin with an analysis of the norms, showing that the vector norms can be explicitly calculated, and we derive several inequalities in order to bound the operator norms and compute them in special cases. We then use the norms to establish what appears to be the most general spectral test for k-positivity currently available, showing how it implies several other known tests as well as some new ones. Building on this work, we frame the nonpositive partial transpose bound entangled problem as a concrete problem on a specific limit, specifically that a particular entangled Werner state is bound entangled if and only if a certain norm inequality holds on a given family of projections.