Entanglement on mixed stabiliser states--I: Normal Forms and Reduction Procedures
arXiv:quant-ph/0505036 · doi:10.1088/1367-2630/7/1/170
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.
arXiv comment13 pages. Replaced with published version. Mistake in result about Uhlmann fidelity corrected
References in corpus (16)
- Three qubits can be entangled in two inequivalent ways
- Persistent entanglement in arrays of interacting particles
- Multi-party entanglement in graph states
- Stabilizer Codes and Quantum Error Correction
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Graphical description of the action of local Clifford transformations on graph states
- Entanglement in Quantum Information Theory
- Bell Inequalities for Graph States
- Multiparticle entanglement purification for graph states
- Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
- An efficient algorithm to recognize local Clifford equivalence of graph states
- Local unitary versus local Clifford equivalence of stabilizer states
- Multi-particle entanglement manipulation under positive partial transpose preserving operations
- Tripartite entanglement and quantum relative entropy
- The invariants of the local Clifford group
Cited by in corpus (35)
- Area laws for the entanglement entropy - a review
- Dynamical purification phase transitions induced by quantum measurements
- Entanglement Certification From Theory to Experiment
- Efficient Generation of Generic Entanglement
- Emergence of typical entanglement in two-party random processes
- Typical entanglement of stabilizer states
- Correlation measures and the entanglement wedge cross-section after quantum quenches in two-dimensional conformal field theories
- Entanglement and local information access for graph states
- Entanglement growth in diffusive systems
- Two-setting Bell Inequalities for Graph States
- Photonic resource state generation from a minimal number of quantum emitters
- Symmetries in quantum networks lead to no-go theorems for entanglement distribution and to verification techniques
- Characterization of an operational quantum resource in a critical many-body system
- Entanglement of Local Operators and the Butterfly Effect
- Infinite-randomness criticality in monitored quantum dynamics with static disorder
- LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States
- Quantum-enhanced metrology with network states
- Stabilizer notation for Spekkens' toy theory
- Absolutely maximally entangled states, quantum maximum distance separable codes, and quantum repeaters
- Quantum Non-Local Nonstabilizerness
- -uniform mixed states
- Efficient Inner-product Algorithm for Stabilizer States
- Analysis of Quantum Entanglement in Quantum Programs using Stabilizer Formalism
- Remarks on Duality Transformations and Generalized Stabilizer States
- Quantum LOSR networks cannot generate graph states with high fidelity
- A universal crossover in quantum circuits governed by a proximate classical error correction transition
- Universal Spreading of Conditional Mutual Information in Noisy Random Circuits
- Engineering holography with stabilizer graph codes
- GraphiQ: Quantum circuit design for photonic graph states
- Fast algorithms for classical specifications of stabiliser states and Clifford gates
- Memory-corrected quantum repeaters with adaptive syndrome identification
- Characterization of non-adaptive Clifford channels
- Simulation of Quantum Circuits via Stabilizer Frames
- Agnostic Tomography of Stabilizer Product States
- A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra