A Quantum Algorithm for Functions of Multiple Commuting Hermitian Matrices

• URL: http://arxiv.org/abs/2302.11139v1
• Date: Wed, 22 Feb 2023 04:23:05 GMT
• Title: A Quantum Algorithm for Functions of Multiple Commuting Hermitian Matrices
• Authors: Yonah Borns-Weil, Tahsin Saffat, Zachary Stier
• Abstract summary: We introduce the quantum eigenvalue transformation for functions of commuting Hermitian. We then present a framework for working with normal matrix functions in which we may solve MQET.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum signal processing allows for quantum eigenvalue transformation with Hermitian matrices, in which each eigenspace component of an input vector gets transformed according to its eigenvalue. In this work, we introduce the multivariate quantum eigenvalue transformation for functions of commuting Hermitian matrices. We then present a framework for working with polynomial matrix functions in which we may solve MQET, and give the application of computing functions of normal matrices using a quantum computer.

Related papers

• Simulating NMR Spectra with a Quantum Computer [49.1574468325115]
  This paper provides a formalization of the complete procedure of the simulation of a spin system's NMR spectrum. We also explain how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance.
  arXiv  Detail & Related papers  (2024-10-28T08:43:40Z)
• Matrix Multiplication on Quantum Computer [11.527403788898457]
  We design optimized quantum adders and multipliers based on Quantum Fourier Transform (QFT) We construct a basic universal quantum matrix multiplication and extend it to the Strassen algorithm.
  arXiv  Detail & Related papers  (2024-08-06T10:25:02Z)
• A quantum compiler design method by using linear combinations of permutations [0.0]
  We describe a method to write a given generic matrix in terms of quantum gates based on the block encoding. We first show how to convert a matrix into doubly matrices and by using Birkhoff's algorithm, we express that matrix in terms of a linear combination of permutations which can be mapped to quantum circuits.
  arXiv  Detail & Related papers  (2024-04-28T15:42:37Z)
• Polynomial-depth quantum algorithm for computing matrix determinant [46.13392585104221]
  We propose an algorithm for calculating the determinant of a square matrix, and construct a quantum circuit realizing it. Each row of the matrix is encoded as a pure state of some quantum system. The admitted matrix is therefore arbitrary up to the normalization of quantum states of those systems.
  arXiv  Detail & Related papers  (2024-01-29T23:23:27Z)
• Quantum eigenvalue processing [0.0]
  Problems in linear algebra can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary transformations on eigenvalues of block-encoded non-normal operators. We also present a Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra.
  arXiv  Detail & Related papers  (2024-01-11T19:49:31Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Transfer-matrix summation of path integrals for transport through nanostructures [62.997667081978825]
  We develop a transfer-matrix method to describe the nonequilibrium properties of interacting quantum-dot systems. The method is referred to as "transfer-matrix summation of path integrals" (TraSPI)
  arXiv  Detail & Related papers  (2022-08-16T09:13:19Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Hamiltonian singular value transformation and inverse block encoding [12.386348820609626]
  We show how to perform the quantum singular value transformation for a matrix embedded as a block of a Hamiltonian. We also show how to use the Hamiltonian quantum singular value transformation to perform inverse block encoding to implement a unitary of which a given Hamiltonian is a block.
  arXiv  Detail & Related papers  (2021-04-03T13:58:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.