Generalized quantum singular value transformation with application in quantum bi-conjugate gradient method

• URL: http://arxiv.org/abs/2508.21390v1
• Date: Fri, 29 Aug 2025 08:05:06 GMT
• Title: Generalized quantum singular value transformation with application in quantum bi-conjugate gradient method
• Authors: Yu-Qiu Liu, Hefeng Wang, Hua Xiang,
• Abstract summary: We present a quantum bi-conjugate gradient (BiCG) algorithm as an application for GQSP.<n>We refer to this extension as generalized quantum singular value transformation (GQSVT)<n>We implement the quantum BiCG method, utilizing GQSVT and swap test, which has a relatively shallow circuit depth and requires a small number of ancilla qubits.
• Score: 2.0289281018574377
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum signal processing (QSP) and generalized quantum signal processing (GQSP) are essential tools for implementing the block encoding of matrix functions. The achievable polynomials of QSP have restrictions on parity, while GQSP eliminates these restrictions. In this paper, we further investigate GQSP and present a quantum bi-conjugate gradient (BiCG) algorithm as an application. First, we extend GQSP, which constructs functions of unitary matrices, to general matrices. We refer to this extension as generalized quantum singular value transformation (GQSVT). Subsequently, we implement the quantum BiCG method, utilizing GQSVT and swap test, which has a relatively shallow circuit depth and requires a small number of ancilla qubits.

Related papers

• An adversary bound for quantum signal processing [0.0]
  We study the class of transformations achievable by M-QSP.<n>We show that a M-QSP protocol of minimal space is thus reduced to a rank minimization problem involving the feasible solution space of the adversary bound.
  arXiv  Detail & Related papers  (2025-06-25T14:31:34Z)
• Double-bracket algorithm for quantum signal processing without post-selection [0.0]
  Quantum signal processing (QSP) is a fundamental primitive in various quantum algorithms.<n>Despite its versatility, a potentially underappreciated challenge is that all systematic protocols for implementing QSP rely on post-selection.<n>We introduce a new formula for implementing QSP transformations of Hermitian matrices, which requires neither auxiliary qubits nor post-selection.
  arXiv  Detail & Related papers  (2025-04-01T18:00:04Z)
• Quantum signal processing without angle finding [0.0]
  Quantum signal processing (QSP) has emerged as a unifying computation in quantum algorithms.<n>We propose a novel approach to QSP that bypasses the computationally intensive angle-finding step.<n>Our work significantly broadens the applicability of QSP in quantum computing.
  arXiv  Detail & Related papers  (2025-01-13T01:35:56Z)
• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol.<n>We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.<n>We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Modular quantum signal processing in many variables [0.0]
  We show that modular multi-input-based QSP-based superoperators can be snapped together with LEGO-like ease at the level of the functions they apply.<n>We also provide a Python package for assembling gadgets and compiling them to circuits.
  arXiv  Detail & Related papers  (2023-09-28T17:58:51Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• A Grand Unification of Quantum Algorithms [0.0]
  A number of quantum algorithms were recently tied together by a technique known as the quantum singular value transformation. This paper provides a tutorial through these developments, first illustrating how quantum signal processing may be generalized to the quantum eigenvalue transform. We then employ QSVT to construct intuitive quantum algorithms for search, phase estimation, and Hamiltonian simulation.
  arXiv  Detail & Related papers  (2021-05-06T17:46:33Z)

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.