Related papers: Qubits as Hypermatrices and Entanglement

We consider a self-convolutive recurrence whose solution is the sequence of coefficients in the asymptotic expansion of the logarithmic derivative of the confluent hypergeometic function $U(a,b,z)$. By application of the Hilbert transform…

Separability and entanglement for n-qubits systems are quantified by using Hilbert-Schmidt (HS) decompositions in which the density matrices are decomposed into various terms representing certain one qubit, two-qubits,and larger qubits…

Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…

Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary…

Here we apply our SU(N) and U(N) parameterizations to the question of entanglement in the two qubit and qubit/qutrit system. In particular, the group operations which entangle a two qubit pure state will be given, as well as the…

We provide a supersymmetric generalization of n quantum bits by extending the local operations and classical communication entanglement equivalence group [SU(2)]^n to the supergroup [uOSp(1|2)]^n and the stochastic local operations and…

Realizing the advantages of quantum computation requires access to the full Hilbert space of states of many quantum bits (qubits). Thus, large-scale quantum computation faces the challenge of efficiently generating entanglement between many…

We present a graphical framework to represent entanglement in three-qubit states. The geometry associated with each entanglement class and type is analyzed, revealing distinct structural features. We explore the connection between this…

We consider a system composed of two qubits and a high-excitation-energy quantum object used to mediate coupling between the qubits. We treat the entire system quantum mechanically and analyze the properties of the eigenvalues and…

Quadratic Unconstrained Binary Optimization (QUBO) is a standard NP-hard optimization problem. Recently, it has gained renewed interest through quantum computing, as QUBOs directly reduce to the Ising model, on which quantum annealing…

The two-parametric quantum superalgebra $U_{pq}[gl(2/2)]$ and its representations are considered. All finite-dimensional irreducible representations of this quantum superalgebra can be constructed and classified into typical and nontypical…

Using the notion of quantum integers associated with a complex number $q\neq 0$, we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little $q$-Jacobi polynomials when $|q|<1$, and…

We present an algebraic study of a kind of quantum systems belonging to a family of superintegrable Hamiltonian systems in terms of shape-invariant intertwinig operators, that span pairs of Lie algebras like $(su(n),so(2n))$ or…

We show how a recently proposed supersymmetric quantum mechanics model leads to non-trivial results/conjectures on the combinatorics of binary necklaces and linear-feedback shift-registers. Pauli's exclusion principle plays a crucial role:…

We develop explicit formulae for the eigenvalues of various invariants for highest weight irreducible representations of the quantum supergroup $U_q[gl(m|n)]$. The techniques employed make use of modified characteristic identity methods and…

We study hyperbolic polynomials with nice symmetry and express them as the determinant of a Hermitian matrix with special structure. The goal of this paper is to answer a question posed by Chien and Nakazato in 2015. By properly modifying a…

Quantum information carriers, just like most physical systems, naturally occupy high-dimensional Hilbert spaces. Instead of restricting them to a two-level subspace, these high-dimensional (qudit) quantum systems are emerging as a powerful…

We consider the concept of "the permutationally invariant (PI) part of a density matrix," which has proven very useful for both efficient quantum state estimation and entanglement characterization of $N$-qubit systems. We show here that the…

In this paper we study of *-representations for polynomial algebras on quantum matrix spaces. We deal with two special cases of the polynomial algebras, namely the algebra of polynomials on quantum complex matrices $\mathrm{Mat_2}$ and on…

Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…