Probability and entanglement evolutions for Szegedy's quantum search on the one-dimensional cycle with self-loops
From MaRDI portal
Publication:2687084
DOI10.1007/s11128-021-02994-5OpenAlexW3128046251MaRDI QIDQ2687084
Mengke Xu, Sihao Zheng, Zhi-hao Liu, Han Wu Chen
Publication date: 1 March 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-021-02994-5
Cites Work
- Unnamed Item
- Entanglement in the Grover search algorithm
- Exceptional quantum walk search on the cycle
- Global multipartite entanglement dynamics in Grover's search algorithm
- Equivalence of Szegedy's and coined quantum walks
- Faster search by lackadaisical quantum walk
- Quantum ergodicity on regular graphs
- Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces
- Entangling and disentangling in Grover's search algorithm
- Decoherence in quantum Markov chains
- QUANTUM HITTING TIME ON THE COMPLETE GRAPH
- Grover search with lackadaisical quantum walks
- One-dimensional lackadaisical quantum walks
- On the role of entanglement in quantum-computational speed-up
- Inequalities: theory of majorization and its applications
This page was built for publication: Probability and entanglement evolutions for Szegedy's quantum search on the one-dimensional cycle with self-loops