Efficient quantum algorithm for similarity measures for molecules
From MaRDI portal
Recommendations
- Quantum algorithms for similarity measurement based on Euclidean distance
- Similarity analysis between quantum images
- Efficient quantum algorithms for state measurement and linear algebra applications
- Multiple network alignment on quantum computers
- Quantum algorithm design: techniques and applications
Cites work
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Adiabatic quantum state generation and statistical zero knowledge
- Closest Unitary, Orthogonal and Hermitian Operators to a Given Operator
- Multiple network alignment on quantum computers
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum computation and quantum information. 10th anniversary edition
Cited in
(4)- Quantum algorithms for similarity measurement based on Euclidean distance
- On quantum molecular similarity measures (QMSM) and indices (QMSI)
- Multiple network alignment on quantum computers
- Quantum molecular similarity measures (QMSM) as a natural way leading towards a theoretical foundation of quantitative structure-properties relationships (QSPR)
This page was built for publication: Efficient quantum algorithm for similarity measures for molecules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740916)
