A panoply of quantum algorithms
From MaRDI portal
Recommendations
Cited in
(48)- Nested quantum search and NP-hard problems
- A review on quantum search algorithms
- Quantum algorithm design: techniques and applications
- Quantum algorithms for weighing matrices and quadratic residues
- Intricacies of quantum computational paths
- Quantum binary search algorithm
- Quantum algorithm for dynamic programming approach for DAGs. Applications for Zhegalkin polynomial evaluation and some problems on DAGs
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- An \(R||C_{\max}\) quantum scheduling algorithm
- Is Grover's algorithm a quantum hidden subgroup algorithm?
- Quantum and classical tradeoffs
- An investigation on support vector clustering for big data in quantum paradigm
- Quantum abstract detecting systems
- Quantum search of spatial regions
- Quantum search with advice
- Quantum search of partially ordered sets
- Rapid sampling though quantum computing
- An upper bound on the rate of information transfer by Grover's oracle
- Simulation and the exact complexity of Grover's search algorithm
- Quantum algorithms a decade after Shor
- Exponential algorithmic speedup by a quantum walk
- Tradeoff in quantum amplitude amplification techniques
- Knotoids
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2020426 (Why is no real title available?)
- scientific article; zbMATH DE number 2038718 (Why is no real title available?)
- TOOLS FOR QUANTUM ALGORITHMS
- scientific article; zbMATH DE number 1796834 (Why is no real title available?)
- scientific article; zbMATH DE number 1796991 (Why is no real title available?)
- scientific article; zbMATH DE number 1834640 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- On quantum computation of statistical mean using Grover's algorithm
- Quantum pattern matching fast on average
- Quantum speedups for exponential-time dynamic programming algorithms
- An Introduction to Quantum Algorithms: A Physicist’s Perspective
- Topological structure of quantum algorithms
- A formulation of a matrix sparsity approach for the quantum ordered search algorithm
- Continuous-time quantum algorithms for unstructured problems
- Quantum algorithms
- Complexity of Grover's algorithm: an algebraic approach
- An Upper Bound on the Rate of Information Transfer by Grover’s Oracle
- Quantum algorithms for computational geometry problems
- Hypercube quantum search: exact computation of the probability of success in polynomial time
- Quantum algorithm for dynamic programming approach for DAGs and applications
- A practitioner’s guide to quantum algorithms for optimisation problems
- Pattern classifications using Grover's and Ventura's algorithms in a two-qubits system
- Quantum speedups for polynomial-time dynamic programming algorithms
- The 50\% advanced information rule of the quantum algorithms
This page was built for publication: A panoply of quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602397)
