Results 21 to 30 of about 665,812 (269)
Matrix product and sum rule for Macdonald polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We present a new, explicit sum formula for symmetric Macdonald polynomials Pλ and show that they can be written as a trace over a product of (infinite dimensional) matrices. These matrices satisfy the Zamolodchikov– Faddeev (ZF) algebra.
Luigi Cantini +2 more
doaj +1 more source
Testing matrix product states [PDF]
, 2022 Devising schemes for testing the amount of entanglement in quantum systems has played a crucial role in quantum computing and information theory. Here, we study the problem of testing whether an unknown state $|\psi\rangle$ is a matrix product state (MPS) in the property testing model.
Mehdi Soleimanifar, John Wright 0004
openaire +2 more sources
Commuting decomposition of Kn1,n2,...,nk through realization of the product A(G)A(GPk )
Special Matrices, 2018 In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is ...
Bhat K. Arathi, Sudhakara G.
doaj +1 more source
AN ORDER-P TENSOR MULTIPLICATION WITH CIRCULANT STRUCTURE
Barekeng, 2023 Research on mathematical operations involving multidimensional arrays or tensors has increased along with the growing applications involving multidimensional data analysis. The -product of order- tensor is one of tensor multiplications.
Itsar Mangngiri +2 more
doaj +1 more source
Quantum Error Mitigation via Matrix Product Operators
PRX Quantum, 2022 In the era of noisy intermediate-scale quantum devices, the number of controllable hardware qubits is insufficient to implement quantum error correction.
Yuchen Guo, Shuo Yang
doaj +1 more source
Lower Bounds for Matrix Product [PDF]
SIAM Journal on Computing, 2001 We prove lower bounds on the number of product gates in bilinear and quadratic circuits that compute the product of two $n \cross n$ matrices over finite fields. In particular we obtain the following results: 1. We show that the number of product gates in any bilinear (or quadratic) circuit that computes the product of two $n \cross n$ matrices over ...
openaire +3 more sources
Some determinantal inequalities for Hadamard and Fan products of matrices
Journal of Inequalities and Applications, 2016 In this note, we generalize some determinantal inequalities which are due to Lynn (Proc. Camb. Philos. 60:425-431, 1964), Chen (Linear Algebra Appl. 368:99-106, 2003) and Ando (Linear Multilinear Algebra 8:291-316, 1980).
Xiaohui Fu, Yang Liu
doaj +1 more source
Zero Triple Product Determined Matrix Algebras
Journal of Applied Mathematics, 2012 Let A be an algebra over a commutative unital ring C. We say that A is zero triple product determined if for every C-module X and every trilinear map {⋅,⋅,⋅}, the following holds: if {x,y,z}=0 whenever xyz=0, then there exists a C-linear operator T:A3⟶X ...
Hongmei Yao, Baodong Zheng
doaj +1 more source
Integrable Matrix Product States from boundary integrability
SciPost Physics, 2019 We consider integrable Matrix Product States (MPS) in integrable spin chains and show that they correspond to "operator valued" solutions of the so-called twisted Boundary Yang-Baxter (or reflection) equation. We argue that the integrability condition
Balázs Pozsgay, Lorenzo Piroli, Eric Vernier
doaj +1 more source
Quantum Heat Statistics with Time-Evolving Matrix Product Operators
PRX Quantum, 2021 We present a numerically exact method to compute the full counting statistics of heat transfer in non-Markovian open quantum systems, which is based on the time-evolving matrix product operator algorithm. This approach is applied to the paradigmatic spin-
Maria Popovic +5 more
doaj +1 more source