Secure delegated quantum algorithms for solving Mahalanobis distance

Distance metric is an important subroutine of some artificial intelligence algorithms such as classification and clustering algorithms. However, when a distance metric such as Mahalanobis distance is needed to calculate the distance between two points, the time required for classical algorithms to d...

Full description

Saved in:

Bibliographic Details
Published in:	Physica A Vol. 625; p. 129025
Main Authors:	Ouyang, Jiandong, Wang, Yuxun, Li, Qin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01-09-2023
Subjects:	Delegated quantum computation Mahalanobis distance metric Quantum algorithm Quantum communication Quantum cryptography Quantum homomorphic encryption Quantum homomorphic encryption Quantum algorithm Delegated quantum computation Mahalanobis distance metric Quantum cryptography Quantum communication
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Distance metric is an important subroutine of some artificial intelligence algorithms such as classification and clustering algorithms. However, when a distance metric such as Mahalanobis distance is needed to calculate the distance between two points, the time required for classical algorithms to deal with Mahalanobis distance grows exponentially with the size of dataset and the dimensionality of the data. In this paper, a quantum algorithm for solving Mahalanobis distance (QAMD) is proposed. It can achieve an exponential speedup over the best classical counterpart if the covariance matrix in the sample distribution is a sparse Hermitian matrix. Especially, we propose a secure delegated QAMD protocol by combining the presented QAMD and quantum homomorphic encryption (QHE) which allows users with limited quantum capability to solve Mahalanobis distance with the help of a remote quantum server and still keep their data private. We also simulate a special case of the proposed delegated QAMD protocol on IBM’s quantum cloud platform to show its feasibility. •The quantum algorithm for solving Mahalanobis distance (QAMD) is proposed.•A delegated QAMD is proposed to be suitable for quantum cloud environments.•Quantum homomorphic encryption is used to ensure the security of delegated QAMD.•The delegated QAMD is simulated on a quantum cloud platform to verify its feasibility.
ISSN:	0378-4371 1873-2119
DOI:	10.1016/j.physa.2023.129025