Patrick Rebentrost

Patrick Rebentrost

Auto-generated profile, based on publicly available information

Patrick Rebentrost

Research Laboratory of Electronics Massachusetts Institute of Technology 02139 Cambridge MA

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 September 2014 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
PRPatrick Rebentrost
Patrick Rebentrost
MMMasoud Mohseni
Masoud Mohseni
SLSeth Lloyd
Seth Lloyd
Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized binary classifier, can be implemented on a quantum computer, with complexity logarithmic in the size of the vectors and the number of training examples. In cases where classical sampling algorithms require polynomial time, an exponential speedup is obtained. At the core of this quantum big data algorithm is a nonsparse matrix exponentiation technique for efficiently performing a matrix inversion of the training data inner-product (kernel) matrix.

10 July 2014 in arXiv
Verified
Preprint
Open access
PDF file
PRPatrick Rebentrost
Patrick Rebentrost
MMMasoud Mohseni
Masoud Mohseni
SLSeth Lloyd
Seth Lloyd
Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized binary classifier, can be implemented on a quantum computer, with complexity logarithmic in the size of the vectors and the number of training examples. In cases when classical sampling algorithms require polynomial time, an exponential speed-up is obtained. At the core of this quantum big data algorithm is a non-sparse matrix exponentiation technique for efficiently performing a matrix inversion of the training data inner-product (kernel) matrix.

19 July 2016 in arXiv
Verified
Preprint
Open access
PDF file
PRPatrick Rebentrost
Patrick Rebentrost
ASAdrian Steffens
Adrian Steffens
SLSeth Lloyd
Seth Lloyd
In this work, we present a method to exponentiate non-sparse indefinite low-rank matrices on a quantum computer. Given an operation for accessing the elements of the matrix, our method allows singular values and associated singular vectors to be found quantum mechanically in a time exponentially faster in the dimension of the matrix than known classical algorithms. The method extends to non-Hermitian and non-square matrices via embedding matrices. In the context of the generic singular value decomposition of a matrix, we discuss the Procrustes problem of finding a closest isometry to a given matrix.