Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Elsevier eBooks

Standard r-Transformation Matrices and Their Applications

U. Fano, A. R. P. Rau

Published Jan 1, 1996• 0 citations
Publisher
DOI
10.1016/b978-012248455-1/50005-1

Related papers

A standard form for generalised CP transformations

Gerhard Franz Ecker, Walter Grimus, Helmut Neufeld

The investigation of general CP transformations leads to transformations of the form U to WTUW with unitary matrices U, W. It is shown that a basis of weak eigenstates can always be chosen such that WTUW has a certain real standard form.

Journal of Physics A Mathematical and General•Aug 21, 1987•122 citations

THE CONNECTION BETWEEN THE R-MATRIX AND THE S-MATRIX

N. G. van Kampen

Revista Mexicana de Física•Oct 1, 1953•5 citations

Generalized quantum singular value transformation with application in quantum conjugate gradient least squares algorithm

Yu-Qiu Liu, Hefeng Wang, Xiang, Hua

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. But GQSP only constructs functions of unitary matrices. In this paper, we further investigate GQSP and extend it to general matrices. Compared with the quantum singular value transformation (QSVT), our proposed method relaxes the requirements on the parity of polynomials. We refer to this extension as generalized quantum singular value transformation (GQSVT). Subsequently, by utilizing the relationship between generalized matrix functions and standard matrix functions, we propose a classical-quantum hybrid quantum conjugate gradient least squares (CGLS) algorithm using GQSVT.

arXiv:2508.21390•Aug 29, 2025•1 citation

The t-Matrix and the Canonical Transformation

Roger Balian

•Jan 1, 1962•0 citations

Quantum circuits from non-unitary sparse binary matrices

Krishnageetha Karuppasamy, Varun Puram, K. M. George +1 more

Quantum computing leverages unitary matrices to perform reversible computations while preserving probability norms. However, many real-world applications involve non-unitary sparse matrices, posing a challenge for quantum implementation. This paper introduces a novel method for transforming a class of non-unitary sparse binary matrices into higher-dimensional permutation matrices, ensuring unitarity. Our approach is efficient in both space and time, ensuring practical applicability to large-scale problems. We demonstrate the utility of this transformation in constructing quantum gates and apply the method to model quantum finite state machines (QFSMs) derived from classical deterministic finite automata (DFAs). This work offers a practical pathway for integrating non-unitary transformations into quantum systems, with implications for the many applications that are based on sparse, non-unitary matrices. The significance of this work for automata theory and quantum computation is outlined.

Scientific Reports•Jul 1, 2025•2 citations

Application of the Infinite Product Representation of the R-Matrix

Jinchu Huang

•Jan 1, 1989•0 citations
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. But GQSP only constructs functions of unitary matrices. In this paper, we further investigate GQSP and extend it to general matrices. Compared with the quantum singular value transformation (QSVT), our proposed method relaxes the requirements on the parity of polynomials. We refer to this extension as generalized quantum singular value transformation (GQSVT). Subsequently, by utilizing the relationship between generalized matrix functions and standard matrix functions, we propose a classical-quantum hybrid quantum conjugate gradient least squares (CGLS) algorithm using GQSVT.
Quantum computing leverages unitary matrices to perform reversible computations while preserving probability norms. However, many real-world applications involve non-unitary sparse matrices, posing a challenge for quantum implementation. This paper introduces a novel method for transforming a class of non-unitary sparse binary matrices into higher-dimensional permutation matrices, ensuring unitarity. Our approach is efficient in both space and time, ensuring practical applicability to large-scale problems. We demonstrate the utility of this transformation in constructing quantum gates and apply the method to model quantum finite state machines (QFSMs) derived from classical deterministic finite automata (DFAs). This work offers a practical pathway for integrating non-unitary transformations into quantum systems, with implications for the many applications that are based on sparse, non-unitary matrices. The significance of this work for automata theory and quantum computation is outlined.