Weyl's Relations, Integrable Matrix Models and Quantum Computation

• URL: http://arxiv.org/abs/2506.16841v1
• Date: Fri, 20 Jun 2025 08:45:44 GMT
• Title: Weyl's Relations, Integrable Matrix Models and Quantum Computation
• Authors: B. Sriram Shastry, Emil A. Yuzbashyan, Aniket Patra,
• Abstract summary: We show that the Heisenberg commutation relations can be satisfied in a specific $N-1$ dimensional subspace.<n>This setup is used to construct a hierarchy of parameter-dependent commuting matrices in $N$ dimensions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Starting from a generalization of Weyl's relations in finite dimension $N$, we show that the Heisenberg commutation relations can be satisfied in a specific $N-1$ dimensional subspace, and display a linear map for projecting operators to this subspace. This setup is used to construct a hierarchy of parameter-dependent commuting matrices in $N$ dimensions. This family of commuting matrices is then related to Type-1 matrices representing quantum integrable models. The commuting matrices find an interesting application in quantum computation, specifically in Grover's database search problem. Each member of the hierarchy serves as a candidate Hamiltonian for quantum adiabatic evolution and, in some cases, achieves higher fidelity than standard choices -- thus offering improved performance.

Related papers

• Refined Quantum Algorithms for Principal Component Analysis and Solving Linear System [0.0]
  We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations.<n>Our methods are exponentially faster than their classical counterparts and even previous quantum algorithms/dequantization algorithms.
  arXiv  Detail & Related papers  (2025-04-01T14:23:54Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces [47.83974626445763]
  We construct path matrices for decomposition of Cartesian tensors up to rank $n=9$ with reduced and affordable complexity.<n>We prove and leverage that the concatenation of path matrices is an orthonormal change-of-basis matrix between the tensor product space and the spherical direct sum spaces.<n>We extend our result to the arbitrary tensor product and direct sum spaces, enabling free design between different spaces while keeping symmetry.
  arXiv  Detail & Related papers  (2024-12-24T08:25:38Z)
• 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.<n>This paper provides a comprehensive and unified understanding of the matrix logarithm and power from a Riemannian geometry perspective.
  arXiv  Detail & Related papers  (2024-07-15T07:11:44Z)
• Efficient Variational Quantum Linear Solver for Structured Sparse Matrices [0.6138671548064355]
  We show that by using an alternate basis one can better exploit the sparsity and underlying structure of matrix. We employ the concept of unitary completion to design efficient quantum circuits for computing the global/local VQLS cost functions.
  arXiv  Detail & Related papers  (2024-04-25T19:22:05Z)
• Efficient Unitary T-designs from Random Sums [0.6640968473398456]
  Unitary $T$-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. We provide a new construction of $T$-designs via random matrix theory using $tildeO(T2 n2)$ quantum gates.
  arXiv  Detail & Related papers  (2024-02-14T17:32:30Z)
• Quantum algorithms for calculating determinant and inverse of matrix and solving linear algebraic systems [43.53835128052666]
  We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)times (N-1)$ matrix.<n>The basic idea is to encode each row of the matrix into a pure state of some quantum system.
  arXiv  Detail & Related papers  (2024-01-29T23:23:27Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Expanding the reach of quantum optimization with fermionic embeddings [2.378735224874938]
  In this work, we establish a natural embedding for this class of LNCG problems onto a fermionic Hamiltonian. We show that our quantum representation requires only a linear number of qubits. We provide evidence that this rounded quantum relaxation can produce high-quality approximations.
  arXiv  Detail & Related papers  (2023-01-04T19:00:01Z)
• 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)
• $O(N^2)$ Universal Antisymmetry in Fermionic Neural Networks [107.86545461433616]
  We propose permutation-equivariant architectures, on which a determinant Slater is applied to induce antisymmetry. FermiNet is proved to have universal approximation capability with a single determinant, namely, it suffices to represent any antisymmetric function. We substitute the Slater with a pairwise antisymmetry construction, which is easy to implement and can reduce the computational cost to $O(N2)$.
  arXiv  Detail & Related papers  (2022-05-26T07:44:54Z)
• 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)
• Supervised Quantile Normalization for Low-rank Matrix Approximation [50.445371939523305]
  We learn the parameters of quantile normalization operators that can operate row-wise on the values of $X$ and/or of its factorization $UV$ to improve the quality of the low-rank representation of $X$ itself. We demonstrate the applicability of these techniques on synthetic and genomics datasets.
  arXiv  Detail & Related papers  (2020-02-08T21:06:02Z)

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.