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 using the Heisenberg interaction. This method can be conveniently implemented in various physical platforms, including superconducting, trapped-ion, and cold-atom systems. In order to characterize the entanglement of the output quantum state, we generalize the stabilizer formalism and develop an entanglement witness method. In particular, we design a generic searching algorithm to optimize entanglement witness with a minimal number of measurement settings under a given noise level. From the perspective of practical applications, we numerically study the trade-off between the experiment efficiency and the detection robustness.
We prove the strong super-additivity of the entanglement of formation for stabilizer pure states, and the set of mixed states which minimize their average entropy of entanglement as a mixture of stabilizer pure states sharing the same stabilizer group up to phases. The implications of the result on the additivity of the Holevo capacity of a quantum channel transmitting stabilizer states with Pauli noise is discussed.
Asymptotic Entanglement Hiding under Stabilizer Restrictions
School of Computer Science and Technology, University of Science and Technology of China（中国科学技术大学计算机科学与技术学院）；Hefei National Laboratory, University of Science and Technology of China（中国科学技术大学合肥国家实验室）；School of Software Engineering, University of Science and Technology of China（中国科学技术大学软件工程学院）；Suzhou Institute for Advanced Research, University of Science and Technology of China（中国科学技术大学苏州高等研究院）
We define a multi-partite entanglement measure for stabilizer states, which can be computed efficiently from a set of generators of the stabilizer group. Our measure applies to qubits, qudits and continuous variables.
In this paper, we show how to construct non-binary entanglement-assisted stabilizer quantum codes by using pre-shared entanglement between the sender and receiver. We also give an algorithm to determine the circuit for non-binary entanglement-assisted stabilizer quantum codes and some illustrated examples. The codes we constructed do not require the dual-containing constraint, and many non-binary classical codes, like non-binary LDPC codes, which do not satisfy the condition, can be used to construct non-binary entanglement-assisted stabilizer quantum codes.
The geometric measure, the logarithmic robustness and the relative entropy of entanglement are proved to be equal for a stabilizer quantum codeword. The entanglement upper and lower bounds are determined with the generators of code. The entanglement of dual-containing CSS codes, Gottesman codes and the related codes are given. An iterative algorithm is developed to determine the exact value of the entanglement when the two bounds are not equal.
Stabilizer states constitute a set of pure states which plays a dominant role in quantum error correction, measurement--based quantum computation, and quantum communication. Central in these applications are the local symmetries of these states. We characterize all local symmetries of arbitrary stabilizer states and provide an algorithm which determines them. We demonstrate the usefulness of these results by showing that the additional local symmetries find applications in entanglement theory and quantum error correction.
One of the problems concerning entanglement witnesses (EWs) is the construction of them by a given set of operators. Here several multi-qubit EWs called stabilizer EWs are constructed by using the stabilizer operators of some given multi-qubit states such as GHZ, cluster and exceptional states. The general approach to manipulate the multi-qubit stabilizer EWs by exact(approximate) linear programming (LP) method is described and it is shown that the Clifford group play a crucial role in finding the hyper-planes encircling the feasible region. The optimality, decomposability and non-decomposabil…
We present a method for multipartite entanglement purification of any stabilizer state shared by several parties. In our protocol each party measures the stabilizer operators of a quantum error-correcting code on his or her qubits. The parties exchange their measurement results, detect or correct errors, and decode the desired purified state. We give sufficient conditions on the stabilizer codes that may be used in this procedure and find that Steane's seven-qubit code is the smallest error-correcting code sufficient to purify any stabilizer state. An error-detecting code that encodes two qubi…
Local unitary stabilizer subgroups constitute powerful invariants for distinguishing various types of multipartite entanglement. In this paper, we show how stabilizers can be used as a basis for entanglement verification protocols on distributed quantum networks using minimal resources. As an example, we develop and analyze the performance of a protocol to verify membership in the space of Werner states, that is, multi-qubit states that are invariant under the action of any 1-qubit unitary applied to all the qubits.
Suppose in a quantum network, there are $n$ qubits hold by Alice, Bob and Charlie, denoted by systems $A$, $B$ and $C$, respectively. We require the qubits to be described by a stabilizer state and assume the system $A$ is entangled with the combined system $BC$. An interesting question to ask is when it is possible to transfer all the entanglement to system $A$ and $B$ by local operation on $C$ and classical communication to $AB$, namely \textit{entanglement trimming}. We find a necessary and sufficient condition and prove constructively for this entanglement trimming, which we name it as "th…
We study the entanglement properties of random pure stabilizer states in spin-1/2 particles. For two contiguous groups of spins of arbitrary size we obtain a compact and exact expression for the probability distribution for the entanglement values between the two sets. This allows for exact derivations of the average entanglement and the degree of concentration of measure around this average. We also give simple bounds on these quantities. We find that for large systems the average entanglement is near maximal and the measure is concentrated around it.
We classify, up to local unitary equivalence, local unitary stabilizer Lie algebras for symmetric mixed states into six classes. These include the stabilizer types of the Werner states, the GHZ state and its generalizations, and Dicke states. For all but the zero algebra, we classify entanglement types (local unitary equivalence classes) of symmetric mixed states that have those stabilizers. We make use of the identification of symmetric density matrices with polynomials in three variables with real coefficients and apply the representation theory of SO(3) on this space of polynomials.
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 tight characterization of the entanglement present in the maximally mixed state of a randomly chosen stabilizer code. Finally, we show that typically very few GHZ states can be extracted from a random multipartite stabilizer state via local unitary operations. Our main tool is a new concentration inequality which bounds deviations from the mean of random vari…
Having protected quantum information is essential to perform quantum computations. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and in particular this procedure removes the need for shared entanglement in entanglement-assisted quantum error-correcting codes, which is a result which could prove to be useful for fault-tolerant qudit, and even qubit, quantum computers.
We propose a scheme of multipartite entanglement distillation driven by a complementary pair of stabilizer measurements, to distill directly a wider range of states beyond the stabilizer code states (such as the Greenberger-Horne-Zeilinger states). We make our idea explicit by constructing a recurrence protocol for the 3-qubit W state. Noisy W states resulting from typical decoherence can be directly purified in a few steps, if their initial fidelity is larger than a threshold. For general input mixed states, we observe distillations to hierarchical fixed points, i.e., not only to the W state …
We show how to convert a quantum stabilizer code to a one-way or two-way entanglement distillation protocol. The proposed conversion method is a generalization of those of Shor-Preskill and Nielsen-Chuang. The recurrence protocol and the quantum privacy amplification protocol are equivalent to the protocols converted from [[2,1]] stabilizer codes. We also give an example of a two-way protocol converted from a stabilizer better than the recurrence protocol and the quantum privacy amplification protocol. The distillable entanglement by the class of one-way protocols converted from stabilizer cod…
We investigate how stabilizer theory can be used for constructing sufficient conditions for entanglement. First, we show how entanglement witnesses can be derived for a given state, provided some stabilizing operators of the state are known. These witnesses require only a small effort for an experimental implementation and are robust against noise. Second, we demonstrate that also nonlinear criteria based on uncertainty relations can be derived from stabilizing operators. These criteria can sometimes improve the witnesses by adding nonlinear correction terms. All our criteria detect states clo…
We study various distance-like entanglement measures of multipartite states under certain symmetries. Using group averaging techniques we provide conditions under which the relative entropy of entanglement, the geometric measure of entanglement and the logarithmic robustness are equivalent. We consider important classes of multiparty states, and in particular show that these measures are equivalent for all stabilizer states, symmetric basis and antisymmetric basis states. We rigorously prove a conjecture that the closest product state of permutation symmetric states can always be chosen to be …
This paper presents a method for enumerating all encoding operators in the Clifford group for a given stabilizer. Furthermore, we classify encoding operators into the equivalence classes such that EDPs (Entanglement Distillation Protocol) constructed from encoding operators in the same equivalence class have the same performance. By this classification, for a given parameter, the number of candidates for good EDPs is significantly reduced. As a result, we find the best EDP among EDPs constructed from [[4,2]] stabilizer codes. This EDP has a better performance than previously known EDPs over wi…
Consider a stabilizer state on $n$ qudits, each of dimension $D$ with $D$ being a prime or a squarefree integer, divided into three mutually disjoint sets or parts. Generalizing a result of Bravyi et al. [J. Math. Phys. \textbf{47}, 062106 (2006)] for qubits (D=2), we show that up to local unitaries on the three parts the state can be written as a tensor product of unentangled single-qudit states, maximally entangled EPR pairs, and tripartite GHZ states. We employ this result to obtain a complete characterization of the properties of a class of channels associated with stabilizer error-correct…
We find an interesting relationship between multipartite bound entangled states and the stabilizer formalism. We prove that if a set of commuting operators from the generalized Pauli group on $n$ qudits satisfy certain constraints, then the maximally mixed state over the subspace stabilized by them is an unlockable bound entangled state. Moreover, the properties of this state, such as symmetry under permutations of parties, undistillability and unlockability, can be easily explained from the stabilizer formalism without tedious calculation. In particular, the four-qubit Smolin state and its re…
Entanglement of superpositions in zero-energy subspace: insights from stabilizer theory
Faculty of Physics, M.V. Lomonosov Moscow State University（莫斯科国立大学物理系）；Skolkovo Institute of Science and Technology（斯科尔科沃科学技术研究所）；Artificial Intelligence Research Institute (AIRI)（人工智能研究院）
We propose a new kind of invariant of multi-party stabilizer states with respect to local Clifford equivalence. These homological invariants are discrete entities defined in terms of the entanglement a state enjoys with respect to arbitrary groupings of the parties, and they may be thought of as reflecting entanglement in a qualitative way. We investigate basic properties of the invariants and link them with known results on the extraction of GHZ states.
An Entanglement-Assisted Stabilizer Framework for Distributed Sensing of Local Phases
School of Electrical Engineering, Korea University（韩国大学电气工程学院）；Quantum Network Research Center, Korea Institute of Science and Technology Information（韩国科学技术信息研究院量子网络研究中心）
We investigate the entanglement-renormalization group flows of translation-invariant topological stabilizer models in three dimensions. Fracton models are observed to bifurcate under entanglement renormalization, generically returning at least one copy of the original model. Based on this behavior we formulate the notion of bifurcated equivalence for fracton phases, generalizing foliated fracton equivalence. The notion of quotient superselection sectors is also generalized accordingly. We calculate bifurcating entanglement-renormalization group flows for a wide range of examples and, based on …
We propose a method to calculate the purity of reduced states of graph states entirely within the stabilizer formalism, using only the stabilizer generators for a given state. We apply this method to find the Concentratable Entanglement of graph states, with examples including a single qubit within any graph state, states proposed for use in quantum repeaters and states that maximise and minimise the overall Concentratable Entanglement.
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum entanglement in quantum programs is necessary. Several papers studied the problem. They decided qubits were entangled if multiple qubits unitary gates are applied to them, and some refined this reasoning using information about the state of each separated qubit. However, they do not care about the fact that unitary gate undoes entanglement and that measurement may …
School of Physics, Peking University（北京大学物理学院）；Department of Physics, Virginia Tech（弗吉尼亚理工大学物理系）；Center for High Energy Physics, Peking University（北京大学高能物理中心）
The central focus of this work is to make progress towards understanding entanglement as a resource for computation by examining the quantum correlations that can be extracted from stabilizer states. As such, we focus on the stabilizer formalism, local realism, and the convergence of the two.
We refine recent local unitary entanglement classification for symmetric pure states of $n$ qubits (that is, states invariant under permutations of qubits) using local unitary stabilizer subgroups and Majorana configurations. Stabilizer subgroups carry more entanglement distinguishing power than do the stabilizer subalgebras used in our previous work. We extend to mixed states recent results about local operations on pure symmetric states by showing that if two symmetric density operators are equivalent by a local unitary operation, then they are equivalent via a local unitary operation that i…
Despite the fundamental importance of quantum entanglement in many-body systems, our understanding is mostly limited to bipartite situations. Indeed, even defining appropriate notions of multipartite entanglement is a significant challenge for general quantum systems. In this work, we initiate the study of multipartite entanglement in a rich, yet tractable class of quantum states called stabilizer tensor networks. We demonstrate that, for generic stabilizer tensor networks, the geometry of the tensor network informs the multipartite entanglement structure of the state. In particular, we show t…
The scheme of entanglement-assisted quantum error-correcting (EAQEC) codes assumes that the ebits of the receiver are error-free. In practical situations, errors on these ebits are unavoidable, which diminishes the error-correcting ability of these codes. We consider two different versions of this problem. We first show that any (nondegenerate) standard stabilizer code can be transformed into an EAQEC code that can correct errors on the qubits of both sender and receiver. These EAQEC codes are equivalent to standard stabilizer codes, and hence the decoding techniques of standard stabilizer cod…
We consider the transformation of Hamilton operators under various sets of quantum operations acting simultaneously on all adjacent pairs of particles. We find mappings between Hamilton operators analogous to duality transformations as well as exact characterizations of ground states employing non-Hermitean eigenvalue equations and use this to motivate a generalization of the stabilizer formalism to non-Hermitean operators. The resulting class of states is larger than that of standard stabilizer states and allows for example for continuous variation of local entropies rather than the discrete …
