Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0809.3346

Homology of Generic Stabilizer States

Klaus Wirthmüller

Published Sep 19, 2008• 1 citation
arXivHTMLPDF

Abstract

This work is concerned with multi-party stabilizer states in the sense of quantum information theory. We investigate the homological invariants for states of which each party holds a large equal number N of quantum bits. We show that in many cases there is a generic expected value of the invariants: for large N it is approximated with arbitrarily high probability if a stabilizer state is chosen at random. The result suggests that typical entanglement of stabilizer states involves but the sets comprising just over one half of the parties. Our main tool is the Bruhat decomposition from the theory of finite Chevalley groups.

DOI
10.48550/arxiv.0809.3346

Related papers

Homological invariants of stabilizer states

Klaus Wirthmüller

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.

arXiv:quant-ph/0611131•Quantum Information and Computation•Jul 1, 2008•2 citations

Typical entanglement of stabilizer states

Graeme Smith, Debbie Leung

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 1. 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 Greenberger-Horne-Zeilinger states can be extracted from a random multipartite stabilizer state via local unitary operations. Our main tool is a concentration inequality which bounds deviations from the mean of random variables which are naturally defined on the Clifford group.

arXiv:quant-ph/0510232•Physical Review A•Dec 20, 2006•73 citations

Transformations of Stabilizer States in Quantum Networks

Matthias Englbrecht, Tristan Kraft, Barbara Kraus

Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC) transformations among stabilizer states. These transformations arise as a physically motivated extension of local operations in quantum networks with access to bipartite entanglement between some of the nodes of the network. First, we show that PLC transformations among graph states are equivalent to a generalization of the well-known local complementation, which describes local Clifford transformations among graph states. Then, we introduce a mathematical framework to study PLC equivalence of stabilizer states, relating it to the classification of tuples of bilinear forms. This framework allows us to study decompositions of stabilizer states into tensor products of indecomposable ones, that is, decompositions into states from the entanglement generating set (EGS). While the EGS is finite up to 3 parties [Bravyi et al., J. Math. Phys. 47 , 062106 (2006)], we show that for 4 and more parties it is an infinite set, even when considering party-local unitary transformations. Moreover, we explicitly compute the EGS for 4 parties up to 10 qubits. Finally, we generalize the framework to qudit stabilizer states in prime dimensions not equal to 2 , which allows us to show that the decomposition of qudit stabilizer states into states from the EGS is unique.

arXiv:2203.04202•Quantum•Oct 25, 2022•11 citations

GHZ extraction yield for multipartite stabilizer states

Sergey B. Bravyi, David A. Fattal, Daniel Gottesman

Let ∣Ψ⟩ be an arbitrary stabilizer state distributed between three remote parties, such that each party holds several qubits. Let S be a stabilizer group of ∣Ψ⟩. We show that ∣Ψ⟩ can be converted by local unitaries into a collection of singlets, GHZ states, and local one-qubit states. The numbers of singlets and GHZs are determined by dimensions of certain subgroups of S. For an arbitrary number of parties m we find a formula for the maximal number of m-partite GHZ states that can be extracted from ∣Ψ⟩ by local unitaries. A connection with earlier introduced measures of multipartite correlations is made. An example of an undecomposable four-party stabilizer state with more than one qubit per party is given. These results are derived from a general theoretical framework that allows one to study interconversion of multipartite stabilizer states by local Clifford group operators. As a simple application, we study three-party entanglement in two-dimensional lattice models that can be exactly solved by the stabilizer formalism.

arXiv:quant-ph/0504208•Journal of Mathematical Physics•Jun 1, 2006•59 citations

Aspects of generic entanglement

Patrick M. Hayden, Debbie Leung, Andreas Winter

We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the "concentration of measure" phenomenon, meaning that on a large-probability set these parameters are close to their expectation. For the entropy of entanglement, this has the counterintuitive consequence that there exist large subspaces in which all pure states are close to maximally entangled. This, in turn, implies the existence of mixed states with entanglement of formation near that of a maximally entangled state, but with negligible quantum mutual information and, therefore, negligible distillable entanglement, secret key, and common randomness. It also implies a very strong locking effect for the entanglement of formation: its value can jump from maximal to near zero by tracing over a number of qubits negligible compared to the size of total system. Furthermore, such properties are generic. Similar phenomena are observed for random multiparty states, leading us to speculate on the possibility that the theory of entanglement is much simplified when restricted to asymptotically generic states. Further consequences of our results include a complete derandomization of the protocol for universal superdense coding of quantum states.

•Jan 1, 2004•236 citations

Compatible conditions, entanglement, and invariants

