Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2301.08241 · Quantum

A generic quantum Wielandt's inequality

Yifan Jia, Ángela Capel

Published May 2, 2024• 6 citations
arXivHTMLPDF

Abstract

Quantum Wielandt's inequality gives an optimal upper bound on the minimal length k such that length- k products of elements in a generating system span Mn(C) . It is conjectured that k should be of order O(n2) in general. In this paper, we give an overview of how the question has been studied in the literature so far and its relation to a classical question in linear algebra, namely the length of the algebra Mn(C) . We provide a generic version of quantum Wielandt's inequality, which gives the optimal length with probability one. More specifically, we prove based on [KS16] that k generically is of order Θ(log⁡n) , as opposed to the general case, in which the best bound to date is O(n2log⁡n) . Our result implies a new bound on the primitivity index of a random quantum channel. Furthermore, we shed new light on a long-standing open problem for Projected Entangled Pair State, by concluding that almost any translation-invariant PEPS (in particular, Matrix Product State) with periodic boundary conditions on a grid with side length of order Ω(log⁡n) is the unique ground state of a local Hamiltonian. We observe similar characteristics for matrix Lie algebras and provide numerical results for random Lie-generating systems.

DOI
10.22331/q-2024-05-02-1331

Related papers

A Quantum Version of Wielandt's Inequality

Mikel Sanz, David Pérez-García, Michael M. Wolf +1 more

In this paper, Wielandt's inequality for classical channels is extended to quantum channels. That is, an upper bound to the number of times a channel must be applied, so that it maps any density operator to one with full rank, is found. Using this bound, dichotomy theorems for the zero-error capacity of quantum channels and for the Matrix Product State (MPS) dimension of ground states of frustration-free Hamiltonians are derived. The obtained inequalities also imply new bounds on the required interaction-range of Hamiltonians with unique MPS ground state.

arXiv:0909.5347•IEEE Transactions on Information Theory•Aug 19, 2010•116 citations

A New Bound on Quantum Wielandt Inequality

Mizanur Rahaman

A new bound on quantum version of Wielandt inequality for positive (not necessarily completely positive) maps has been established. Also bounds for entanglement breaking and PPT channels are put forward which are better bound than the previous bounds known. We prove that a primitive positive map E acting on Mdthat satisfies the Schwarz inequality becomes strictly positive after at most 2(d-1)2iterations. This is to say that after 2(d-1)2iterations, such a map sends every positive semidefinite matrix to a positive definite one. This finding does not depend on the number of Kraus operators as the map may not admit any Kraus decomposition. The motivation of this work is to provide an answer to a question raised by Sanz-García-Wolf and Cirac in their work on quantum Wielandt bound.

arXiv:1807.06872•IEEE Transactions on Information Theory•Oct 7, 2019•21 citations

Uniform matrix product states with a boundary

Marta Florido-Llinàs, Álvaro M. Alhambra, David Pérez-García +1 more

Canonical forms are central to the analytical understanding of tensor network states, underpinning key results such as the complete classification of one-dimensional symmetry-protected topological phases within the matrix product state (MPS) framework. Yet, the established theory applies only to uniform MPS with periodic boundary conditions, leaving many physically relevant states beyond its reach. Here we introduce a generalized canonical form for uniform MPS with a boundary matrix, thus extending the analytical MPS framework to a more general setting of wider physical significance. This canonical form reveals that any such MPS can be represented as a block-invertible matrix product operator acting on a structured class of algebraic regular language states that capture its essential long-range and scale-invariant features. Our construction builds on new algebraic results of independent interest that characterize the span and algebra generated by non-semisimple sets of matrices, including a generalized quantum Wielandt's inequality that gives an explicit upper bound on the blocking length at which the fixed-length span stabilizes to an algebra. Together, these results establish a unified theoretical foundation for uniform MPS with boundaries, bridging the gap between periodic and arbitrary-boundary settings, and providing the basis for extending key analytical and classification results of matrix product states to a much broader class of states and operators.

quant-pharXiv:2512.11968•Dec 16, 2025•9 citations

Preprint arXiv:2512.11968 Submitted on 12 Dec 2025

M. Florido-Llinas, Alvaro Martin Alhambra, David Pérez-García +1 more

