Related papers: Asymptotic magic state distillation with almost li…
A multipartite quantum state violates a Bell inequality asymptotically if, after jointly processing by general local operations an arbitrarily large number of copies of it, the result violates the inequality. In the bipartite case we show…
We describe a protocol for distilling maximally entangled bipartite states between random pairs of parties from those sharing a tripartite W state, and show that, rather surprisingly, the total distillation rate (the total number of EPR…
Quantum network states are multipartite states built from distributing pairwise entanglement among parties and underpin the paradigm of quantum networks for quantum information processing. In this work we introduce the problem of partial…
Quantum error correction is a cornerstone of reliable quantum computing, with surface codes emerging as a prominent method for protecting quantum information. Surface codes are efficient for Clifford gates but require magic state…
Magic state cultivation is a leading approach for generating the resource states required for fault-tolerant quantum computation. Here we present a new cultivation protocol that increases the success probability of magic-state generation in…
We construct new entanglement distillation protocols by interpolating between the recurrence and hashing protocols. This leads to asymptotic two-way distillation protocols, resulting in an improvement of the distillation rate for all mixed…
Among the most fundamental questions in the manipulation of quantum resources such as entanglement is the possibility of reversibly transforming all resource states. The key consequence of this would be the identification of a unique…
We provide generalizations of known two-qubit entanglement distillation protocols for arbitrary Hilbert space dimensions. The protocols, which are analogues of the hashing and breeding procedures, are adapted to bipartite quantum states…
On-policy distillation (OPD) has become a core technique in the post-training of large language models, yet its training dynamics remain poorly understood. This paper provides a systematic investigation of OPD dynamics and mechanisms. We…
Within entanglement theory there are criteria which certify that some quantum states cannot be distilled into pure entanglement. An example is the positive partial transposition criterion. Here we present, for the first time, the analogous…
Magic quantum states (non-stabilizer states) play a pivotal role in fault-tolerant quantum computation. Simultaneously, random resources have emerged as a key element in various randomized techniques within contemporary quantum science. In…
With the advent of practical quantum communication networks drawing closer, there is a growing need for reliable estimation protocols that can efficiently characterize quantum resources with minimum resource overhead requirement. A novel…
We study exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we…
We investigate the design aspects of feature distillation methods achieving network compression and propose a novel feature distillation method in which the distillation loss is designed to make a synergy among various aspects: teacher…
Any physical quantum device for quantum information processing is subject to errors in implementation. In order to be reliable and efficient, quantum computers will need error correcting or error avoiding methods. Fault-tolerance achieved…
We complete the task of optimal probabilistic coherence distillation protocol, whose aim is to transform a general state into a set of n-level maximally coherent states via strictly incoherent operations (SIO). Specifically, we present the…
We study the properties of the random quantum states induced from the uniformly random pure states on a bipartite quantum system by taking the partial trace over the larger subsystem. Most of the previous studies have adopted a viewpoint of…
The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…
For certain quantum architectures and algorithms, most of the required resources are consumed during the distillation of one-qubit magic states for use in performing Toffoli gates. I show that the overhead for magic-state distillation can…
Quantum low-density parity-check (qLDPC) codes can encode many logical qubits within a single code block at low physical qubit overhead, yet magic state injection into such codes remains largely underexplored. Existing state injection…