Related papers: On construction of anticliques for non-commutative…
We present a construction of new bound entangled states from given bound entangled states for arbitrary dimensional bipartite systems. One way to construct bound entangled states is to show that these states are PPT (positive partial…
In this paper we present a general construction that can be used to define the higher Hochschild homology for a noncommutative algebra. We also discuss other examples where this construction can be used.
The classical Mycielski transformation allows for constructing from a given graph the new one, with an arbitrarily large chromatic number but preserving the size of the largest clique contained in it. This particular construction and its…
Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement…
We investigate the states generated in continuous variable (CV) optical fields on operating them with a number-conserving operator of the type $s\hat{a}\hat{a}^\dag + t\hat{a}^\dag\hat{a}$, formed by the generalised superposition of…
A proof is given that an invertible and a unitary operator can be used to reproduce the effect of a q-deformed commutator of annihilation and creation operators. In other words, the original annihilation and creation operators are mapped…
Graphical calculi for representing interacting quantum systems serve a number of purposes: compositionally, intuitive graphical reasoning, and a logical underpinning for automation. The power of these calculi stems from the fact that they…
Quantum hypergraph states are the natural generalization of graph states. Here we investigate and analytically quantify entanglement and nonlocality for large classes of quantum hypergraph states. More specifically, we connect the geometric…
The hypergraph states are pure multipartite quantum states corresponding to a hypergraph. It is an equal superposition of the states belonging to the computational basis. Given any hypergraph, we can construct a hypergraph state determined…
There is a connection between classical codes, highly entangled pure states (called k-uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct…
Hypergraph states form a family of multiparticle quantum states that generalizes cluster states and graph states. We study the action and graphical representation of nonlocal unitary transformations between hypergraph states. This leads to…
We develop connections between generalised notions of entanglement and quantum computational devices where the measurements available are restricted, either because they are noisy and/or because by design they are only along Pauli…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
We use symmetric measurement operators to construct quantum channels that provide a further generalization of generalized Pauli channels. The resulting maps are bistochastic but in general no longer mixed unitary. We analyze their important…
We show that the realizations of noncommutative coordinates that are linear in the Lorentz generators form a closed Lie algebra under certain conditions. The star product and the coproduct for the momentum generators are obtained for these…
We provide a simple construction of bipartite entangled states that are positive under partial transposition, and hence undistillable. The construction makes use of the properties of the projectors onto the symmetric and antisymmetric…
By making use of the generalized concept of orthogonality in Latin squares, certain t-partite graphs have been constructed and a suggestion for a net work system and some applications have been made.
Recently M.E. Shirokov introduced the non-commutative operator graph depending on the complex parameter $\theta $ to construct channels with positive quantum zero-error capacity having vanishing n-shot capacity. We study the algebraic…
Over a decade ago, it was demonstrated that quantum computing has the potential to revolutionize numerical linear algebra by enabling algorithms with complexity superior to what is classically achievable, e.g., the seminal HHL algorithm for…
In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…