Canonical forms are central to the analytical understanding of tensor network states, underpinning key results such as the complete classification of one-dimensional symmetry-protected topological phases within the matrix product state (MPS) framework. Yet, the established theory applies only to uniform MPS with periodic boundary conditions, leaving many physically relevant states beyond its reach. Here we introduce a generalized canonical form for uniform MPS with a boundary matrix, thus extending the analytical MPS framework to a more general setting of wider physical significance. This canonical form reveals that any such MPS can be represented as a block-invertible matrix product operator acting on a structured class of algebraic regular language states that capture its essential long-range and scale-invariant features. Our construction builds on new algebraic results of independent interest that characterize the span and algebra generated by non-semisimple sets of matrices, including a generalized quantum Wielandt's inequality that gives an explicit upper bound on the blocking length at which the fixed-length span stabilizes to an algebra. Together, these results establish a unified theoretical foundation for uniform MPS with boundaries, bridging the gap between periodic and arbitrary-boundary settings, and providing the basis for extending key analytical and classification results of matrix product states to a much broader class of states and operators.

•Dec 16, 2025•0 citations

A Tensor Version of the Quantum Wielandt Theorem

Mateusz Michałek, Tim Seynnaeve, Frank Verstraete

We prove boundedness results for the injectivity regions for projected entangled pair states. Our result is a higher-dimensional generalization of the quantum Wielandt inequality.

arXiv:1811.05502•SIAM Journal on Matrix Analysis and Applications•Jan 1, 2019•10 citations

Lower Bounds on Quantum Multiparty Communication Complexity

Troy Lee, Gideon Schechtman, Adi Shraibman

A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power of two is known, despite significant efforts. We examine this question in the number-on-the-forehead model of multiparty communication complexity. We show that essentially all lower bounds known on randomized complexity in this model also hold for quantum communication. This includes bounds of size Omega(n/2k) for the k-party complexity of explicit functions, bounds for the generalized inner product function, and recent work on the multiparty complexity of disjointness. To the best of our knowledge, these are the first lower bounds of any kind on quantum communication in the general number-on-the-forehead model. We show this result in the following way. In the two-party case, there is a lower bound on quantum communication complexity in terms of a norm gamma2, which is known to subsume nearly all other techniques in the literature. For randomized complexity there is another natural bound in terms of a different norm mu which is also one of the strongest techniques available. A deep theorem in functional analysis, Grothendieck's inequality, implies that gamma2and mu are equivalent up to a constant factor. This connection is one of the major obstacles to showing a larger gap between randomized and quantum communication complexity in the two-party case. The lower bound technique in terms of the norm mu was recently extended to the multiparty number-on-the-forehead model. Here we show how the gamma2norm can be also extended to lower bound quantum multiparty complexity. Surprisingly, even in this general setting the two lower bounds, on quantum and classical communication, are still very closely related. This implies that separating quantum and classical communication in this setting will require the development of new techniques. The relation between these extensions of mu and gamma2is proved by a multi-dimensional version of Grothendieck's inequality.

