Periodicity of lively quantum walks on cycles with generalized Grover coin

• URL: http://arxiv.org/abs/2003.12955v2
• Date: Tue, 31 Mar 2020 00:59:12 GMT
• Title: Periodicity of lively quantum walks on cycles with generalized Grover coin
• Authors: Rohit Sarma Sarkar, Amrita Mandal, Bibhas Adhikari
• Abstract summary: We extend the study of three state lively quantum walks on cycles by considering the coin operator as a linear sum of permutation matrices. We establish that an orthogonal matrix of order $3times 3$ is a linear sum of permutation matrices if and only if it is permutative.
• Score: 0.17205106391379021
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we extend the study of three state lively quantum walks on cycles by considering the coin operator as a linear sum of permutation matrices, which is a generalization of the Grover matrix. First we provide a complete characterization of orthogonal matrices of order $3\times 3$ which are linear sum of permutation matrices. Consequently, we determine several groups of complex, real and rational orthogonal matrices. We establish that an orthogonal matrix of order $3\times 3$ is a linear sum of permutation matrices if and only if it is permutative. Finally we determine period of lively quantum walk on cycles when the coin operator belongs to the group of orthogonal (real) linear sum of permutation matrices.

Related papers

• 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. 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. 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)
• Entrywise application of non-linear functions on orthogonally invariant matrices [44.99833362998488]
  We investigate how the entrywise application of a non-linear function to symmetric invariant random matrix ensembles alters the spectral distribution. We find that in all those cases a Gaussian equivalence principle holds, that is, the effect of the non-linear function is the same as taking a linear combination of the involved matrices and an additional independent GOE.
  arXiv  Detail & Related papers  (2024-12-09T19:41:09Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• A note on cyclic MDS and non-MDS matrices [3.069335774032178]
  In $1998,$ Daemen it et al. introduced a circulant Maximum Distance Separable (MDS) matrix in the diffusion layer of the Rijndael block cipher. This block cipher is now universally acclaimed as the AES block cipher. In $2016,$ Liu and Sim introduced cyclic matrices by modifying the permutation of circulant matrices.
  arXiv  Detail & Related papers  (2024-06-20T06:05:16Z)
• Purely quantum algorithms for calculating determinant and inverse of matrix and solving linear algebraic systems [43.53835128052666]
  We propose quantum algorithms for the computation of the determinant and inverse of an $(N-1) times (N-1)$ matrix. This approach is a straightforward modification of the existing algorithm for determining the determinant of an $N times N$ matrix. We provide suitable circuit designs for all three algorithms, each estimated to require $O(N log N)$ in terms of space.
  arXiv  Detail & Related papers  (2024-01-29T23:23:27Z)
• Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices [43.644985364099036]
  We address three problems that arise in fitting a given matrix by an MLR matrix in the Frobenius norm. The first problem is factor fitting, where we adjust the factors of the MLR matrix. The second is rank allocation, where we choose the ranks of the blocks in each level, subject to the total rank having a given value. The final problem is to choose the hierarchical partition of rows and columns, along with the ranks and factors.
  arXiv  Detail & Related papers  (2023-10-30T00:52:17Z)
• Discrete-time quantum walks on Cayley graphs of Dihedral groups using generalized Grover coins [0.0]
  We study discrete-time quantum walks on Cayley graphs corresponding to Dihedral groups. We show that the walks are periodic only for coins that are permutation or negative of a permutation matrix.
  arXiv  Detail & Related papers  (2023-09-26T18:53:35Z)
• Mutually-orthogonal unitary and orthogonal matrices [6.9607365816307]
  We show that the minimum and maximum numbers of an unextendible maximally entangled bases within a real two-qutrit system are three and four, respectively. As an application in quantum information theory, we show that the minimum and maximum numbers of an unextendible maximally entangled bases within a real two-qutrit system are three and four, respectively.
  arXiv  Detail & Related papers  (2023-09-20T08:20:57Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Algebraic and geometric structures inside the Birkhoff polytope [0.0]
  Birkhoff polytope $mathcalB_d$ consists of all bistochastic matrices of order $d$. We prove that $mathcalL_d$ and $mathcalF_d$ are star-shaped with respect to the flat matrix.
  arXiv  Detail & Related papers  (2021-01-27T09:51:24Z)
• The decomposition of an arbitrary $2^w\times 2^w$ unitary matrix into signed permutation matrices [0.0]
  Birkhoff's theorem tells that any doubly matrix can be decomposed as a weighted sum of permutation matrices. A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices.
  arXiv  Detail & Related papers  (2020-05-26T18:26:05Z)

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.