EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Generalized Quantum Signal Processing

Danial Motlagh, Nathan Wiebe

PRX Quantum · 28.06.2024 · 5 (2)

DOI: 10.1103/prxquantum.5.020368 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PRX Quantum, online erschienen am 28.06.2024. Verfasst von Danial Motlagh und 1 weiteren Autor:innen. Die Arbeit wurde bisher 82-mal zitiert (Crossref) und nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Co-design Center for Quantum Advantage.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that | P | ≤ 1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 10 7 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O ( ( 1 / δ ) + log  ( 1 / ϵ ) ) queries to perform where O ( 1 / δ ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O ( d log  N + log 2  N ) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024

Förderung

  • U.S. Department of Energy
  • Office of Science
  • National Quantum Information Science Research Centers, Co-design Center for Quantum Advantage

Zitieren

APA

Motlagh, D., & Wiebe, N. (2024). Generalized Quantum Signal Processing. PRX Quantum, 5(2). https://doi.org/10.1103/prxquantum.5.020368

Vancouver

Motlagh D, Wiebe N. Generalized Quantum Signal Processing. PRX Quantum. 2024;5(2). doi:10.1103/prxquantum.5.020368

BibTeX
@article{Motlagh2024,
  author = {Motlagh, Danial and Wiebe, Nathan},
  title = {Generalized Quantum Signal Processing},
  journal = {PRX Quantum},
  year = {2024},
  volume = {5},
  number = {2},
  doi = {10.1103/prxquantum.5.020368}
}
Kostenlos starten →