bibkey: dirr2008relative authors: Gunther Dirr; Uwe Helmke; Martin Kleinsteuber; Thomas Schulte-Herbrüggen year: 2008 title: “Relative C-numerical ranges for applications in quantum control and quantum information” doi: 10.1080/03081080701535898 url: https://arxiv.org/abs/math-ph/0702005v1 claim: “Conjecture 3.6: Every element of E(tloc) is similar to a block-shift matrix via an element of Πex_loc := Πloc·Πout.” strata_touched:
- D5/S3/Quantum/Information/LocalPermutationBlockShiftRefutation license: citation-only triage: anchor
Relative C-numerical ranges for applications in quantum control and quantum information
Verified locator
DOI: https://doi.org/10.1080/03081080701535898
Source: https://arxiv.org/abs/math-ph/0702005v1
Linear and Multilinear Algebra 56, 27–51. The page locators below refer to the arXiv v1 pagination.
Conjecture 3.6
Page 26, continuing on page 27:
Every element of is similar to a block-shift matrix via an element of . Here, denotes the subgroup of all (signed) local permutations, i.e. consists of all matrices of the form with for , and stands for the subgroup generated by , , where the factor appears in all possible positions.
The signed swap is . The tensor basis has its first factor as the most significant bit. The local torus consists of , with real and . Equation (48) expresses membership of a nonzero root space as , where and .
Corollaries 2.18 and 2.19
Page 15, Corollary 2.18:
Let be a torus algebra of . The relative -numerical range of , is rotationally symmetric for all if and only if there exists such that is in .
Page 15, Corollary 2.19:
The classical -numerical range of is rotationally symmetric for all if and only if is unitarily similar to a block-shift matrix , i.e. is of block form such that all the are square blocks and if .
The latter allows arbitrary unitaries. Refuting the restriction to extended local permutations does not refute either corollary.
Remark 2
Page 27, Remark 2(a):
Moreover, and commute and hence is isomorphic to the direct product of and .
Therefore, we expect to be the smallest subgroup of permutations satisfying the above conjecture.
Elementwise commutation fails for the displayed signed generators: for , whereas . This calculation is separate from the settling module. On supports, local bit flips and coordinate swaps compose as ; moving a swap past a flip relabels the flipped coordinate. This statement does not assert elementwise commutation or a direct product of the signed matrix groups.
Refutation and boundaries
The settling module uses three qubits and , . It proves and proves that no matrix in makes block-shift. Its affine support action sends some supported row above its column in Kronecker order, whereas every contiguous block-shift matrix is strictly lower triangular.
The same paper argument extends to with frequency ; this uniform extension is not a theorem of the settling module. For that frequency is zero. The source’s Cases 1–16 are consistent with the conjecture in that dimension; the module does not re-prove that classification. The question of a smallest sufficient signed-permutation subgroup remains open.