24 citations · 67 across the 18 of their papers we have counts for
6 papers · 1 filter
A semidefinite program for distillable entanglement
Eric M. Rains
We show that the maximum fidelity obtained by a p.p.t. distillation protocol is given by the solution to a certain semidefinite program. This gives a number of new lower and upper…
Monotonicity of the quantum linear programming bound
Eric M. Rains
The most powerful technique known at present for bounding the size of quantum codes of prescribed minimum distance is the quantum linear programming bound. Unlike the classical lin…
Quantum codes of minimum distance two
Eric M. Rains
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that tec…
Polynomial invariants of quantum codes
Eric M. Rains
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, th…
Nonbinary quantum codes
Eric M. Rains
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived f…
Quantum Weight Enumerators
Eric M. Rains
In a recent paper ([quant-ph/9610040]), Shor and Laflamme define two ``weight enumerators'' for quantum error correcting codes, connected by a MacWilliams transform, and use them t…