Entangling and disentangling in Grover's search algorithm
From MaRDI portal
Publication:2415324
DOI10.1016/j.tcs.2018.10.001zbMath1421.68053OpenAlexW2895829183WikidataQ62344336 ScholiaQ62344336MaRDI QIDQ2415324
Minghua Pan, Jozef Gruska, Dao Wen Qiu, Paulo Mateus
Publication date: 21 May 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.001
Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
Performance of Grover's search algorithm with diagonalizable collective noises ⋮ Probability and entanglement evolutions for Szegedy's quantum search on the one-dimensional cycle with self-loops ⋮ Tsallis relative α entropy of coherence dynamics in Grover′s search algorithm
Cites Work
- Unnamed Item
- Global versus local quantum correlations in the Grover search algorithm
- Grover's algorithm and the secant varieties
- The quadratic speedup in Grover's search algorithm from the entanglement perspective
- Entanglement in the Grover search algorithm
- Global multipartite entanglement dynamics in Grover's search algorithm
- Multipartite entanglement in Grover's search algorithm
- Entanglement in a QFT model of neutrino oscillations
- Quantifying entanglement resources
- Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure
- Correlations in the Grover search
- On the role of entanglement in quantum-computational speed-up
- Characterizing entanglement
- Entangling and Disentangling Power of Unitary Transformations Are Not Equal
- Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps
This page was built for publication: Entangling and disentangling in Grover's search algorithm
