Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk
From MaRDI portal
Publication:5210408
DOI10.1142/S0217732319503176zbMath1428.81035WikidataQ127300239 ScholiaQ127300239MaRDI QIDQ5210408
Yu-Guang Yang, Yi-Hua Zhou, Wei-Min Shi, Jing-Ru Dong, Wei-Feng Cao, Dan Li
Publication date: 23 January 2020
Published in: Modern Physics Letters A (Search for Journal in Brave)
Related Items (2)
Quantum state transfer on the complete bipartite graph ⋮ Multiparty anonymous quantum communication without multipartite entanglement
Cites Work
- Unnamed Item
- Szegedy's quantum walk with queries
- From quantum cellular automata to quantum lattice gases
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
- A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
- Spatial search and the Dirac equation
- QUANTUM STATE TRANSFER THROUGH A QUBIT NETWORK WITH ENERGY SHIFTS AND FLUCTUATIONS
- Quantum Network Communication—The Butterfly and Beyond
- Quantum Algorithms for the Triangle Problem
- Quantum Walk Algorithm for Element Distinctness
This page was built for publication: Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk