scientific article; zbMATH DE number 1756014
From MaRDI portal
Publication:4535800
zbMATH Open0987.68041arXivquant-ph/0102078MaRDI QIDQ4535800FDOQ4535800
Authors: Peter Høyer, Jan Neerbek, Yaoyun Shi 
Publication date: 25 June 2002
Full work available at URL: https://arxiv.org/abs/quant-ph/0102078
Title of this publication is not available (Why is that?)
Recommendations
- Quantum complexities of ordered searching, sorting, and element distinctness
- Quantum search of partially ordered sets
- A lower bound for quantum search of an ordered list
- Quantum time-space tradeoffs for sorting
- Quantum complexity of permutations
- Quantum Algorithms for Element Distinctness
- Approximation of a quantum algorithm for order finding
- Quantum queries on permutations
- On exact quantum query complexity
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Quantum computation (81P68)
Cited In (15)
- A lower bound for quantum search of an ordered list
- Quantum search of partially ordered sets
- Public key compression for constrained linear signature schemes
- Graph entropy and quantum sorting problems
- Quantum binary search algorithm
- A fast natural algorithm for searching
- Optimal Quantum Adversary Lower Bounds for Ordered Search
- Quantum complexities of ordered searching, sorting, and element distinctness
- A lower bound on the quantum query complexity of read-once functions
- Quantum switching and quantum merge sorting
- Quantum lower bounds by quantum arguments
- Quantum time-space tradeoffs for sorting
- Probabilistic comparing and sorting non-orthogonal quantum states
- Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems
- Quantum Algorithms for Element Distinctness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535800)
