The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Fast constructions of quantum codes based on residues Pauli block matrices.”

Quantum permutations, Hadamard matrices, and the search for matrix models

Teodor Banica (2012)

Banach Center Publications

Similarity:

This is a presentation of recent work on quantum permutation groups, complex Hadamard matrices, and the connections between them. A long list of problems is included. We include as well some conjectural statements about matrix models.

Certain new M-matrices and their properties with applications

Ratnakaram N. Mohan, Sanpei Kageyama, Moon H. Lee, G. Yang (2008)

Discussiones Mathematicae Probability and Statistics

Similarity:

The Mₙ-matrix was defined by Mohan [21] who has shown a method of constructing (1,-1)-matrices and studied some of their properties. The (1,-1)-matrices were constructed and studied by Cohn [6], Ehrlich [9], Ehrlich and Zeller [10], and Wang [34]. But in this paper, while giving some resemblances of this matrix with a Hadamard matrix, and by naming it as an M-matrix, we show how to construct partially balanced incomplete block designs and some regular graphs by it. Two types of these...

Generalized Kotov-Ushakov attack on tropical Stickel protocol based on modified tropical circulant matrices

Sulaiman Alhussaini, Craig Collett, Sergeĭ Sergeev (2024)

Kybernetika

Similarity:

After the Kotov-Ushakov attack on the tropical implementation of Stickel protocol, various attempts have been made to create a secure variant of such implementation. Some of these attempts used a special class of commuting matrices resembling tropical circulants, and they have been proposed with claims of resilience against the Kotov-Ushakov attack, and even being potential post-quantum candidates. This paper, however, reveals that a form of the Kotov-Ushakov attack remains applicable...

Elementary triangular matrices and inverses of k-Hessenberg and triangular matrices

Luis Verde-Star (2015)

Special Matrices

Similarity:

We use elementary triangular matrices to obtain some factorization, multiplication, and inversion properties of triangular matrices. We also obtain explicit expressions for the inverses of strict k-Hessenberg matrices and banded matrices. Our results can be extended to the cases of block triangular and block Hessenberg matrices. An n × n lower triangular matrix is called elementary if it is of the form I + C, where I is the identity matrix and C is lower triangular and has all of its...

The difference matrices of the classes of a Sharma-Kaushik partition

Bhu Dev Sharma, Norris Sookoo (2004)

Archivum Mathematicum

Similarity:

Sharma-Kaushik partitions have been used to define distances between vectors with n -coordinates. In this paper, “difference matrices” for the partitioning classes have been introduced and investigated. It has been shown that the difference matrices are circulant and that the entries of a product of matrices is an extended intersection number of a distance scheme. The sum of the entries of each row or columns of the product matrix has been obtained. The algebra of matrices generated by...

Combinatorial aspects of generalized complementary basic matrices

Miroslav Fiedler, Frank Hall (2013)

Open Mathematics

Similarity:

This paper extends some properties of the generalized complementary basic matrices, in particular, in a combinatorial direction. These include inheritance (such as for Alternating Sign Matrices), spectral, and sign pattern matrix (including sign nonsingularity) properties.