Quantum-classical distance as a tool to design optimal chiral quantum walk
arXiv:2106.11685 · doi:10.1103/PhysRevA.105.032425
Abstract
Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian generator of CTQWs, which are the complex phases along the loops of the underlying graph, was acknowledged for its interest in optimizing or suppressing transport on specific topologies. We argue that the quantum-classical distance, a figure of merit which was introduced to capture the difference in dynamics between a CTQW and its classical, stochastic counterpart, guides the optimization of parameters of the Hamiltonian to achieve better quantum transport on cycle graphs and spatial search to the quantum speed limit without an oracle on complete graphs, the latter also implying fast uniform mixing. We compare the variations of this quantity with the 1-norm of coherence and the Inverse Participation Ratio, showing that the quantum-classical distance is linked to both, but in a topology-dependent relation, which is key to spot the most interesting quantum evolution in each case.
arXiv comment16 pages, 11 figures
References in corpus (28)
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- Universal computation by quantum walk
- Spatial search by quantum walk
- Quantum speed limits: from Heisenberg's uncertainty principle to optimal quantum control
- An example of the difference between quantum and classical random walks
- Quantum limits to dynamical evolution
- Noise-assisted energy transfer in quantum networks and light-harvesting complexes
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Spatial search by quantum walk is optimal for almost all graphs
- Quantum Transport Enhancement by Time-Reversal Symmetry Breaking
- Laplacian versus Adjacency Matrix in Quantum Walk Search
- Chiral Quantum Walks
- Exact analytical results for quantum walks on star graph
- Spatial search by continuous-time quantum walks on crystal lattices
- On the optimality of spatial search by continuous-time quantum walk
- Generalized quantum-classical correspondence for random walks on graphs
- The Grover search as a naturally occurring phenomenon
- Universality at Breakdown of Quantum Transport on Complex Networks
- Quantum state transfer via Bloch oscillations
- The quantum speed limit
- Quantum-classical dynamical distance and quantumness of quantum walks
- Transport efficiency of continuous-time quantum walks on graphs
- Quantum Walk Search with Time-Reversal Symmetry Breaking
- Scattering as a quantum metrology problem: a quantum walk approach
- Topological classification of time-asymmetry in unitary quantum processes
- Which-way interference within biomimetic unit-cells for efficient energy transfer
Cited by in corpus (11)
- Complex Quantum Networks: a Topical Review
- Quantum routing of information using chiral quantum walks
- Feedback-assisted quantum search by continuous-time quantum walks
- Swift chiral quantum walks
- Enhanced quantum transport in chiral quantum walks
- Scalable Structure For Chiral Quantum Routing
- Optimal quantum transport on a ring via locally monitored chiral quantum walks
- Decoherence and classicalization of continuous-time quantum walks on graphs
- Temporal nonclassicality in continuous-time quantum walks
- Perturbed graphs achieve unit transport efficiency without environmental noise
- Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems