Secure delegated quantum algorithms for solving Mahalanobis distance

DOI10.1016/j.physa.2023.129025OpenAlexW4383315541MaRDI QIDQ6167727

No author found.

Publication date: 7 August 2023

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2023.129025

zbMATH Keywords

quantum algorithmquantum communicationquantum cryptographydelegated quantum computationquantum homomorphic encryptionMahalanobis distance metric

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric quantum fully homomorphic encryption with perfect security
• Quantum fully homomorphic encryption scheme based on universal quantum circuit
• Learning a Mahalanobis distance metric for data clustering and classification
• Multiparty blind quantum computation protocol with deterministic mutual identity authentication
• Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
• Quantum fully homomorphic encryption with verification
• Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
• Improved multiparty quantum private comparison based on quantum homomorphic encryption
• Quantum \(k\)-fold cross-validation for nearest neighbor classification algorithm
• An improved quantum algorithm for data fitting
• Quantum Homomorphic Encryption for Polynomial-Sized Circuits
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• Universal Blind Quantum Computation

This page was built for publication: Secure delegated quantum algorithms for solving Mahalanobis distance