Searcharxiv⌕ Search

arXiv subjects

Alexander Streltsov

Publications and source records attributed to Alexander Streltsov.

At least 19 recordsLinked to original sources

Correlated Catalysis Removes the Strong Converse for Entanglement Distillation

Entanglement distillation converts noisy shared quantum states into maximally entangled pairs using local operations and classical communication. The distillable entanglement $E_D$ determines the maximum asymptotic rate at which this process can be performed reliably. For several classes of quantum states, distillation above this rate obeys a strong converse: the fidelity with the target state vanishes asymptotically. Here we show that correlated catalysis removes the strong converse for every distillable bipartite state. Specifically, at any target rate $R>E_D$, the optimal asymptotic fidelity is given by $E_D/R$. Thus, although catalysis does not increase the maximum reliable distillation rate, it allows nonvanishing fidelity at every finite rate. Remarkably, this advantage persists even when the catalyst is returned exactly at every finite blocklength and the correlations between the output and catalyst vanish asymptotically. We further characterize the catalyst size required to sustain nonvanishing fidelity above the reliable distillation rate.

quant-ph↗

Entanglement Catalysis Beyond the Asymptotic Rate

Quantum entanglement is a fundamental resource in quantum information science, commonly consumed to perform tasks like quantum teleportation and quantum key distribution. Entanglement concentration converts partially entangled pure states into nearly perfect Bell pairs. While its efficiency is well understood in the asymptotic limit, practical protocols must operate with finite systems. In this finite regime, and at the low error levels relevant in practice, performance is penalized by corrections that reduce the achievable yield. We investigate whether this fundamental finite-size penalty can be mitigated by an entanglement catalyst: an auxiliary state that aids the transformation but is returned exactly and uncorrupted. Although such a catalyst cannot increase the leading-order asymptotic yield, we show that it fundamentally alters the finite-size scaling. For every bipartite pure state with nonuniform Schmidt coefficients, we exactly determine the optimal second-order correction to the yield and show that catalysis completely overcomes this finite-size penalty.

quant-ph↗

Total Ordering of Resources: A Quantum-Classical Separation

A central goal in quantum information science is understanding which physical states can be converted into others. The ideal scenario would be a totally ordered system, where every state can be ranked by a single value, and a higher-ranked state can always be converted into a lower-ranked one. Such an ordering would provide a complete description of state convertibility, making the resource structure maximally simple to characterize and compare. We prove that such a simple ordering is fundamentally impossible for any quantum system with dimension larger than 2. The underlying properties of quantum mechanics guarantee that some states will always be incomparable. Furthermore, we show this is a uniquely quantum phenomenon by constructing classical systems of any size that can be perfectly ranked. This establishes a rigorous and striking divide between quantum and classical state transformations.

quant-ph↗

Asymptotic Limits of Entanglement Transmission

Reliable distribution of quantum entanglement over long distances is a central challenge in quantum information science, fundamentally limited by decoherence in noisy communication channels. In this work, we investigate the asymptotic limits of entanglement distribution across homogeneous linear repeater chains with arbitrary intermediate LOCC processing. We establish a strict dichotomy: the asymptotic preservation of entanglement over arbitrarily long distances is possible if and only if the underlying quantum channel admits a correctable subspace. For channels lacking such a subspace, we prove that the transmitted state converges exponentially fast to the set of separable states, rendering standard LOCC filtering insufficient. To counteract this exponential degradation, we analyze ``networks'' employing parallel channel uses per link. We derive a fundamental lower bound on the required number of parallel channel uses per elementary link, proving that for broad classes of channels without a correctable subspace, the number of parallel channels per link must scale at least logarithmically with the number of intermediate stations to sustain a non-zero amount of entanglement. This provides a code-independent bound for the number of physical links for the considered homogeneous one-way architecture. For depolarizing noise below the corresponding coding threshold, the logarithmic lower bound is achievable.

quant-ph↗

PPT Entanglement with Correlated Catalysis: Monotones and Irreversibility

