Generalized "Square roots of Not" matrices, their application to the unveiling of hidden logical operators and to the definition of fully matrix circular Euler functions

• URL: http://arxiv.org/abs/2107.06067v5
• Date: Mon, 10 Jun 2024 16:37:31 GMT
• Title: Generalized "Square roots of Not" matrices, their application to the unveiling of hidden logical operators and to the definition of fully matrix circular Euler functions
• Authors: Eduardo Mizraji,
• Abstract summary: The square root of Not is a logical operator of importance in quantum computing theory. In physics, it is a square complex matrix of dimension 2. We show how general expressions for the two square roots of the Not operator are obtained.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The square root of Not is a logical operator of importance in quantum computing theory and of interest as a mathematical object in its own right. In physics, it is a square complex matrix of dimension 2. In the present work it is a complex square matrix of arbitrary dimension. The introduction of linear algebra into logical theory has been enhanced in recent decades by the researches in the field of neural networks and quantum computing. Here we will make a brief description of the representation of logical operations through matrices and we show how general expressions for the two square roots of the Not operator are obtained. Then, we explore two topics. First, we study an extension to a non-quantum domain of a short form of Deutsch's algorithm. Then, we assume that a root of Not is a matrix extension of the imaginary unit i, and under this idea we obtain fully matrix versions for the Euler expansions and for the representations of circular functions by complex exponentials.

Related papers

• Quantum Eigensolver with Exponentially Improved Dependence on Parameters [0.8057006406834466]
  Eigenvalue estimation is a fundamental problem in numerical analysis and scientific computation. This work proposes an efficient quantum eigenvalues based on quantum transformations of the matrix.
  arXiv  Detail & Related papers  (2025-02-25T11:43:47Z)
• Irreducible matrix representations for the walled Brauer algebra [0.9374652839580183]
  This paper investigates the representation theory of the algebra of partially transposed permutation operators, $mathcalAd_p,p$. It provides a matrix representation for the abstract walled Brauer algebra. This algebra has recently gained significant attention due to its relevance in quantum information theory.
  arXiv  Detail & Related papers  (2025-01-22T18:22:20Z)
• Geometry of fibers of the multiplication map of deep linear neural networks [0.0]
  We study the geometry of the set of quivers of composable matrices which multiply to a fixed matrix. Our solution is presented in three forms: a Poincar'e series in equivariant cohomology, a quadratic integer program, and an explicit formula.
  arXiv  Detail & Related papers  (2024-11-29T18:36:03Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• 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)
• 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)
• 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)
• 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)
• Low-Rank Updates of Matrix Square Roots [7.832944895330117]
  We consider the matrix square root and inverse square root operations. Given a low rank perturbation to a matrix, we argue that a low-rank approximate correction to the (inverse) square root exists. We then discuss how a low-rank solution to that equation can be computed.
  arXiv  Detail & Related papers  (2022-01-31T12:05:33Z)
• Matrix Decomposition and Applications [8.034728173797953]
  In 1954, Alston S. Householder published Principles of Numerical Analysis, one of the first modern treatments on matrix decomposition. matrix decomposition has become a core technology in machine learning, largely due to the development of the back propagation algorithm in fitting a neural network.
  arXiv  Detail & Related papers  (2022-01-01T08:13:48Z)
• Non-PSD Matrix Sketching with Applications to Regression and Optimization [56.730993511802865]
  We present dimensionality reduction methods for non-PSD and square-roots" matrices. We show how these techniques can be used for multiple downstream tasks.
  arXiv  Detail & Related papers  (2021-06-16T04:07:48Z)
• Generators and Relations for the Group On(Z[1/2]) [0.0]
  Both groups arise in the study of quantum circuits. In particular, when the dimension is a power of 2, the elements of the latter group are precisely the unitary matrices that can be represented by a quantum circuit over the universal gate set consisting of the Toffoli gate, the Hadamard gate, and the computational ancilla.
  arXiv  Detail & Related papers  (2021-06-02T14:11:53Z)
• Symbolic Reasoning about Quantum Circuits in Coq [2.065777667168023]
  A quantum circuit is a computational unit that transforms an input quantum state to an output one. We propose a symbolic approach to reasoning about quantum circuits.
  arXiv  Detail & Related papers  (2020-05-22T06:27:52Z)
• Vector logic allows counterfactual virtualization by The Square Root of NOT [0.0]
  We investigate the representation of counterfactual conditionals using the vector logic, a matrix-vectors formalism for logical functions and truth values. After this basic representation, the judgment of the plausibility of a given counterfactual allows us to shift the decision towards an acceptance or a refusal.
  arXiv  Detail & Related papers  (2020-03-09T20:56:36Z)

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.