dorsal/arxiv
View SchemaEntanglement on mixed stabiliser states--I: Normal Forms and Reduction Procedures
| Authors | Koenraad M. R. Audenaert, Martin B. Plenio |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0505036 |
| URL | https://arxiv.org/abs/quant-ph/0505036 |
| DOI | 10.1088/1367-2630/7/1/170 |
| Journal | New J. Phys. 7, 170 (2005) |
Abstract
The stabiliser formalism allows the efficient description of a sizeable class of pure as well as mixed quantum states of N-qubit systems. That same formalism has important applications in the field of quantum error correcting codes, where mixed stabiliser states correspond to projectors on subspaces associated with stabiliser codes. Here, we derive efficient reduction procedures to obtain various useful normal forms for stabiliser states. We explicitly prove that these procedures will always converge to the correct result and that these procedures are efficient in that they only require a polynomial number of operations on the generators of the stabilisers. We obtain two single-party normal forms. The simplest, the row-reduced echelon form, is useful to calculate partial traces of stabiliser states. The second is the fully reduced form and allows for the efficient calculation of the overlap between two stabiliser states, as well as of the Uhlmann fidelity between them, and their Bures distance. We also find a reduction procedure of bipartite stabiliser states, where the operations involved are restricted to be local ones. Using this two-party normal form, we prove that every bipartite mixed stabiliser state is locally equivalent to a direct product of a number of maximally entangled states and a separable state. Using this normal form we can efficiently calculate every reasonable bipartite entanglement measure of mixed stabiliser states.
{
"annotation_id": "561a068e-e0db-4242-bac7-3f02a368d13d",
"date_created": "2026-03-02T18:02:17.256000Z",
"date_modified": "2026-03-02T18:02:17.256000Z",
"file_hash": "8f362468555d5e5a0e5dd8b1a5d3a6a503a65f06f8e116e30a6b850507d24583",
"private": false,
"record": {
"abstract": "The stabiliser formalism allows the efficient description of a sizeable class\nof pure as well as mixed quantum states of N-qubit systems. That same formalism\nhas important applications in the field of quantum error correcting codes,\nwhere mixed stabiliser states correspond to projectors on subspaces associated\nwith stabiliser codes. Here, we derive efficient reduction procedures to obtain\nvarious useful normal forms for stabiliser states. We explicitly prove that\nthese procedures will always converge to the correct result and that these\nprocedures are efficient in that they only require a polynomial number of\noperations on the generators of the stabilisers.\n We obtain two single-party normal forms. The simplest, the row-reduced\nechelon form, is useful to calculate partial traces of stabiliser states. The\nsecond is the fully reduced form and allows for the efficient calculation of\nthe overlap between two stabiliser states, as well as of the Uhlmann fidelity\nbetween them, and their Bures distance.\n We also find a reduction procedure of bipartite stabiliser states, where the\noperations involved are restricted to be local ones. Using this two-party\nnormal form, we prove that every bipartite mixed stabiliser state is locally\nequivalent to a direct product of a number of maximally entangled states and a\nseparable state. Using this normal form we can efficiently calculate every\nreasonable bipartite entanglement measure of mixed stabiliser states.",
"arxiv_id": "quant-ph/0505036",
"authors": [
"Koenraad M. R. Audenaert",
"Martin B. Plenio"
],
"categories": [
"quant-ph"
],
"doi": "10.1088/1367-2630/7/1/170",
"journal_ref": "New J. Phys. 7, 170 (2005)",
"title": "Entanglement on mixed stabiliser states--I: Normal Forms and Reduction Procedures",
"url": "https://arxiv.org/abs/quant-ph/0505036"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "26193486-34f2-4a51-8012-c497a76850b7",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}