相关论文: Small k-pairable states

Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…

Distributed quantum communication and quantum computing offer many new opportunities for quantum information processing. Here networks based on highly nonlocal quantum resources with complex entanglement structures have been proposed for…

Given $k\ge 1$, a $k$-proper partition of a graph $G$ is a partition ${\mathcal P}$ of $V(G)$ such that each part $P$ of ${\mathcal P}$ induces a $k$-connected subgraph of $G$. We prove that if $G$ is a graph of order $n$ such that…

We classify, up to local unitary equivalence, the set of $n$-qubit states that is stabilized by the diagonal subgroup of the local unitary group. We exhibit a basis for this set, parameterized by diagrams of nonintersecting chords…

Graph states are a fundamental class of multipartite entangled quantum states with wide-ranging applications in quantum information and computation. In this work, we develop a systematic framework for constructing and analyzing…

Random $s$-intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random $s$-intersection graph is constructed by first assigning each vertex a set of items in some random manner,…

The extraction of EPR pairs and n-qubits GHZ states among remote nodes in quantum networks constitutes the resource primitives for end-to-end and on-demand communications. However, the Bell-VM problem, which determines whether a given graph…

A $k$-colouring of a graph $G$ is an assignment of at most $k$ colours to the vertices of $G$ so that adjacent vertices are assigned different colours. The reconfiguration graph of the $k$-colourings, $\mathcal{R}_k(G)$, is the graph whose…

The group of local unitary transformations partitions the space of n-qubit quantum states into orbits, each of which is a differentiable manifold of some dimension. We prove that all orbits of the n-qubit quantum state space have dimension…

The Bell-Kochen-Specker theorem (BKS) theorem rules out realistic {\it non-contextual} theories by resorting to impossible assignments of rays among a selected set of maximal orthogonal bases. We investigate the geometrical structure of…

We study here the problem of determining the majority type in an arbitrary connected network, each vertex of which has initially two possible types. The vertices may have a few additional possible states and can interact in pairs only if…

As a generalization of the concept of the partition dimension of a graph, this article introduces the notion of the $k$-partition dimension. Given a nontrivial connected graph $G=(V,E)$, a partition $\Pi$ of $V$ is said to be a…

In research concerning quantum networks, it is often assumed that the parties can classically communicate with each other. However, classical communication might introduce a substantial delay to the network, especially if it is large. As…

In quantum computing and quantum information processing, graph states are a specific type of quantum states which are commonly used in quantum networking and quantum error correction. A recurring problem is finding a transformation from a…

It has been shown by Versraete et. al [F. Versraete, J. Dehaene, B. De Moor, and H. Verschelde, Phys. Rev. A65, 052112 (2002)] that by stochastic local operations and classical communication (SLOCC), a pure state of four qubits can be…

In the 1970s, Gy\H{o}ri and Lov\'{a}sz showed that for a $k$-connected $n$-vertex graph, a given set of terminal vertices $t_1, \dots, t_k$ and natural numbers $n_1, \dots, n_k$ satisfying $\sum_{i=1}^{k} n_i = n$, a connected vertex…

A pure state of $N$ parties with local dimension $d$ is called a $k$-uniform state if all the reductions to $k$ parties are maximally mixed. Based on the connections among $k$-uniform states, orthogonal arrays and linear codes, we give…

Graph-theoretic structures play a central role in the description and analysis of quantum systems. In this work, we introduce a new class of quantum states, called $A_\alpha$-graph states, which are constructed from either unweighted or…

We derive necessary and sufficient conditions for the LU-equivalence of two general (pure or mixed) $n$-qubit states as well as we determine the local unitary operators connecting them. Almost all relevant information is contained in the…

Given a graph $G=(V,E)$ on $n$ vertices and an integer $k$ between 1 and $n-1$, the $k$-token graph $F_k(G)$ has vertices representing the $k$-subsets of $V$, and two vertices are adjacent if their symmetric difference is the two…