We present an asymptotic bipartite entanglement-distillation protocol that outperforms all existing asymptotic schemes. This protocol is based on the breeding protocol with the incorporation of two-way classical communication. Like breeding, the protocol starts with an infinite number of copies of a Bell-diagonal mixed state. Breeding can be carried out as successive stages of partial information extraction, yielding the same result: one bit of information is gained at the cost (measurement) of one pure Bell state pair (ebit). The basic principle of our protocol is at every stage to replace measurements on ebits by measurements on a finite number of copies, whenever there are two equiprobable outcomes. In that case, the entropy of the global state is reduced by more than one bit. Therefore, every such replacement results in an improvement of the protocol. We explain how our protocol is organized as to have as many replacements as possible. The yield is then calculated for Werner states.
Despite the exponential overhead to describe general multiqubit quantum states and processes, efficient methods for certain state families and operations have been developed and utilized. The stabilizer formalism and the Gottesman-Knill theorem, where pure stabilizer or graph states are manipulated by Clifford operations and Pauli measurements, are prominent examples, and these states play a major role in many applications in quantum technologies. Here we develop a noisy stabilizer formalism, i.e., a method that allows one to efficiently describe and follow not only pure states under Clifford operations and Pauli measurements but also Pauli noise processes acting on such stabilizer states, including uncorrelated and correlated dephasing and single- or multiple-qubit depolarizing noise. The method scales linearly in the number of qubits of the initial state, but exponentially in the size of the target state. Thus, whenever a noisy stabilizer state is manipulated by means of local Pauli measurements such that a multipartite entangled state of a few qubits is generated, one can efficiently describe the resulting state.
Magic states enable universal, fault-tolerant quantum computation within the stabilizer framework. Their non-stabilizerness supplies the resource needed to bypass the Eastin-Knill theorem while allowing fault-tolerant distillation. Although many measures of magic exist, not every nonzero-magic state is known to be distillable, and many of currently known distillable states are special cases of Clifford-stabilizer states, defined as pure states uniquely stabilized by finite Clifford subgroups. We develop a general framework for group-covariant functionals on Hermitian operators, introducing the notions of
G-stabilizer spaces, states, and codes for arbitrary finite subgroups
G⊂U(H). We define analytic families of
G-covariant functionals and prove that any
G-invariant pure state is extremal for a broad class of derived functionals, including symmetric, max-type, and Rényi-type functionals, whenever the underlying family is
G-covariant. This extremality holds for purity-preserving variations orthogonal to the stabilized subspace. Specializing to the Pauli and Clifford groups, we recover the extremality structure of canonical magic measures such as mana, stabilizer Rényi entropies, generalized Rényi entropies, and stabilizer fidelity, and show that Clifford-stabilizer states extremize them. We classify such states for qubits, qutrits, ququints, and two-qubit systems, identifying new candidates for magic distillation. We further propose an inefficient distillation protocol for a two-qubit magic state with stabilizer fidelity exceeding standard benchmarks, and conjecture that SIC-POVM fiducial states are Clifford-stabilizer states.