The quadratic speedup in Grover's search algorithm from the entanglement perspective

DOI10.1016/j.physleta.2009.05.064zbMath1231.81019arXiv0707.1410OpenAlexW2068825817MaRDI QIDQ663021

Pranaw Rungta

Publication date: 13 February 2012

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.1410

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40)

Related Items (6)

Entangling and disentangling in Grover's search algorithm ⋮ Quantum search algorithm for set operation ⋮ Performance of Grover's search algorithm with diagonalizable collective noises ⋮ Tsallis relative α entropy of coherence dynamics in Grover′s search algorithm ⋮ Global multipartite entanglement dynamics in Grover's search algorithm ⋮ Quantum image morphology processing based on quantum set operation

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum algorithms: entanglement–enhanced information processing
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Strengths and Weaknesses of Quantum Computing
• On the role of entanglement in quantum-computational speed-up
• Quantum complexity theory

This page was built for publication: The quadratic speedup in Grover's search algorithm from the entanglement perspective