Finite automata for caching in matrix product algorithms
| dc.creator | Crosswhite, Gregory M. | |
| dc.creator | Bacon, Dave | |
| dc.date | 2007-08-09 | |
| dc.date | 2008-07-07 | |
| dc.date.accessioned | 2026-07-07T09:56:46Z | |
| dc.date.available | 2026-07-07T09:56:46Z | |
| dc.description | A diagram is introduced for visualizing matrix product states which makes transparent a connection between matrix product factorizations of states and operators, and complex weighted finite state automata. It is then shown how one can proceed in the opposite direction: writing an automaton that ``generates'' an operator gives one an immediate matrix product factorization of it. Matrix product factorizations have the advantage of reducing the cost of computing expectation values by facilitating caching of intermediate calculations. Thus our connection to complex weighted finite state automata yields insight into what allows for efficient caching in matrix product algorithms. Finally, these techniques are generalized to the case of multiple dimensions. | |
| dc.description | 18 pages, 19 figures, LaTeX; numerous improvements have been made to the manuscript in response to referee feedback | |
| dc.identifier | https://arxiv.org/abs/0708.1221 | |
| dc.identifier | http://arxiv.org/abs/0708.1221 | |
| dc.identifier | Phys. Rev. A 78, 012356 (2008) | |
| dc.identifier | doi:10.1103/PhysRevA.78.012356 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/167093 | |
| dc.subject | Quantum Physics | |
| dc.title | Finite automata for caching in matrix product algorithms | |
| dc.type | text |