Results 11 to 20 of about 710,317 (313)
Squares of matrix-product codes [PDF]
Finite Fields and Their Applications, 2020 The component-wise or Schur product $C*C'$ of two linear error correcting codes $C$ and $C'$ over certain finite field is the linear code spanned by all component-wise products of a codeword in $C$ with a codeword in $C'$. When $C=C'$, we call the product the square of $C$ and denote it $C^{*2}$.
Ignacio Cascudo +2 more
openaire +7 more sources
Stochastic Matrix Product States [PDF]
Physical Review Letters, 2010 The concept of stochastic matrix product states is introduced and a natural form for the states is derived. This allows to define the analogue of Schmidt coefficients for steady states of non-equilibrium stochastic processes. We discuss a new measure for correlations which is analogous to the entanglement entropy, the entropy cost $S_C$, and show that ...
Kristan Temme, Frank Verstraete
openaire +6 more sources
Eigenvalue Inequalities for Matrix Product
IEEE Transactions on Automatic Control, 2006 We present a family of eigenvalue inequalities for the product of a Hermitian matrix and a positive-semidefinite matrix.
Fuzhen Zhang, Qingling Zhang 0001
openaire +3 more sources
Matrix Concentration for Products [PDF]
Foundations of Computational Mathematics, 2021 This paper develops nonasymptotic growth and concentration bounds for a product of independent random matrices. These results sharpen and generalize recent work of Henriksen-Ward, and they are similar in spirit to the results of Ahlswede-Winter and of Tropp for a sum of independent random matrices.
De Huang +3 more
openaire +4 more sources
Querying a Matrix through Matrix-Vector Products [PDF]
ACM Transactions on Algorithms, 2021 We consider algorithms with access to an unknown matrix M ε F n×d via matrix-vector products , namely, the algorithm chooses vectors v 1 , ⃛ , v q , and observes Mv 1 , ⃛ , Mv q . Here the v
Xiaoming Sun 0001 +3 more
openaire +4 more sources
DECODING OF MATRIX-PRODUCT CODES [PDF]
Journal of Algebra and Its Applications, 2013 We propose a decoding algorithm for the (u | u + v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error-correction capability of the code.
Hernando, Fernando, Ruano Benito, Diego
openaire +2 more sources
Matrix product state representations [PDF]
Quantum Information and Computation, 2007 This work gives a detailed investigation of matrix product state (MPS) representations for pure multipartite quantum states. We determine the freedom in representations with and without translation symmetry, derive respective canonical forms and provide efficient methods for obtaining them. Results on frustration free Hamiltonians and the generation of
Perez-Garcia, D +3 more
openaire +7 more sources
Efficiently Correcting Matrix Products [PDF]
Algorithmica, 2016 We study the problem of efficiently correcting an erroneous product of two $n\times n$ matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most $k$ erroneous entries running in $\tilde{O}(n^2+kn)$ time and a deterministic $\tilde{O}(kn^2)$-time algorithm for this problem (where the ...
Leszek Gasieniec +4 more
openaire +8 more sources
Quantum verification of matrix products [PDF]
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006 15 pages, submitted; v2: rewritten, clarified, and fixed some ...
Buhrman, H.M., Spalek, R.
openaire +5 more sources
Parallel Algorithms for Masked Sparse Matrix-Matrix Products
Proceedings of the 51st International Conference on Parallel Processing, 2022 Computing the product of two sparse matrices (SpGEMM) is a fundamental operation in various combinatorial and graph algorithms as well as various bioinformatics and data analytics applications for computing inner-product similarities. For an important class of algorithms, only a subset of the output entries are needed, and the resulting operation is ...
Srdan Milakovic +4 more
openaire +2 more sources