Related papers: Small k-pairable states
A conflict-free k-coloring of a graph assigns one of k different colors to some of the vertices such that, for every vertex v, there is a color that is assigned to exactly one vertex among v and v's neighbors. Such colorings have…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a…
Perfect state transfer between qubits on a uniformly coupled network, with interactions specified by a graph, has advantages over an engineered chain, such as much faster transfer times (independent of the distance between the input and…
It is now experimentally possible to entangle thousands of qubits, and efficiently measure each qubit in parallel in a distinct basis. To fully characterize an unknown entangled state of $n$ qubits, one requires an exponential number of…
Non-symmetric GHZ states ($n$-GHZ$_\alpha$), defined by unequal superpositions of $|00...0>$ and $|11...1>$, naturally emerge in experiments due to decoherence, control errors, and state preparation imperfections. Despite their relevance in…
$k$-Uniform states are fundamental to quantum information and computing, with applications in multipartite entanglement and quantum error-correcting codes (QECCs). Prior work has primarily focused on constructing exact $k$-uniform states or…
Scalable graph states are essential for measurement-based quantum computation and many entanglement-assisted applications in quantum technologies. Generation of these multipartite entangled states requires a controllable and efficient…
$k$-uniform states are valuable resources in quantum information, enabling tasks such as teleportation, error correction, and accelerated quantum simulations. The practical realization of $k$-uniform states, at scale, faces major obstacles:…
All-photonic quantum repeaters are essential for establishing long-range quantum entanglement. Within repeater nodes, reliably performing entanglement swapping is a key component of scalable quantum communication. To tackle the challenge of…
Standard Bell inequalities hold when distant parties are not allowed to communicate. Barrett et al. found correlations from Pauli measurements on certain network graphs refute a local hidden variable (LHV) description even allowing some…
Greenberger-Horne-Zeilinger (GHZ) states are quantum states involving at least three entangled particles. They are of fundamental interest in quantum information theory, and the construction of such states of high dimension has various…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
The quantum marginal problem consists in deciding whether a given set of marginal reductions is compatible with the existence of a global quantum state or not. In this work, we formulate the problem from the perspective of dynamical systems…
We consider the problem whether graph states can be ground states of local interaction Hamiltonians. For Hamiltonians acting on n qubits that involve at most two-body interactions, we show that no n-qubit graph state can be the exact,…
We propose an extended quantum theory, in which the number K of parameters necessary to characterize a quantum state behaves as fourth power of the number N of distinguishable states. As the simplex of classical N-point probability…
We derive a general expression for standard tensor norm of $N$-body correlation tensors for $N$-qubit complete graph states. With the help of this expression, we formulate a separability criterion that identifies non-$k$-separability of a…
Let $G$ be a graph on $n$ vertices. We call a subset $A$ of the vertex set $V(G)$ \emph{$k$-small} if, for every vertex $v \in A$, $\deg(v) \le n - |A| + k$. A subset $B \subseteq V(G)$ is called \emph{$k$-large} if, for every vertex $u \in…
Efficiently sampling a quantum state that is hard to distinguish from a truly random quantum state is an elementary task in quantum information theory that has both computational and physical uses. This is often referred to as pseudorandom…
We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in…