Related papers: Qudit Hypergraph States
We develop a systematic method to construct the Bell states of a qubit bipartite system while taking $SU(2)$ group as the basis group. An alternative formulation of fidelity, called $SU(2)$ fidelity, is proposed which gives the Bell-CHSH…
We give a criterion that is sufficient for controllability of multipartite quantum systems. We generalize the graph infection criterion to the quantum systems that cannot be described with the use of a graph theory. We introduce the…
There are two types of universality in measurement-based quantum computation (MBQC): ${\it strict}$ and ${\it computational}$. It is well known that the former is stronger than the latter. We present a method of transforming from a certain…
We generalize the W class of states from $n$ qubits to $n$ qudits and prove that their entanglement is fully characterized by their partial entanglements even for the case of the mixture that consists of a W-class state and a product state…
Defining a computational basis of pseudo-number states, we interpret a coherent state of large amplitude, $|\alpha|\gg\frac{d}{2\pi}$, as a qudit --- a $d$-level quantum system --- in a state that is an even superposition of $d$…
We prove that the vast majority of symmetric states of qubits can be decomposed in a unique way into a superposition of spin 1/2 coherent states. For the case of two qubits, the proposed decomposition reproduces the Schmidt decomposition…
Several families of states such as Werner states, Bell-diagonal states and Dicke states are useful to understand multipartite entanglement. Here we present a [2^(N+1)-1]-parameter family of N-qubit "X states" that embrace all those…
We investigate the entanglement properties in the symmetric subspace of $N$-partite $d$-dimensional systems (qudits). For diagonal symmetric states, we show that there is no bound entanglement for $d = 3,4 $ and $N = 3$. Further, we present…
Measurements play an important role in quantum computing (QC), by either providing the nonlinearity required for two-qubit gates (linear optics QC), or by implementing a quantum algorithm using single-qubit measurements on a highly…
It has been demonstrated both theoretically and experimentally that genuine multipartite entanglement between qubits can exist even in the absence of multipartite correlations. Here we provide first examples of this effect in higher…
In this paper, we consider the local unitary classification of the class of qudit bipartite mixed states for which no information can be obtained locally. These states are represented by symmetrical density matrices in which both tracial…
Although only two quantum states of a physical system are often used to encode quantum information in the form of qubits, many levels can in principle be used to obtain qudits and increase the information capacity of the system. To take…
We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…
In the present paper few steps are undertaken towards the description of the qubit-qutrit pair - quantum bipartite system composed of two and three level subsystems. The computational difficulties with the construction of the local unitary…
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity,…
We provide a deterministic polynomial-time algorithm that, for a given $k$-uniform hypergraph $H$ with $n$ vertices and edge density $d$, finds a complete $k$-partite subgraph of $H$ with parts of size at least ${c(d, k)(\log…
The main purpose of thispaper is to show that composite quantum-like (QL) systems can closely mimic the separable states of quantum systems, and that suitable physical systems exhibiting these states exist. It is shown that QL graphs can…
We show that a singlet of many multi-level quantum systems arises naturally as the ground state of a physically-motivated Hamiltonian. The Hamiltonian simply exchanges the states of nearest-neighbours in some network of qudits (d-level…
This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…
We investigate some properties of the entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing local entropic measure on qubit t of a hypergraph state by using the Hamming weight…