Secure delegated quantum algorithms for solving Mahalanobis distance

DOI10.1016/J.PHYSA.2023.129025OpenAlexW4383315541MaRDI QIDQ6167727FDOQ6167727

Authors:

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

• Title not available (Why is that?)
• Universal Blind Quantum Computation
• The Solovay--Kitaev algorithm
• Learning a Mahalanobis distance metric for data clustering and classification
• Symmetric quantum fully homomorphic encryption with perfect security
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• Quantum fully homomorphic encryption scheme based on universal quantum circuit
• Quantum fully homomorphic encryption with verification
• Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
• Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
• Multiparty blind quantum computation protocol with deterministic mutual identity authentication
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167727)