Quantum catalysts can overcome otherwise impossible quantum state transformations without being consumed, and allowing them to become correlated with the output makes this assistance substantially more powerful. This raises a fundamental question for entanglement theory: which limitations on state manipulation remain when such correlated catalysts are freely available? We answer this question in the positive-partial-transpose (PPT) resource theory, which allows a substantially broader class of operations than local operations and classical communication (LOCC). We identify general conditions under which regularized relative-entropy measures become strongly superadditive, and use them to construct monotones that constrain correlated catalytic PPT transformations without any knowledge of the catalyst. In particular, we prove that the regularized PPT relative entropy is fully additive and strongly superadditive, resolving an open problem in entanglement theory. Most importantly, these constraints show that even arbitrary correlated catalysts cannot restore asymptotic reversibility: for an explicit state, the optimal entanglement distillation rate remains strictly smaller than the entanglement cost. Thus, substantial catalytic assistance does not remove some of the fundamental limitations of mixed-state entanglement manipulation.

quant-ph↗

Entanglement battery and entanglement catalyst in local state discrimination problems

In this work, we study the limitations and advantages of using entanglement battery and entanglement catalyst in local state discrimination problems. We consider both cases of such tools, i.e., exact and approximate cases. We show that to distinguish any set of orthogonal pure bipartite entangled states perfectly under local operations and classical communication using an (exact) entanglement battery or an (exact) entanglement catalyst, it is necessary to consider that the cardinality of the set must be smaller than the total dimension of the given Hilbert space. Then, we construct a nontrivial case where an exact entanglement battery can provide huge advantage. We also construct other nontrivial cases where exact or approximate entanglement battery or entanglement catalyst can be useful. In fact, we find that the approximate tools are particularly useful in the local discrimination of certain sets which can be derived from many-copy indistinguishable ensembles.

quant-ph↗

Witness robustness: An operational quantifier of measurement resources via free state discrimination

We introduce the witness robustness of quantum measurements, a resource quantifier whose admissible noise consists of tuples of free-state witnesses rather than physical measurements. We establish its operational interpretation: it quantifies the maximal advantage that a measurement can provide over free measurements in discriminating an ensemble composed entirely of free states. Unlike the standard and generalized robustnesses, the witness robustness is not faithful in general, reflecting the fact that a resourceful measurement need not be useful when only free states can be prepared. We identify conditions under which faithfulness is recovered and show that, in resource theories admitting a resource-destroying map, the witness robustness vanishes for every measurement. We also establish fundamental properties, including convexity and monotonicity. Finally, we derive analytical results for projective measurements in single-qubit magic and for binary pure-state projective measurements in the two-qubit PPT entanglement theory.

quant-ph↗

Quantum Resources and Performance in the Initialization-Free Bernstein-Vazirani Algorithm

Naseri et al. [Phys. Rev. A 106, 062429 (2022); arXiv:2205.13610] studied which quantum resources in initial states are essential for the probabilistic Bernstein-Vazirani (BV) algorithm, defining its performance as the optimal average success probability over all measurements. In this work, we consider a variant of BV algorithm, which is called the initialization-free (IF) BV algorithm, in which an arbitrary ancilla state as the oracle register is allowed, to improve the performance. We derive an explicit formula for the performance of the probabilistic IF-BV algorithm and obtain a necessary and sufficient condition for an initial state to achieve maximal performance. We further prove that, under a suitable ordering assumption on the coefficients of the initial state, the probabilistic IF-BV algorithm outperforms the standard probabilistic BV algorithm.

quant-ph↗

Resourcefulness without Resource: Geometric Origins and Robustness

A prevailing intuition holds that quantum protocols using only free states confer no operational advantage. This intuition is contradicted by free-state discrimination gaps in which restricted measurements fail to optimally distinguish even orthogonal free states. Known instances include nonlocality without entanglement and, more recently, nonstabilizerness without magic. We trace these examples to a single convex-geometric mechanism: whenever the set of free measurements is closed, convex, and strict subset the set of all measurements, and the free states is a convex set with an interior, a gap-witnessing ensemble can be drawn entirely from the free states. The resulting gap is operationally rigid: no finite-dimensional assistance -- catalyst or quantum memory -- can asymptotically improve the discrimination rate beyond the single-shot restricted limit. By contrast, non-free ensembles admit memory-assisted attacks that fully erase the gap, exposing a sharp operational asymmetry between free and resource-carrying ensembles.