Yong‐Jian Han, Yong-Sheng Zhang, Guang‐Can Guo

To find whether a set of reduced density matrixes come from a common multi-party state is a hard and important problem. In this paper, (1) we introduce a method to find out some polytopes in one-party eigenvalue-space which are sufficient conditions of this problem. (2) We point out that there are some relations between the compatible conditions and the entanglement of pure states. And we show this idea more clearly in the three-qubit case. (3) We investigate the relations between the compatibility problem and the invariants of a matrix-set under some groups. Furthermore, we show that it is one of the reasons why the compatibility problems which involve the multi-party density matrixes are much more difficult than the one-party case.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jan 11, 2005•1 citation
This work is concerned with multi-party stabilizer states in the sense of quantum information theory. We investigate the homological invariants for states of which each party holds a large equal number N of quantum bits. We show that in many cases there is a generic expected value of the invariants: for large N it is approximated with arbitrarily high probability if a stabilizer state is chosen at random. The result suggests that typical entanglement of stabilizer states involves but the sets comprising just over one half of the parties. Our main tool is the Bruhat decomposition from the theory of finite Chevalley groups.
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 1. 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 Greenberger-Horne-Zeilinger states can be extracted from a random multipartite stabilizer state via local unitary operations. Our main tool is a concentration inequality which bounds deviations from the mean of random variables which are naturally defined on the Clifford group.
Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC) transformations among stabilizer states. These transformations arise as a physically motivated extension of local operations in quantum networks with access to bipartite entanglement between some of the nodes of the network. First, we show that PLC transformations among graph states are equivalent to a generalization of the well-known local complementation, which describes local Clifford transformations among graph states. Then, we introduce a mathematical framework to study PLC equivalence of stabilizer states, relating it to the classification of tuples of bilinear forms. This framework allows us to study decompositions of stabilizer states into tensor products of indecomposable ones, that is, decompositions into states from the entanglement generating set (EGS). While the EGS is finite up to 3 parties [Bravyi et al., J. Math. Phys. 47 , 062106 (2006)], we show that for 4 and more parties it is an infinite set, even when considering party-local unitary transformations. Moreover, we explicitly compute the EGS for 4 parties up to 10 qubits. Finally, we generalize the framework to qudit stabilizer states in prime dimensions not equal to 2 , which allows us to show that the decomposition of qudit stabilizer states into states from the EGS is unique.
Let ∣Ψ⟩ be an arbitrary stabilizer state distributed between three remote parties, such that each party holds several qubits. Let S be a stabilizer group of ∣Ψ⟩. We show that ∣Ψ⟩ can be converted by local unitaries into a collection of singlets, GHZ states, and local one-qubit states. The numbers of singlets and GHZs are determined by dimensions of certain subgroups of S. For an arbitrary number of parties m we find a formula for the maximal number of m-partite GHZ states that can be extracted from ∣Ψ⟩ by local unitaries. A connection with earlier introduced measures of multipartite correlations is made. An example of an undecomposable four-party stabilizer state with more than one qubit per party is given. These results are derived from a general theoretical framework that allows one to study interconversion of multipartite stabilizer states by local Clifford group operators. As a simple application, we study three-party entanglement in two-dimensional lattice models that can be exactly solved by the stabilizer formalism.
We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the "concentration of measure" phenomenon, meaning that on a large-probability set these parameters are close to their expectation. For the entropy of entanglement, this has the counterintuitive consequence that there exist large subspaces in which all pure states are close to maximally entangled. This, in turn, implies the existence of mixed states with entanglement of formation near that of a maximally entangled state, but with negligible quantum mutual information and, therefore, negligible distillable entanglement, secret key, and common randomness. It also implies a very strong locking effect for the entanglement of formation: its value can jump from maximal to near zero by tracing over a number of qubits negligible compared to the size of total system. Furthermore, such properties are generic. Similar phenomena are observed for random multiparty states, leading us to speculate on the possibility that the theory of entanglement is much simplified when restricted to asymptotically generic states. Further consequences of our results include a complete derandomization of the protocol for universal superdense coding of quantum states.
To find whether a set of reduced density matrixes come from a common multi-party state is a hard and important problem. In this paper, (1) we introduce a method to find out some polytopes in one-party eigenvalue-space which are sufficient conditions of this problem. (2) We point out that there are some relations between the compatible conditions and the entanglement of pure states. And we show this idea more clearly in the three-qubit case. (3) We investigate the relations between the compatibility problem and the invariants of a matrix-set under some groups. Furthermore, we show that it is one of the reasons why the compatibility problems which involve the multi-party density matrixes are much more difficult than the one-party case.