相关论文: Small k-pairable states

Contextuality is one of the fundamental deviations of quantum mechanics from classical physics. The Kochen-Specker (KS) theorem shows that non-contextual classical physics with hidden variables is inconsistent with the predictions of…

An edge-coloured graph $G$ is called $properly$ $connected$ if every two vertices are connected by a proper path. The $proper$ $connection$ $number$ of a connected graph $G$, denoted by $pc(G)$, is the smallest number of colours that are…

Let $G$ be a graph of order $n$ and let $u,v$ be vertices of $G$. Let $\kappa_G(u,v)$ denote the maximum number of internally disjoint $u$-$v$ paths in $G$. Then the average connectivity $\overline{\kappa}(G)$ of $G$, is defined as $…

We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires…

The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error…

In this paper, we consider the question of computing sparse subgraphs for any input directed graph $G=(V,E)$ on $n$ vertices and $m$ edges, that preserves reachability and/or strong connectivity structures. We show $O(n+\min\{|{\cal…

Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However…

Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states…

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from…

The quantum switch is a basic network primitive that allows one to connect multiple nodes in a quantum network via a central node. We show that the same functionality can be achieved with a different geometry that does not rely on a…

We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…

This article delves into an analysis of the intrinsic entanglement and separability feature in quantum states as depicted by graph Laplacian. We show that the presence or absence of edges in the graph plays a pivotal role in defining the…

Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC)…

Stabilizer states form a ubiquitous family of quantum states that can be graphically represented through the graph state formalism. A fundamental property of graph states is that applying a local complementation - a well-known and…

The class of entangled $N$-qubit states known as graph states, and the corresponding stabilizer groups of $N$-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum…

The entanglement properties of a multiparty pure state are invariant under local unitary transformations. The stabilizer dimension of a multiparty pure state characterizes how many types of such local unitary transformations existing for…

A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ…

A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…

Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a…

We investigate the maximum purity that can be achieved by k-uniform mixed states of N parties. Such N-party states have the property that all their k-party reduced states are maximally mixed. A scheme to construct explicitly k-uniform…