Related papers: Localizing genuine multiparty entanglement in nois…
Graph and hypergraph states are important resource states for realizing universal quantum computation and diverse non-local physical phenomena. However, noise learning in such states is challenging due to their large entanglement and magic.…
We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…
In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…
We study the entanglement properties of randomized mixed hypergraph states, extending the concept of randomized mixed graph states to encompass hypergraph-based quantum states. In our model, imperfect generalized multi-qubit gates are…
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…
We investigate the patterns in distributions of localizable entanglement over a pair of qubits for random multi-qubit pure states. We observe that the mean of localizable entanglement increases gradually with increasing the number of qubits…
A bottleneck for analyzing the interplay between magic and entanglement is the computation of these quantities in highly entangled quantum many-body magic states. Efficient extraction of entanglement can also inform our understanding of…
We study the robustness of the GHZ (or ``cat'') class of multi-partite states under decoherence. The noise model is described by a general completely positive map for qubits independently coupled to the environment. In particular, the…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite…
The generation and verification of large-scale entanglement are essential to the development of quantum technologies. In this paper, we present an efficient scheme to generate genuine multipartite entanglement of a large number of qubits by…
We study experimentally and numerically the noisy evolution of multipartite entangled states, focusing on superconducting-qubit devices accessible via the cloud. We find that a valid modeling of the dynamics requires one to properly account…
Graph states are entangled states useful for several quantum information processing tasks such as measurement-based quantum computation and quantum metrology. As the size of graph states realized in experiments increases, it becomes more…
Localizability of entanglement in fully inseparable states is a key ingredient of assisted quantum information protocols as well as measurement-based models of quantum computing. We investigate the existence of fully inseparable states with…
We study dynamics of genuine entanglement for quantum states of three and four qubits under non-Markovian dephasing. Using a computable entanglement monotone for multipartite systems, we find that GHZ state is quite resilient state whereas…
The quantum entanglement as one of very important resources has been widely used in quantum information processing. In this work, we present a new kind of genuine multipartite entanglement. It is derived from special geometric feature of…
Experimentally quantifying entanglement and coherence are extremely important for quantum resource theory. However, because the quantum state tomography requires exponentially growing measurements with the number of qubits, it is hard to…
The nonstabilizerness of quantum states is a necessary resource for universal quantum computation, yet its characterization is notoriously demanding. Quantifying nonstabilizerness typically requires an exponential number of measurements and…
We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace…
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…