Unitarization of Pseudo-Unitary Quantum Circuits in the S-matrix Framework

• URL: http://arxiv.org/abs/2302.04681v2
• Date: Thu, 11 Jan 2024 19:18:53 GMT
• Title: Unitarization of Pseudo-Unitary Quantum Circuits in the S-matrix Framework
• Authors: Dennis Lima, Saif Al-Kuwari
• Abstract summary: We show a family of pseudo-unitary and inter-pseudo-unitary circuits with full diagrammatic representation in three dimensions. The outcomes of our study expand the methodological toolbox needed to build a family of pseudo-unitary and inter-pseudo-unitary circuits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Pseudo-unitary circuits are recurring in both S-matrix theory and analysis of No-Go theorems. We propose a matrix and diagrammatic representation for the operation that maps S-matrices to T-matrices and, consequently, a unitary group to a pseudo-unitary one. We call this operation ``partial inversion'' and show its diagrammatic representation in terms of permutations. We find the expressions for the deformed metrics and deformed dot products that preserve physical constraints after partial inversion. Subsequently, we define a special set that allows for the simplification of expressions containing infinities in matrix inversion. Finally, we propose a renormalized-growth algorithm for the T-matrix as a possible application. The outcomes of our study expand the methodological toolbox needed to build a family of pseudo-unitary and inter-pseudo-unitary circuits with full diagrammatic representation in three dimensions, so that they can be used to exploit pseudo-unitary flexibilization of unitary No-Go Theorems and renormalized circuits of large scattering lattices.

Related papers

• Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
  Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations.
  arXiv  Detail & Related papers  (2024-07-15T07:11:44Z)
• Revealing symmetries in quantum computing for many-body systems [0.0]
  We deduce the symmetry properties of many-body Hamiltonians when they are prepared in Jordan-Wigner form for evaluation on quantum computers. We prove a general theorem that provides a straightforward method to calculate the transformation of Pauli tensor strings under symmetry operations.
  arXiv  Detail & Related papers  (2024-07-03T18:53:09Z)
• Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras from First Principles [55.41644538483948]
  We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the transformations symmetry and the corresponding generators. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
  arXiv  Detail & Related papers  (2023-01-13T16:25:25Z)
• Permutation symmetry in large N Matrix Quantum Mechanics and Partition Algebras [0.0]
  We describe the implications of permutation symmetry for the state space and dynamics of quantum mechanical systems of general size $N$. A symmetry-based mechanism for quantum many body scars discussed in the literature can be realised in these matrix systems with permutation symmetry.
  arXiv  Detail & Related papers  (2022-07-05T16:47:10Z)
• Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
  We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-21T01:47:17Z)
• Symplectic decomposition from submatrix determinants [0.0]
  An important theorem in Gaussian quantum information tells us that we can diagonalise the covariance matrix of any Gaussian state via a symplectic transformation. Inspired by a recently presented technique for finding the eigenvectors of a Hermitian matrix from certain submatrix eigenvalues, we derive a similar method for finding the diagonalising symplectic from certain submatrix determinants.
  arXiv  Detail & Related papers  (2021-08-11T18:00:03Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)
• Positive maps and trace polynomials from the symmetric group [0.0]
  We develop a method to obtain operator inequalities and identities in several variables. We give connections to concepts in quantum information theory and invariant theory.
  arXiv  Detail & Related papers  (2020-02-28T17:43:37Z)
• Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
  We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
  arXiv  Detail & Related papers  (2020-02-03T16:17:50Z)
• J-matrix method of scattering in one dimension: The relativistic theory [0.0]
  We make a relativistic extension of the one-dimensional J-matrix method of scattering. The relativistic potential matrix is a combination of vector, scalar, and pseudo-scalar components.
  arXiv  Detail & Related papers  (2020-01-14T19:02:15Z)

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.