An efficient quantum algorithm for spectral estimation release_r2g2dyupfbcsdadplumfm7q2he

by A. Steffens, P. Rebentrost, I. Marvian, J. Eisert, S. Lloyd

Released as a article .

2016  

Abstract

We develop an efficient quantum implementation of an important signal processing algorithm for line spectral estimation: the matrix pencil method, which determines the frequencies and damping factors of signals consisting of finite sums of exponentially damped sinusoids. Our algorithm provides a quantum speedup in a natural regime where the sampling rate is much higher than the number of sinusoid components. Along the way, we develop techniques that are expected to be useful for other quantum algorithms as well - consecutive phase estimations to efficiently make products of asymmetric low rank matrices classically accessible and an alternative method to efficiently exponentiate non-Hermitian matrices. Our algorithm features an efficient quantum-classical division of labor: The time-critical steps are implemented in quantum superposition, while an interjacent step, requiring only exponentially few parameters, can operate classically. We show that frequencies and damping factors can be obtained in time logarithmic in the number of sampling points, exponentially faster than known classical algorithms.
In text/plain format

Archived Files and Locations

application/pdf  217.4 kB
file_ihfz5vedvjb4lnsnlogszdm2dy
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-09-26
Version   v1
Language   en ?
arXiv  1609.08170v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 75d19403-8cde-4ca8-8c84-15a1f58ea632
API URL: JSON