Performance of Grover's search algorithm with diagonalizable collective noises
From MaRDI portal
Publication:6098311
DOI10.1007/s11128-023-03994-3arXiv2111.12219OpenAlexW4379793143MaRDI QIDQ6098311
Taiping Xiong, Shenggen Zheng, Minghua Pan
Publication date: 13 June 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.12219
Cites Work
- Unnamed Item
- Unnamed Item
- Computational complexity and applications of quantum algorithm
- The quadratic speedup in Grover's search algorithm from the entanglement perspective
- Dynamic Grover search: applications in recommendation systems and optimization problems
- Global multipartite entanglement dynamics in Grover's search algorithm
- Complexity measures and decision tree complexity: a survey.
- Phase matching in quantum searching.
- Quantum search degeneration under amplitude noise in queries to the oracle
- Revisiting Deutsch-Jozsa algorithm
- Entangling and disentangling in Grover's search algorithm
- Quantum generative adversarial network for generating discrete distribution
- Grover’s search with local and total depolarizing channel errors: Complexity analysis
- Correlations in the Grover search
- Rapid solution of problems by quantum computation
- Noise effects in the quantum search algorithm from the viewpoint of computational complexity
This page was built for publication: Performance of Grover's search algorithm with diagonalizable collective noises
