2013
DOI: 10.1088/1751-8113/46/47/475301
|View full text |Cite
|
Sign up to set email alerts
|

Tensor network methods for invariant theory

Abstract: Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical approach provides an alternative to the polynomial equations that describe invariants, which often contain a large number of terms with coefficients raised to high powers. This approach also enables one to use known methods from tensor network theory (such as the matrix produ… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
30
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 30 publications
(34 citation statements)
references
References 36 publications
(108 reference statements)
1
30
0
Order By: Relevance
“…In particular, the perfect tensor network provides an interesting illustration of how the Ryu-Takayanagi formula of holographic entanglement entropy (HEE) 12 emerges from a many body quantum system. It is also proposed by Biamonte et al that a tensor network can be used in the study of polynomial invariants of a quantum state [22].…”
Section: Introductionmentioning
confidence: 99%
“…In particular, the perfect tensor network provides an interesting illustration of how the Ryu-Takayanagi formula of holographic entanglement entropy (HEE) 12 emerges from a many body quantum system. It is also proposed by Biamonte et al that a tensor network can be used in the study of polynomial invariants of a quantum state [22].…”
Section: Introductionmentioning
confidence: 99%
“…t k [13] |t k := |0 + i k |1 lifts to a unitary operator where the Clifford gate S is recovered for k = 1-thereby establishing (iv). For k = 2 we recover the standard Pauli Z matrix, then HZH = X and SXS 3 = Y .…”
Section: Stabilizer Tensor Networkmentioning
confidence: 72%
“…[(a) associativity; (b) gate unit laws; (c) symmetry; (e) copy laws; (f) unit scalar given as a blank on the page.] of condensed matter theory and quantum computation-by myself with several colleagues (11)(12)(13). We adapted these tools and discovered efficient tensor network descriptions of finite Abelian lattice gauge theories (14).…”
mentioning
confidence: 99%
“…A theorem by Hilbert states that, for a compact group G acting in a unitary fashion on a finite dimensional vector space, there exists a finite number of independent invariants (which are polynomial in the coordinates of |ψ ) that are able to distinguish whether two vectors belong to the same orbit of G [21][22][23]. A convenient way to write down the invariants involves using tensor diagrams [24] -they make it explicit why certain polynomials are invariant and allow us to avoid multiple index contractions. Thus, the LU-equivalence problem can be solved completely once the minimal set of independent polynomial invariants is known.…”
Section: Formulation Of the Problemmentioning
confidence: 99%