Grover’s search with local and total depolarizing channel errors: Complexity analysis

DOI10.1142/S021974991650009XzbMath1344.81060arXiv1508.03302OpenAlexW3104874857MaRDI QIDQ3188777

Jesús García López de Lacalle, Efrain Buksman, Ilan Cohn, André L. Fonseca de Oliveira

Publication date: 12 August 2016

Published in: International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

quantum algorithmsquantum noisealgorithm complexityGrover's search

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Channel models (including quantum) in information and communication theory (94A40) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (4)

Unnamed Item ⋮ Noisy Effect on Nonlinear Quantum Search Algorithm ⋮ Performance of Grover's search algorithm with diagonalizable collective noises ⋮ Characterizing error propagation in quantum circuits: the isotropic index

Cites Work

• Unnamed Item
• Unnamed Item
• Impossibility of a Quantum Speed-Up with a Faulty Oracle

This page was built for publication: Grover’s search with local and total depolarizing channel errors: Complexity analysis