Noise effects in the quantum search algorithm from the viewpoint of computational complexity
From MaRDI portal
Publication:5403382
DOI10.2478/v10006-012-0037-2zbMath1285.81012arXiv1108.1915OpenAlexW2079714474WikidataQ62582396 ScholiaQ62582396MaRDI QIDQ5403382
Ryszard Winiarczyk, Piotr Gawron, Jerzy Klamka
Publication date: 26 March 2014
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.1915
Searching and sorting (68P10) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (10)
Search via quantum walks with intermediate measurements ⋮ Noisy Effect on Nonlinear Quantum Search Algorithm ⋮ Parametric quantum search algorithm as quantum walk: a quantum simulation ⋮ Performance of Grover's search algorithm with diagonalizable collective noises ⋮ Qubit flip game on a Heisenberg spin chain ⋮ Performance analysis of the hardware-efficient quantum search algorithm ⋮ Characterizing error propagation in quantum circuits: the isotropic index ⋮ A classical limit of Grover’s algorithm induced by dephasing: Coherence versus entanglement ⋮ A MODEL FOR QUANTUM QUEUE ⋮ An efficient algorithm for estimating the parameters of superimposed exponential signals in multiplicative and additive noise
Cites Work
This page was built for publication: Noise effects in the quantum search algorithm from the viewpoint of computational complexity
