相关论文: Small k-pairable states

We study the notion of $k$-stabilizer universal quantum state, that is, an $n$-qubit quantum state, such that it is possible to induce any stabilizer state on any $k$ qubits, by using only local operations and classical communications.…

Motivated by quantum network applications over classical channels, we initiate the study of $n$-party resource states from which LOCC protocols can create EPR-pairs between any $k$ disjoint pairs of parties. We give constructions of such…

We discuss the construction of $n$-qubit pure states with maximum bipartite entanglement across all possible choices of $k$ vs $n-k$ bi-partitioning, which implies that the Von Neumann entropy of every $k$-qubit reduced density matrix…

Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…

Answering a question of Claudet, we prove that the uniformly random graph $G\sim \mathbb G(n, 1/2)$ is $\Omega(\sqrt n)$-vertex-minor universal with high probability. That is, for some constant $\alpha\approx 0.911$, any graph on any…

We investigate the problem of compiling the generation of graph states to arbitrarily many distributed homogeneous quantum processing units (QPUs), providing a scalable partitioning algorithm and graph state generation protocol to minimize…

We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…

We introduce a new family of quantum secret sharing protocols with limited quantum resources which extends the protocols proposed by Markham and Sanders and by Broadbent, Chouha, and Tapp. Parametrized by a graph G and a subset of its…

Quantum graph state is a special class of nonlocal state among multiple quantum particles, underpinning several nonclassical and promising applications such as quantum computing and quantum secret sharing. Recently, establishing quantum…

Graph states are a class of multi-partite entangled quantum states that are ubiquitous in quantum information. We study equivalence relations between graph states under local unitaries (LU) to obtain distinguishing methods both in local and…

Random K-out graphs are used in several applications including modeling by sensor networks secured by the random pairwise key predistribution scheme, and payment channel networks. The random K-out graph with $n$ nodes is constructed as…

Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…

Critical to the construction of large scale quantum networks, i.e. a quantum internet, is the development of fast algorithms for managing entanglement present in the network. One fundamental building block for a quantum internet is the…

A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…

We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and…

Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled…

A pure quantum state is called $k$-uniform if all its reductions to $k$-qudit are maximally mixed. We investigate the general constructions of $k$-uniform pure quantum states of $n$ subsystems with $d$ levels. We provide one construction…

We propose a scalable and deterministic protocol for growing large multi-qubit states starting from two-qubit non-maximally entangled pure states, where the bipartite entanglement in the resultant state is higher than the maximum of the…

We study $k$-uniform states in heterogeneous systems whose local dimensions are mixed. Based on the connections between mixed orthogonal arrays with certain minimum Hamming distance, irredundant mixed orthogonal arrays and $k$-uniform…

In the Quantum Internet, multipartite entanglement enables a rich and dynamic overlay topology, referred to as artificial topology, upon the physical one, that can be exploited for communication purposes. In fact, the ability to extract…