TKTulja Varun Kondra

Tulja Varun Kondra

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Tulja Varun Kondra has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Optimality of universal conclusive entanglement concentration protocols

    by Alexandre C. Orthey, Aby Philip, Tulja Varun Kondra, Alexander Streltsov

  • Open Access

    Optimality of universal conclusive entanglement purification protocols

    by Alexandre C. Orthey, Aby Philip, Tulja Varun Kondra, Alexander Streltsov

    Entanglement purification 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 perfect Bell states from a 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. 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.

  • Second Law of Entanglement Manipulation with an Entanglement Battery

    by Ray Ganardi, Tulja Varun Kondra, Nelly H. Y. Ng, Alexander Streltsov

    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 Letter, 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 us 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.


  • Catalytic and Asymptotic Equivalence for Quantum Entanglement

    by Ray Ganardi, Tulja Varun Kondra, Alexander Streltsov

    Entanglement is a fundamental resource in quantum information processing, yet understanding its manipulation and transformation remains a challenge. Many tasks rely on highly entangled pure states, but obtaining such states is often challenging due to the presence of noise. Typically, entanglement manipulation procedures involving asymptotically many copies of a state are considered to overcome this problem. These procedures allow for distilling highly entangled pure states from noisy states, which enables a wide range of applications, such as quantum teleportation and quantum cryptography. When it comes to manipulating entangled quantum systems on a single copy level, using entangled states as catalysts can significantly broaden the range of achievable transformations. Similar to the concept of catalysis in chemistry, the entangled catalyst is returned unchanged at the end of the state manipulation procedure. Our results demonstrate that despite the apparent conceptual differences between the asymptotic and catalytic settings, they are actually strongly connected and fully equivalent for all distillable states. Our methods rely on the analysis of many-copy entanglement manipulation procedures which may establish correlations between different copies. As an important consequence, we demonstrate that using an entangled catalyst cannot enhance the asymptotic singlet distillation rate of a distillable quantum state. Our findings provide a comprehensive understanding of the capabilities and limitations of both catalytic and asymptotic state transformations of entangled states, and highlight the importance of correlations in these processes.


  • Open Access

    Resource theory of imaginarity in distributed scenarios

    by Kang-Da Wu, Tulja Varun Kondra, Carlo Maria Scandolo, Swapan Rana, Guo-Yong Xiang, Chuan-Feng Li, Guang-Can Guo, Alexander Streltsov

    The resource theory of imaginarity studies the operational value of imaginary parts in quantum states, operations, and measurements. Here we introduce and study the distillation and conversion of imaginarity in distributed scenario. This arises naturally in bipartite systems where both parties work together to generate the maximum possible imaginarity on one of the subsystems. We give exact solutions to this problem for general qubit states and pure states of arbitrary dimension. We present a scenario that demonstrates the operational advantage of imaginarity: the discrimination of quantum channels without the aid of an ancillary system. We then link this scenario to local operations and classical communications(LOCC) discrimination of bipartite states. We experimentally demonstrate the relevant assisted distillation protocol, and show the usefulness of imaginarity in the aforementioned two tasks.


  • Coherence Manipulation in Asymmetry and Thermodynamics

    by Tulja Varun Kondra, Ray Ganardi, Alexander Streltsov

    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 nontrivial restrictions on the state transformations that remain 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.


  • Open Access

    Entanglement catalysis for quantum states and noisy channels

    by Chandan Datta, Tulja Varun Kondra, Marek Miller, Alexander Streltsov

    Many applications of the emerging quantum technologies, such as quantum teleportation and quantum key distribution, require singlets, maximally entangled states of two quantum bits. It is thus of utmost importance to develop optimal procedures for establishing singlets between remote parties. As has been shown very recently, singlets can be obtained from other quantum states by using a quantum catalyst, an entangled quantum system which is not changed in the procedure. In this work we take this idea further, investigating properties of entanglement catalysis and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst, which can enable all possible transformations in this setup. We demonstrate the advantage of catalysis in asymptotic settings, going beyond the typical assumption of independent and identically distributed systems. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel when assisted by entangled catalysts. For various types of quantum channels our results lead to optimal protocols, allowing to establish the maximal number of singlets with a single use of the channel.


  • Open Access

    Real quantum operations and state transformations

    by Tulja Varun Kondra, Chandan Datta, Alexander Streltsov

    Resource theory of imaginarity provides a useful framework to understand the role of complex numbers, which are essential in the formulation of quantum mechanics, in a mathematically rigorous way. In the first part of this article, we study the properties of ``real'' (quantum) operations both in single-party and bipartite settings. As a consequence, we provide necessary and sufficient conditions for state transformations under real operations and show the existence of ``real entanglement'' monotones. In the second part of this article, we focus on the problem of single copy state transformation via real quantum operations. When starting from pure initial states, we completely solve this problem by finding an analytical expression for the optimal fidelity of transformation, for a given probability of transformation and vice versa. Moreover, for state transformations involving arbitrary initial states and pure final states, we provide a semidefinite program to compute the optimal achievable fidelity, for a given probability of transformation.

  • Entanglement and coherence in the Bernstein-Vazirani algorithm

    by Moein Naseri, Tulja Varun Kondra, Suchetana Goswami, Marco Fellous-Asiani, Alexander Streltsov

    Quantum algorithms can outperform their classical counterparts in various tasks, the most prominent example being Shor's algorithm for efficient prime factorization on a quantum computer. It is clear that one of the reasons for the speedup is the superposition principle of quantum mechanics, which allows a quantum processor to be in a superposition of different states at the same time. While such a superposition can lead to entanglement across different qubits of the processors, there also exist quantum algorithms that outperform classical ones using superpositions of individual qubits without entangling them. As an example, the Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. While the classical version of the algorithm requires multiple calls of the oracle to learn the bit string, a single query of the oracle is enough in the quantum case. In this article, we analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. For this, we introduce and study its probabilistic version, where the goal is to guess the bit string after a single call of the oracle. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state. We further demonstrate that a large amount of entanglement in the initial state prevents the algorithm from achieving optimal performance. We also apply our methods to quantum computation with mixed states, proving that pseudopure states achieve optimal performance for a given purity in the Bernstein-Vazirani algorithm. We further investigate quantum resources in the one clean qubit model, showing that the model can exhibit speedup over any known classical algorithm even with an arbitrarily little amount of multipartite entanglement, general quantum correlations, and coherence.


  • Open Access

    Entanglement and coherence in Bernstein-Vazirani algorithm

    by Moein Naseri, Tulja Varun Kondra, Suchetana Goswami, Marco Fellous-Asiani, Alexander Streltsov

    Quantum algorithms allow to outperform their classical counterparts in various tasks, most prominent example being Shor's algorithm for efficient prime factorization on a quantum computer. It is clear that one of the reasons for the speedup is the superposition principle of quantum mechanics, which allows a quantum processor to be in a superposition of different states at the same time. While such superposition can lead to entanglement across different qubits of the processors, there also exists quantum algorithms which outperform classical ones using superpositions of individual qubits without entangling them. As an example, the Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. While the classical version of the algorithm requires multiple calls of the oracle to learn the bit string, a single query of the oracle is enough in the quantum case. In this Letter, we analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. For this, we introduce and study its probabilistic version, where the goal is to guess the bit string after a single call of the oracle. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state. We further demonstrate that a large amount of entanglement in the initial state prevents the algorithm from achieving optimal performance. We also apply our methods to quantum computation with mixed states, proving that pseudopure states achieve optimal performance for a given purity in the Bernstein-Vazirani algorithm. We further investigate quantum resources in the one clean qubit model, showing that the model can exhibit speedup over any known classical algorithm even with arbitrary little amount of multipartite entanglement, general quantum correlations, and coherence.