REVIEW 1 cited by
Matrix Product Representation of Locality Preserving Unitaries
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The matrix product representation provides a useful formalism to study not only entangled states, but also entangled operators in one dimension. In this paper, we focus on unitary transformations and show that matrix product operators that are unitary provides a necessary and sufficient representation of 1D unitaries that preserve locality. That is, we show that matrix product operators that are unitary are guaranteed to preserve locality by mapping local operators to local operators while at the same time all locality preserving unitaries can be represented in a matrix product way. Moreover, we show that the matrix product representation gives a straight-forward way to extract the GNVW index defined in Ref.\cite{Gross2012} for classifying 1D locality preserving unitaries. The key to our discussion is a set of `fixed point' conditions which characterize the form of the matrix product unitary operators after blocking sites. Finally, we show that if the unitary condition is relaxed and only required for certain system sizes, the matrix product operator formalism allows more possibilities than locality preserving unitaries. In particular, we give an example of a simple matrix product operator which is unitary only for odd system sizes, does not preserve locality and carries a `fractional' index as compared to their locality preserving counterparts.
Forward citations
Cited by 1 Pith paper
-
Causal Decompositions of 1D Quantum Cellular Automata
For N > 4r, every 1D quantum cellular automaton of causality radius r is exactly a routed unitary circuit of nearest-neighbour interactions, and translation-invariant automata get translation-invariant circuits.
Discussion (0). Sign in to comment.