Related papers: Localizing genuine multiparty entanglement in nois…
We investigate the robustness of genuine multiparticle entanglement under decoherence. We consider different kinds of entangled three- and four-qubit states as well as random pure states. For amplitude damping noise, we find that the W-type…
Detection of entanglement is an indispensable step to practical quantum computation and communication. Compared with the conventional entanglement witness method based on fidelity, we propose a flexible, machine learning assisted…
How entangled is a randomly chosen bipartite stabilizer state? We show that if the number of qubits each party holds is large the state will be close to maximally entangled with probability exponentially close to one. We provide a similar…
We consider two measures of entanglement, the logarithmic negativity and the entanglement entropy, between regions of space in excited states of many-body systems formed by a finite number of particle excitations. In parts I and II of the…
Sharing genuine multipartite entanglement by considering collective use of copies of biseparable states, which are entangled across all bipartitions but lack genuine multipartite entanglement at the single-copy level, plays a central role…
This paper is to investigate the effects of quantum noises on entanglement localization by taking an example of reducing a three-qubit Greenberger-Horne-Zeilinger (GHZ) state to a two-qubit entangled state. We consider, respectively, two…
We present multiparty entanglement purification protocols that are capable of purifying arbitrary graph states directly. We develop recurrence and breeding protocols and compare our methods with strategies based on bipartite entanglement…
We construct a simplex for multipartite qubit states of even number n of qubits, which has the same geometry concerning separability, mixedness, kind of entanglement, amount of entanglement and nonlocality as the bipartite qubit states. We…
We introduce magic measures to quantify the nonstabilizerness of multiqubit quantum gates and establish lower bounds on the $T$ count for fault-tolerant quantum computation. First, we introduce the stabilizer nullity of multi-qubit unitary,…
It is known that if the quantum gates in a proposed quantum computer are so noisy that they are incapable of generating entanglement, then the device can be efficiently simulated classically. If the measurements and single particle…
We introduce a potential of multipartite entanglement for a system of n qubits, as the average over all balanced bipartitions of a bipartite entanglement measure, the purity. We study in detail its expression and look for its minimizers,…
As quantum technology advances and the size of quantum computers grow, it becomes increasingly important to understand the extent of quality in the devices. As large-scale entanglement is a quantum resource crucial for achieving quantum…
Whether noisy quantum devices without error correction can provide quantum advantage over classical computers is a critical issue of current quantum computation. In this work, the random quantum circuits, which are used as the paradigm…
Highly entangled multipartite states such as k-uniform (k-UNI) and absolutely maximally entangled (AME) states serve as critical resources in quantum networking and other quantum information applications. However, there does not yet exist a…
Vast developments in quantum technology have enabled the preparation of quantum states with more than a dozen entangled qubits. The full characterization of such systems demands distinct constructions depending on their specific type and…
Verifying prepared quantum states is crucial for hybrid systems whose subsystems may have different local dimensions. We present a generalized stabilizer framework and associated test that apply to general multi-qudit states, including…
We present a theoretical method to determine the multipartite entanglement between different partitions of multimode, fully or partially symmetric Gaussian states of continuous variable systems. For such states, we determine the exact…
The dependence of quantum algorithms on state fidelity is difficult to characterize analytically and is best explored experimentally as hardware scales and noisy simulations become intractable. While low fidelity states are often…
In quantum networks, eliminating connections between nodes is crucial to mitigate the effects of decoherence, often achieved by performing measurements on nodes that are idle, or vulnerable to noise. To characterize the entanglement content…
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a…