IEEE Conference on Computational Complexity (CCC)•Jul 1, 2009•22 citations
Quantum Wielandt's inequality gives an optimal upper bound on the minimal length k such that length- k products of elements in a generating system span Mn(C) . It is conjectured that k should be of order O(n2) in general. In this paper, we give an overview of how the question has been studied in the literature so far and its relation to a classical question in linear algebra, namely the length of the algebra Mn(C) . We provide a generic version of quantum Wielandt's inequality, which gives the optimal length with probability one. More specifically, we prove based on [KS16] that k generically is of order Θ(log⁡n) , as opposed to the general case, in which the best bound to date is O(n2log⁡n) . Our result implies a new bound on the primitivity index of a random quantum channel. Furthermore, we shed new light on a long-standing open problem for Projected Entangled Pair State, by concluding that almost any translation-invariant PEPS (in particular, Matrix Product State) with periodic boundary conditions on a grid with side length of order Ω(log⁡n) is the unique ground state of a local Hamiltonian. We observe similar characteristics for matrix Lie algebras and provide numerical results for random Lie-generating systems.
In this paper, Wielandt's inequality for classical channels is extended to quantum channels. That is, an upper bound to the number of times a channel must be applied, so that it maps any density operator to one with full rank, is found. Using this bound, dichotomy theorems for the zero-error capacity of quantum channels and for the Matrix Product State (MPS) dimension of ground states of frustration-free Hamiltonians are derived. The obtained inequalities also imply new bounds on the required interaction-range of Hamiltonians with unique MPS ground state.
A new bound on quantum version of Wielandt inequality for positive (not necessarily completely positive) maps has been established. Also bounds for entanglement breaking and PPT channels are put forward which are better bound than the previous bounds known. We prove that a primitive positive map E acting on Mdthat satisfies the Schwarz inequality becomes strictly positive after at most 2(d-1)2iterations. This is to say that after 2(d-1)2iterations, such a map sends every positive semidefinite matrix to a positive definite one. This finding does not depend on the number of Kraus operators as the map may not admit any Kraus decomposition. The motivation of this work is to provide an answer to a question raised by Sanz-García-Wolf and Cirac in their work on quantum Wielandt bound.
Canonical forms are central to the analytical understanding of tensor network states, underpinning key results such as the complete classification of one-dimensional symmetry-protected topological phases within the matrix product state (MPS) framework. Yet, the established theory applies only to uniform MPS with periodic boundary conditions, leaving many physically relevant states beyond its reach. Here we introduce a generalized canonical form for uniform MPS with a boundary matrix, thus extending the analytical MPS framework to a more general setting of wider physical significance. This canonical form reveals that any such MPS can be represented as a block-invertible matrix product operator acting on a structured class of algebraic regular language states that capture its essential long-range and scale-invariant features. Our construction builds on new algebraic results of independent interest that characterize the span and algebra generated by non-semisimple sets of matrices, including a generalized quantum Wielandt's inequality that gives an explicit upper bound on the blocking length at which the fixed-length span stabilizes to an algebra. Together, these results establish a unified theoretical foundation for uniform MPS with boundaries, bridging the gap between periodic and arbitrary-boundary settings, and providing the basis for extending key analytical and classification results of matrix product states to a much broader class of states and operators.
Canonical forms are central to the analytical understanding of tensor network states, underpinning key results such as the complete classification of one-dimensional symmetry-protected topological phases within the matrix product state (MPS) framework. Yet, the established theory applies only to uniform MPS with periodic boundary conditions, leaving many physically relevant states beyond its reach. Here we introduce a generalized canonical form for uniform MPS with a boundary matrix, thus extending the analytical MPS framework to a more general setting of wider physical significance. This canonical form reveals that any such MPS can be represented as a block-invertible matrix product operator acting on a structured class of algebraic regular language states that capture its essential long-range and scale-invariant features. Our construction builds on new algebraic results of independent interest that characterize the span and algebra generated by non-semisimple sets of matrices, including a generalized quantum Wielandt's inequality that gives an explicit upper bound on the blocking length at which the fixed-length span stabilizes to an algebra. Together, these results establish a unified theoretical foundation for uniform MPS with boundaries, bridging the gap between periodic and arbitrary-boundary settings, and providing the basis for extending key analytical and classification results of matrix product states to a much broader class of states and operators.
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power of two is known, despite significant efforts. We examine this question in the number-on-the-forehead model of multiparty communication complexity. We show that essentially all lower bounds known on randomized complexity in this model also hold for quantum communication. This includes bounds of size Omega(n/2k) for the k-party complexity of explicit functions, bounds for the generalized inner product function, and recent work on the multiparty complexity of disjointness. To the best of our knowledge, these are the first lower bounds of any kind on quantum communication in the general number-on-the-forehead model. We show this result in the following way. In the two-party case, there is a lower bound on quantum communication complexity in terms of a norm gamma2, which is known to subsume nearly all other techniques in the literature. For randomized complexity there is another natural bound in terms of a different norm mu which is also one of the strongest techniques available. A deep theorem in functional analysis, Grothendieck's inequality, implies that gamma2and mu are equivalent up to a constant factor. This connection is one of the major obstacles to showing a larger gap between randomized and quantum communication complexity in the two-party case. The lower bound technique in terms of the norm mu was recently extended to the multiparty number-on-the-forehead model. Here we show how the gamma2norm can be also extended to lower bound quantum multiparty complexity. Surprisingly, even in this general setting the two lower bounds, on quantum and classical communication, are still very closely related. This implies that separating quantum and classical communication in this setting will require the development of new techniques. The relation between these extensions of mu and gamma2is proved by a multi-dimensional version of Grothendieck's inequality.