scientific article; zbMATH DE number 1756014

MaRDI QIDQ4535800zbMATH OpenFDO

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

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

Cited in

(16)

• Probabilistic comparing and sorting non-orthogonal quantum states
• A lower bound for quantum search of an ordered list
• Public key compression for constrained linear signature schemes
• Quantum complexities of ordered searching, sorting, and element distinctness
• A lower bound on the quantum query complexity of read-once functions
• Quantum binary search algorithm
• Quantum search of partially ordered sets
• Optimal Quantum Adversary Lower Bounds for Ordered Search
• Graph entropy and quantum sorting problems
• Quantum time-space tradeoffs for sorting
• Quantum switching and quantum merge sorting
• Quantum Algorithms for Element Distinctness
• Quantum lower bounds by quantum arguments
• A fast natural algorithm for searching
• Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems
• Quantum combine and conquer and its applications to sublinear quantum convex hull and maxima set construction

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)