Effective simulation of state distribution in qubit chains
arXiv:1708.07439 · doi:10.1007/s11128-018-2036-1
Abstract
This work recollects a non-universal set of quantum gates described by higher-dimensional Spin groups. They are also directly related with matchgates in theory of quantum computations and complexity. Various processes of quantum state distribution along a chain such as perfect state transfer and different types of quantum walks can be effectively modeled on classical computer using such approach.
LaTeX 12pt, 26 pages, no figures; v5: major update due to referees suggestions: introduction, new references, corrections
References in corpus (7)
- Non-Abelian Anyons and Topological Quantum Computation
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Decoherence in quantum walks - a review
- Matchgates and classical simulation of quantum circuits
- Efficient classical simulation of matchgate circuits with generalized inputs and measurements
- Dynamic probes of quantum spin chains with the Dzyaloshinskii-Moriya interaction
- Equivalence of Szegedy's and Coined Quantum Walks