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.
arXiv commentLaTeX 12pt, 26 pages, no figures; v5: major update due to referees suggestions: introduction, new references, corrections
References in corpus (26)
- Non-Abelian Anyons and Topological Quantum Computation
- Unpaired Majorana fermions in quantum wires
- Quantum Communication Through an Unmodulated Spin Chain
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Perfect state transfer in quantum spin networks
- Two-Bit Gates are Universal for Quantum Computation
- Fermionic quantum computation
- Conditional Quantum Dynamics and Logic Gates
- Quantum walks: a comprehensive review
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Classical simulation of noninteracting-fermion quantum circuits
- Conclusive and arbitrarily perfect quantum state transfer using parallel spin chain channels
- Decoherence in quantum walks - a review
- Matchgates and classical simulation of quantum circuits
- The Staggered Quantum Walk Model
- Quantum Transport Enhancement by Time-Reversal Symmetry Breaking
- Efficient classical simulation of matchgate circuits with generalized inputs and measurements
- Chiral Quantum Walks
- Dynamic probes of quantum spin chains with the Dzyaloshinskii-Moriya interaction
- Clifford algebras and universal sets of quantum gates
- Matchgate and space-bounded quantum computations are equivalent
- Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model
- Equivalence of Szegedy's and Coined Quantum Walks
- Time Independent Universal Computing with Spin Chains: Quantum Plinko Machine
- Permanents, Bosons and Linear Optics