Quantum walk state transfer on a hypercube
arXiv:2302.07581 · doi:10.1088/1402-4896/acf3a2
Abstract
We investigate state transfer on a hypercube by means of a quantum walk where the sender and the receiver vertices are marked by a weighted loops. First, we analyze search for a single marked vertex, which can be used for state transfer between arbitrary vertices by switching the weighted loop from the sender to the receiver after one run-time. Next, state transfer between antipodal vertices is considered. We show that one can tune the weight of the loop to achieve state transfer with high fidelity in shorter run-time in comparison to the state transfer with a switch. Finally, we investigate state transfer between vertices of arbitrary distance. It is shown that when the distance between the sender and the receiver is at least 2, the results derived for the antipodes are well applicable. If the sender and the receiver are direct neighbours the evolution follows a slightly different course. Nevertheless, state transfer with high fidelity is achieved in the same run-time.
References in corpus (38)
- Quantum Communication Through an Unmodulated Spin Chain
- Quantum Computation and Decision Trees
- Perfect state transfer in quantum spin networks
- A Quantum Random Walk Search Algorithm
- Spatial search by quantum walk
- From quantum cellular automata to quantum lattice gases
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Quantum Communication through Spin Chain Dynamics: an Introductory Overview
- A Review of Perfect State Transfer and its Application as a Constructive Tool
- Quantum walks on a programmable two-dimensional 62-qubit superconducting processor
- Coherent Quantum Transport in Photonic Lattices
- Perfect quantum state transfer in a superconducting qubit chain with parametrically tunable couplings
- Spatial search by quantum walk is optimal for almost all graphs
- Experimental Perfect Quantum State Transfer
- Spatial search and the Dirac equation
- High efficiency transfer of quantum information and multi-particle entanglement generation in translation invariant quantum chains
- Perfect state transfer in long-range interacting spin chains
- Optimized quantum random-walk search algorithms
- Experimental Quantum Fast Hitting on Hexagonal Graphs
- Grover Search with Lackadaisical Quantum Walks
- Perfect state transfer and efficient quantum routing: a discrete-time quantum walk approach
- Discrete Time Quantum Walk Approach to State Transfer
- Perfect state transfer in networks of arbitrary topology and coupling configuration
- Quantum searches on highly symmetric graphs
- Perfect state transfer on distance-regular graphs and association schemes
- Quadratic speedup for spatial search by continuous-time quantum walk
- Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
- Faster Search by Lackadaisical Quantum Walk
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
- Quantum Walks with Dynamical Control: Graph Engineering, Initial State Preparation and State Transfer
- Qubit state transfer via discrete-time quantum walks
- Quantum search algorithms on the hypercube
- Search by Lackadaisical Quantum Walk with Nonhomogeneous Weights
- Search on Vertex-Transitive Graphs by Lackadaisical Quantum Walk
- Analysis of Lackadaisical Quantum Walks
- Analysis and minimization of bending losses in discrete quantum networks
- Quantum walk based state transfer algorithms on the complete M-partite graph
- Selective dynamical decoupling for quantum state transfer