Dimerized Decomposition of Quantum Evolution on an Arbitrary Graph
arXiv:1701.03311 · doi:10.1007/s11128-019-2532-y
Abstract
The study of quantum evolution on graphs for diversified topologies is beneficial to modeling various realistic systems. A systematic method, the dimerized decomposition, is proposed to analyze the dynamics on an arbitrary network. By introducing global "flows" among interlinked dimerized subsystems, each of which locally consists of an input and a output port, the method provides an intuitive picture that the local properties of the subsystem are separated from the global structure of the network. The pictorial interpretation of quantum evolution as multiple flows through the graph allows for the analysis of the complex network dynamics supplementary to the conventional spectral method.
References in corpus (18)
- Quantum Communication Through an Unmodulated Spin Chain
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- Universal computation by quantum walk
- Spatial search by quantum walk
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Coupling strength estimation for spin chains despite restricted access
- Survival Probabilities in Coherent Exciton Transfer with Trapping
- Efficient Quantum Walk on a Quantum Processor
- Global Symmetry is Unnecessary for Fast Quantum Search
- Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
- Connectivity is a Poor Indicator of Fast Quantum Search
- Evolution-free Hamiltonian parameter estimation through Zeeman markers
- Quantum search on graphene lattices
- Microwave Experiments Simulating Quantum Search and Directed Transport in Artificial Graphene
- Diagrammatic Approach to Quantum Search
- Equivalent Resistance from the Quantum to the Classical Transport Limit