quant-ph↗

Advantage of flexible catalysis for entanglement and quantum thermodynamics

Understanding the fundamental limits of state convertibility is crucial for establishing the boundaries of quantum information processing and thermodynamic efficiency. While auxiliary systems, catalysts, can facilitate otherwise impossible transformations, standard catalysis rigidly requires the auxiliary system to return to its exact initial state. In this work, we investigate the power of flexible catalysis, where the catalyst evolves through a cycle of states, restoring its initial configuration only after a finite number of steps. Focusing on the regime of fixed, finite dimensions, we analyze the capabilities of flexible catalysis within the resource theories of entanglement and quantum thermodynamics. In the context of entanglement, we derive conditions limiting flexible catalysts, yet show that flexible catalysis can be strictly more powerful than same-dimensional standard catalysis: it enables deterministic transformations achievable by no standard catalyst of the same dimension, and it strictly increases the success probability of stochastic local operations and classical communication. A similar deterministic advantage arises in quantum thermodynamics, where flexible catalysis enables state transformations that are impossible with any standard catalyst of fixed dimension and Hamiltonian but become achievable via flexible catalysis.

quant-ph↗

Optimality of universal conclusive entanglement concentration protocols

Entanglement concentration is essential for quantum technologies, yet rigorous bounds on the success probability for universal protocols (those requiring no prior knowledge about the input state) have remained underexplored. We establish such fundamental limits for conclusive protocols distilling a perfect Bell state from pure two-qubit states by deriving the optimal success probability starting with two copies of a state with known Schmidt basis and four copies of a state with unknown Schmidt basis, using concatenated two-qubit operations. We prove that a known protocol achieves these bounds, confirming its optimality. Crucially, universality imposes an inherent efficiency trade-off, yielding an average success probability of just 2/105 over Haar measure.

quant-ph↗

ENTCALC: Toolkit for calculating geometric entanglement in multipartite quantum systems

We present entcalc, a Python and MATLAB package for estimating the geometric entanglement of multipartite quantum states. The package operates as follows: given a multipartite quantum state as input, it outputs an estimate of its geometric entanglement. For pure states, it computes the geometric entanglement together with an estimation error. For mixed states, it provides both lower and upper bounds on the geometric entanglement, thereby identifying an interval in which the true value lies. We provide several methods to compute the lower bound, enabling users to balance accuracy against computational cost. We apply entcalc to several representative examples, including for $3\otimes3$ PPT entangled states, mixtures of GHZ and W states, thermal states of selected three-qubit spin chains, and noisy GHZ and W states. We observe signatures of quantum phase transitions by quantifying entanglement in spin chains. We also demonstrate that entanglement between non-neighbouring sites can be activated by tuning the external magnetic field. In all tested cases, the gap between the lower and upper bounds is found to be very small, indicating that entcalc provides highly accurate estimates of the geometric entanglement for these states.

quant-ph↗

Stochastic approximate state conversion for entanglement and general quantum resource theories

Quantum resource theories provide a mathematically rigorous way of understanding the nature of various quantum resources. An important problem in any quantum resource theory is to determine how quantum states can be converted into each other within the physical constraints of the theory. The standard approach to this problem is to study approximate or probabilistic transformations. Here, we investigate the intermediate regime, providing limits on both, the fidelity and the probability of state transformations. We derive limitations on the transformations, which are valid in all quantum resource theories, by providing bounds on the maximal transformation fidelity for a given transformation probability. As an application, we show that these bounds imply an upper bound on the asymptotic rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels, which goes beyond the previously known bounds of channel manipulations. Furthermore, we completely solve the question of stochastic-approximate state conversion via local operations and classical communication in the following two cases: (i) Both initial and target states are pure bipartite entangled states of arbitrary dimensions. (ii) The target state is a two-qubit entangled state and the initial state is a pure bipartite state.

quant-ph↗

Robustness of quantum data hiding against entangled catalysts and memory

