Recursive Quantum Eigenvalue/Singular-Value Transformation: Analytic Construction of Matrix Sign Function by Newton Iteration

• URL: http://arxiv.org/abs/2304.13330v1
• Date: Wed, 26 Apr 2023 07:02:01 GMT
• Title: Recursive Quantum Eigenvalue/Singular-Value Transformation: Analytic Construction of Matrix Sign Function by Newton Iteration
• Authors: Kaoru Mizuta and Keisuke Fujii
• Abstract summary: We show that an analytically-obtained parameter set composed of only $8$ different values is sufficient for executing QET of the matrix sign function with an arbitrarily small error. Our protocol will serve as an alternative protocol for constructing QET or QSVT for some useful matrix functions without numerical instability.
• Score: 0.8206877486958002
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum eigenvalue transformation (QET) and its generalization, quantum singular value transformation (QSVT), are versatile quantum algorithms that allow us to apply broad matrix functions to quantum states, which cover many of significant quantum algorithms such as Hamiltonian simulation. However, finding a parameter set which realizes preferable matrix functions in these techniques is difficult for large-scale quantum systems: there is no analytical result other than trivial cases as far as we know and we often suffer also from numerical instability. We propose recursive QET or QSVT (r-QET or r-QSVT), in which we can execute complicated matrix functions by recursively organizing block-encoding by low-degree QET or QSVT. Owing to the simplicity of recursive relations, it works only with a few parameters with exactly determining the parameters, while its iteration results in complicated matrix functions. In particular, by exploiting the recursive relation of Newton iteration, we construct the matrix sign function, which can be applied for eigenstate filtering for example, in a tractable way. We show that an analytically-obtained parameter set composed of only $8$ different values is sufficient for executing QET of the matrix sign function with an arbitrarily small error $\varepsilon$. Our protocol will serve as an alternative protocol for constructing QET or QSVT for some useful matrix functions without numerical instability.

Related papers

• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Hermitian Matrix Function Synthesis without Block-Encoding [6.824528644662748]
  We propose a novel and efficient approach to implement arbitrary circuits of a Hermitian matrix on quantum hardware.<n>Our method circumvents the need for block-encoding by expressing the target Hermitian matrix as a symmetric combination of unitary conjugates.
  arXiv  Detail & Related papers  (2025-12-20T07:22:04Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  Conditional measurement is involved to avoid small success probability in ancilla measurement. The objective function for the algorithm can be obtained probabilistically via measurement of the state of a one-qubit subsystem.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Polynomial time constructive decision algorithm for multivariable quantum signal processing [0.7332146059733189]
  Multivariable quantum signal processing (M-QSP) is proposed. M-QSP interleaves signal operators corresponding to each variable with signal processing operators. A classical algorithm is proposed to determine whether a given pair of Laurents can be implemented by M-QSP.
  arXiv  Detail & Related papers  (2024-10-03T09:30:35Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer. Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model. We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• 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)
• Quantum signal processing over SU(N) [0.0]
  Quantum signal processing (QSP) and the quantum singular value transformation (QSVT) are pivotal tools for simplifying the development of quantum algorithms. These techniques leverage transformations on the eigenvalues or singular values of block-encoded matrices, achieved with the use of just one control qubit. In this work, we extend the original QSP ansatz by introducing multiple control qubits.
  arXiv  Detail & Related papers  (2023-11-07T12:43:47Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Robust iterative method for symmetric quantum signal processing in all parameter regimes [1.3614427997190908]
  This paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP) We present a novel Newtons method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework.
  arXiv  Detail & Related papers  (2023-07-24T01:45:12Z)
• Semantic embedding for quantum algorithms [0.0]
  A need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT) We show that QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to soundness in quantum cryptography.
  arXiv  Detail & Related papers  (2023-04-27T17:55:40Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers [50.85524803885483]
  This work proposes a formal definition of statistically meaningful (SM) approximation which requires the approximating network to exhibit good statistical learnability. We study SM approximation for two function classes: circuits and Turing machines.
  arXiv  Detail & Related papers  (2021-07-28T04:28:55Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• 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)

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.