Quick Navigation
Topics
Quantum Simulation
Matrix product states for anyonic systems and efficient simulation of dynamics
arXiv
Authors: Sukhwinder Singh, Robert N. C. Pfeifer, Guifre Vidal, Gavin K. Brennen
Year
2013
Paper ID
32083
Status
Preprint
Abstract Read
~2 min
Abstract Words
212
Citations
N/A
Abstract
Matrix product states (MPS) have proven to be a very successful tool to study lattice systems with local degrees of freedom such as spins or bosons. Topologically ordered systems can support anyonic particles which are labeled by conserved topological charges and collectively carry non-local degrees of freedom. In this paper we extend the formalism of MPS to lattice systems of anyons. The anyonic MPS is constructed from tensors that explicitly conserve topological charge. We describe how to adapt the time-evolving block decimation (TEBD) algorithm to the anyonic MPS in order to simulate dynamics under a local and charge-conserving Hamiltonian. To demonstrate the effectiveness of anyonic TEBD algorithm, we used it to simulate (i) the ground state (using imaginary time evolution) of an infinite 1D critical system of (a) Ising anyons and (b) Fibonacci anyons both of which are well studied, and (ii) the real time dynamics of an anyonic Hubbard-like model of a single Ising anyon hopping on a ladder geometry with an anyonic flux threading each island of the ladder. Our results pertaining to (ii) give insight into the transport properties of anyons. The anyonic MPS formalism can be readily adapted to study systems with conserved symmetry charges, as this is equivalent to a specialization of the more general anyonic case.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2013 reference point for readers tracking recent quantum research.
- Matrix product states (MPS) have proven to be a very successful tool to study lattice systems with local degrees of freedom such as spins or bosons.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.