Quantum data hiding stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate whether this limitation can be overcome when the communicating parties are assisted by additional quantum resources. We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols and analyze their power to reveal hidden information. We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability, establishing the robustness of separable data-hiding schemes. In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly. Our results delineate the fundamental limits of catalytic and memory-assisted state discrimination and identify separable encodings as a robust strategy for quantum data hiding.

quant-ph↗

Optimizing entanglement distribution via noisy quantum channels

Entanglement distribution is a crucial problem in quantum information science, owing to the essential role that entanglement plays in enabling advanced quantum protocols, including quantum teleportation and quantum cryptography. We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels. Specifically, we compare two configurations: one where the entanglement source is placed at the midpoint of the communication line, and another where it is located at one end. For certain families of qubit channels we show analytically that the midpoint strategy is optimal. Based on extensive numerical analysis, we conjecture that this strategy is generally optimal for all qubit channels. Focusing on the midpoint configuration, we develop semidefinite programming (SDP) techniques to assess whether entanglement can be successfully distributed through the network, and to quantify the amount of entanglement that can be distributed in the process. In many relevant cases the SDP formulation reliably captures the maximal amount of entanglement which can be distributed, if entanglement is quantified using the negativity. We analyze several channel models and demonstrate that, for various combinations of amplitude damping and depolarizing noise, entanglement distribution is only possible with weakly entangled input states. Excessive entanglement in the input state can hinder the channel's ability to establish entanglement. Our findings have implications for optimizing entanglement distribution in realistic quantum communication networks.

quant-ph↗

Multipartite entanglement theory with entanglement-nonincreasing operations

A key problem in quantum information science is to determine optimal protocols for the interconversion of entangled states shared between remote parties. While for two parties a large number of results in this direction is available, the multipartite setting still remains a major challenge. In this article, this problem is addressed by extending the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. Specifically, we consider transformations capable of introducing a small, controllable increase of entanglement of a state, with the requirement that the increase can be made arbitrarily small. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states. Remarkably, this approach allows the reduction of tripartite entanglement to its bipartite analog, indicating that every pure tripartite state can be reversibly synthesized from a suitable number of singlets distributed between pairs of parties.

quant-ph↗

Second Law of Entanglement Manipulation with Entanglement Battery

A central question since the beginning of quantum information science is how two distant parties can convert one entangled state into another. It has been conjectured that such conversions could be executed reversibly in an asymptotic regime, mirroring the reversible nature of Carnot cycles in classical thermodynamics. While a conclusive proof of this conjecture has been missing so far, earlier studies have excluded reversible entanglement manipulation in various settings. In this work, we show that arbitrary mixed state entanglement transformations can be made reversible under local operations and classical communication, when assisted by an entanglement battery--an auxiliary quantum system that stores and supplies entanglement in a way that ensures no net entanglement is lost. In particular, the rate of transformation in the asymptotic limit can be quantitatively expressed as a ratio of entanglement present within the quantum states involved. Our setting allows to consider different entanglement quantifiers which give rise to unique principles governing state transformations, effectively constituting diverse manifestations of a ``second law'' of entanglement manipulation. These findings resolve a long-standing open question on the reversible manipulation of entangled states and are also applicable to multipartite entanglement and other quantum resource theories, including quantum thermodynamics.

quant-ph↗

Coherence manipulation in asymmetry and thermodynamics

In the classical regime, thermodynamic state transformations are governed by the free energy. This is also called as the second law of thermodynamics. Previous works showed that, access to a catalytic system allows us to restore the second law in the quantum regime when we ignore coherence. However, in the quantum regime, coherence and free energy are two independent resources. Therefore, coherence places additional non-trivial restrictions on the the state transformations, that remains elusive. In order to close this gap, we isolate and study the nature of coherence, i.e., we assume access to a source of free energy. We show that allowing catalysis along with a source of free energy allows us to amplify any quantum coherence present in the quantum state arbitrarily. Additionally, any correlations between the system and the catalyst can be suppressed arbitrarily. Therefore, our results provide a key step in formulating a fully general law of quantum thermodynamics.

quant-ph↗