Quantum algorithm for classical multidimensional scaling
From MaRDI portal
Cites work
- An efficient design of reversible multi-bit quantum comparator via only a single ancillary bit
- Black-box Hamiltonian simulation and unitary implementation
- Efficient quantum algorithms for simulating sparse Hamiltonians
- scientific article; zbMATH DE number 845841 (Why is no real title available?)
- Limitations on the simulation of non-sparse Hamiltonians
- Quantum algorithm design: techniques and applications
- Quantum algorithm for \(k\)-nearest neighbors classification based on the metric of Hamming distance
- Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method
- Quantum data compression by principal component analysis
- Quantum dimensionality reduction by linear discriminant analysis
- Quantum discriminant analysis for dimensionality reduction and classification
- Quantum fast Poisson solver: the algorithm and complete and modular circuit design
- Quantum locally linear embedding for nonlinear dimensionality reduction
- Quantum random access memory
- Quantum recommendation systems
- Quantum Relief algorithm
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- Universal Quantum Simulators
This page was built for publication: Quantum algorithm for classical multidimensional scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584132)
