SearcharxivSearch

arXiv subjects

Indranil Chakrabarty

Publications and source records attributed to Indranil Chakrabarty.

At least 19 recordsLinked to original sources

Characterizing pairwise swapping capabilities of dense coding channels

We introduce a novel multipartite entanglement-assisted classical communication task, referred to as dense coding swapping, in which legitimate parties collaboratively swap the dense codeability from one communication channel to another through suitable joint unitary operations. Due to the dense coding (DC) exclusion principle, the scheme enhances the dense codeability of a target pair while simultaneously reducing it for a non-target branch in the network. This swapping capability has broader implications, as it may be viewed as a form of process swapping, distinct from resource swapping, while also providing a prevention measure when one of the receivers is compromised. We derive necessary and sufficient conditions, expressed in terms of the Schmidt coefficients, for three-qubit pure states to support DC swapping, while we obtain a sufficient criterion for mixed states using their Bloch correlation parameters. Furthermore, we identify the optimal two-qubit unitary operators capable of realizing the swapping of dense codeability between communication channels. We further examine the tolerance of these eligible states against both colored and white noise, demonstrating the resilience of the proposed task under environmental perturbations. We also show that multipartite states supporting DC swapping require only a small amount of genuine multipartite entanglement and that this requirement decreases with increasing system size.

quant-ph

Enhancing the teleportation fidelity of a quantum network using purification

Complex quantum networks can support a diverse set of long-range entanglement distribution schemes ranging from linear repeater protocols to multipath entanglement purification strategies. As a result, a network's resourcefulness, that is its ability to facilitate quantum communication, depends on the deployed distribution scheme. In this work, we analyse and compare the resourcefulness of quantum networks across a broad range of network topologies, including both regular and random networks, under two distinct entanglement distribution schemes. The first relies on entanglement swapping along a single path connecting a source-target pair, while the second exploits entanglement purification using multiple paths between the same source and target nodes. The resourcefulness of the network is quantified using a recently described metric [1] that averages over the maximum teleportation fidelity between arbitrary source-target pairs in the network. We present algorithms for estimating this metric under constraints of edge-usage and ordering of paths. Our results not only demonstrate the sensitivity of the average maximum teleportation fidelity metric to the choice of entanglement distribution protocol, but also highlight the significant improvements enabled by network purification schemes. In particular, purification-based approaches can substantially enhance average teleportation fidelity, thereby improving the overall teleportation capability of quantum networks.

quant-ph

Generative Adversarial Networks for Resource State Generation

We introduce a physics-informed Generative Adversarial Network framework that recasts quantum resource-state generation as an inverse-design task. By embedding task-specific utility functions into training, the model learns to generate valid two-qubit states optimized for teleportation and entanglement broadcasting. Comparing decomposition-based and direct-generation architectures reveals that structural enforcement of Hermiticity, trace-one, and positivity yields higher fidelity and training stability than loss-only approaches. The framework reproduces theoretical resource boundaries for Werner-like and Bell-diagonal states with fidelities exceeding ~98%, establishing adversarial learning as a lightweight yet effective method for constraint-driven quantum-state discovery. This approach provides a scalable foundation for automated design of tailored quantum resources for information-processing applications, exemplified with teleportation and broadcasting of entanglement, and it opens up the possibility of using such states in efficient quantum network design.

quant-ph

Teleportation Fidelity of Binary Tree Quantum Repeater Networks

Binary tree network, being a subclass of Cayley tree network, is a significant topological structure used for information transfer in a hierarchical sense. In this article, we consider four types of binary tree repeater networks (directed and undirected, asymmetric and symmetric) and obtain the analytical expressions of the average of the maximum teleportation fidelities for each of these binary tree networks. We contribute a methodology for the analytical calculation of pathlengths in all considered graph types. Based on these, we have used simple Werner state-based models and are able to identify the parameter ranges for which these networks can show quantum advantage. We also explore the role of maximally entangled states in the network to enhance the quantum advantage. We provide a detailed examination of the large-scale behavior of these networks, obtaining the limiting value of the average maximum teleportation fidelity as the number of nodes, $N$, approaches infinity, same as fractal tree. Our findings reveal that the directed symmetric binary tree represents the most advantageous topology for quantum teleportation within this context. From the context of quantum repeater networks, this work makes a significant advancement in the process of identifying resourceful tree networks for distributed quantum teleportation i.e. teleportation between all possible sources and targets.

quant-ph

Secure and Efficient Quantum Signature Scheme Based on the Controlled Unitary Operations Encryption

Quantum digital signatures ensure unforgeable message authenticity and integrity using quantum principles, offering unconditional security against both classical and quantum attacks. They are crucial for secure communication in high-stakes environments, ensuring trust and long-term protection in the quantum era. Nowadays, the majority of arbitrated quantum signature (AQS) protocols encrypt data qubit by qubit using the quantum one-time pad (QOTP). Despite providing robust data encryption, QOTP is not a good fit for AQS because of its susceptibility to many types of attacks. In this work, we present an efficient AQS protocol to encrypt quantum message ensembles using a distinct encryption technique, the chained controlled unitary operations. In contrast to existing protocols, our approach successfully prevents disavowal and forgery attacks. We hope this contributes to advancing future investigations into the development of AQS protocols.

quant-ph

Teleportation fidelity of quantum repeater networks

We show that the average of the maximum teleportation fidelities between all pairs of nodes in a large quantum repeater network is a measure of the resourcefulness of the network as a whole. We use simple Werner state-based models to characterise some fundamental (loopless) topologies (star, chain, and some trees) with respect to this measure in three (semi)realistic scenarios. Most of our results are analytic and are applicable for arbitrary network sizes. We identify the parameter ranges where these networks can achieve quantum advantages and show the large-N behaviours.

quant-ph

On fully entangled fraction and quantum conditional entropies for states with maximally mixed marginals

The fully entangled fraction (FEF) measures the proximity of a quantum state to maximally entangled states. FEF $>\frac{1}{d}$, in $d \otimes d$ systems is a significant benchmark for various quantum information processing protocols including teleportation. Quantum conditional entropy (QCE) on the other hand is a measure of correlation in quantum systems. Conditional entropies for quantum systems can be negative, marking a departure from conventional classical systems. The negativity of quantum conditional entropies plays a decisive role in tasks like state merging and dense coding. In the present work, we investigate the relation of these two important yardsticks. Our probe is mainly done in the ambit of states with maximally mixed marginals, with a few illustrations from other classes of quantum states. We start our study in two qubit systems, where for the Werner states, we obtain lower bounds to its FEF when the conditional R\'enyi $\alpha-$entropy is negative. We then obtain relations between FEF and QCE for two qubit Weyl states. Moving on to two qudit states we find a necessary and sufficient condition based on FEF, for the isotropic state to have negative conditional entropy. In two qudit systems the relation between FEF and QCE is probed for the rank deficient and generalized Bell diagonal states. FEF is intricately linked with $k$- copy nonlocality and $k$- copy steerability. The relations between FEF and QCE facilitates to find conditions for $k$- copy nonlocality and $k$- copy steerability based on QCE. We obtain such conditions for certain classes of states in two qubits and two qudits. Applications of the relations obtained are provided in the context of work extraction, faithful entanglement and entropic uncertainty relations.

quant-ph

Maximal Secret Reconstruction, Teleportation and Bell's Inequality

A tripartite state is said to be a potential resource for secret sharing if the state imposes restrictions on the teleportation fidelity of the bipartite dealer--reconstructor and dealer--assistant channels in addition of being useful for the state reconstruction. Given a secret shareable state in a pure three-qubit system, we are able to characterize the set of states with maximum possible reconstruction fidelity (abbreviated as MSR states) for a fixed value of the maximum teleportation fidelity that can be obtained out of both the dealer--receiver channels. Similarly for a value giving the maximum of Bell-CHSH value of both dealer--reconstructor and dealer--assistant channels, we are able to find the maximum achievable reconstruction fidelity. Interestingly, we find that all secret shareable states satisfy Bell's inequality in both dealer--reconstructor and dealer--assistant partitions. This brings out a new mutual exclusivity between secret shareable state and Bell's inequality violations. Our result paves the way in identifying the best candidate among the secret sharing resource states in achieving the maximum reconstruction fidelity thus by setting the practical information transfer limit in a possible resource theoretic extension of secret sharing. It also brings out a new kind of mutual exclusiveness between the bipartite correlation and in the ability of secret sharing in a tripartite setting.

quant-ph

Using Quantum Switches to Mitigate Noise in Grover's Search Algorithm

Grover's quantum search algorithm promises a quadratic speedup for unstructured search over its classical counterpart. But this advantage is affected by noise acting on the search space. Here, we show that a quantum switch can act as a resource to mitigate the effects of noise. In this scenario, the noise is modeled by a depolarizing channel, which coherently acts on the entire quantum register. We show that a quantum switch can significantly reduce the error in Grover's search algorithm. We consider the success probability of finding the marked item as the sole quantifier of diminishing the effect of noise in the search space in the presence of quantum switch. We propose two frameworks for the application of quantum switches. In the first framework, we apply the superposition of channel's orders in the form of a switch and do a post-selection at every iteration of the applications of the Grover operator. In the second framework, we delay this measurement and post-selection until the very end. The number of post selections is minimal in the second scenario, and hence the noise reduction can be attributed more to the presence of quantum switch. We illustrate with an example of significant advantage in the success probability of Grover's algorithm using quantum switch.

quant-ph

Quantum channels that destroy negative conditional entropy

Counter-intuitive to classical notions, quantum conditional entropy can be negative, playing a pivotal role in information-processing tasks. This article delves deeply into quantum channels, emphasizing negative conditional entropy breaking channels (NCEB) and introducing negative conditional entropy annihilating channels (NCEA). We characterize these channels from both topological and information-theoretic perspectives, examining their properties when combined serially and NCEB in parallel. Our exploration extends to complimentary channels associated with NCEB, leading to the introduction of information-leaking channels. Utilizing the parameters of the standard depolarizing channel, we provide tangible examples and further characterization. We demonstrate the relationship of NCEB and NCEA with newly introduced channels like coherent information breaking (CIB) and mutual information breaking (MIB), along with standard channels like zero capacity channels. Preservation of quantum resources is an integral constituent of quantum information theory. Recognizing this, we lay prescriptions to detect channels that do not break the negativity of conditional entropy, ensuring the conservation of this quantum resource.

quant-ph

Breaking absolute separability with quantum switch

Absolute separable (AS) quantum states are those states from which it is impossible to create entanglement, even under global unitary operations. It is known from the resource theory of non-absolute separability that the set of absolute separable states forms a convex and compact set, and global unitaries are free operations. We show that the action of a quantum switch controlled by an ancilla qubit over the global unitaries can break this robustness of AS states and produce ordinary separable states. First, we consider bipartite qubit systems and find the effect of quantum switch starting from the states sitting on the boundary of the set of absolute separable states. As particular examples, we illustrate what happens to modified Werner states and Bell diagonal (BD) states. For the Bell diagonal states, we provide the structure for the set of AS BD states and show how the structure changes under the influence of a switch. Further, we consider numerical generalisation of the global unitary operations and show that it is always possible to take AS states out of the convex set under switching operations. We also generalised our results in higher dimensions.

quant-ph

Entanglement and Teleportation in a 1-D Network with Repeaters

The most simplest form of quantum network is an one dimensional quantum network with a single player in each node. In remote entanglement distribution each of the players carry out measurement at the intermediate nodes to produce an entangled state between initial and final node which are remotely separated. It is imperative to say that the flow of information as well as the percolation of entanglement in a network between the source and target node is an important area of study. This will help us to understand the limits of the resource states as well as the measurements that are carried out in the process of remote entanglement distribution. In this article we investigate how the concurrence of the final entangled state obtained is connected with the concurrences of the initial entangled states present in a 1-D chain. We extend the works done for the pure entangled states for mixed entangled states like Werner states, Bell diagonal states and for general mixed states. We did not limit ourselves to a situation where the measurements are happening perfectly. We also investigate how these relations change when we consider imperfect swapping. We obtain the limits on the number of swappings as well as the success probability measurements to ensure the final state to be entangled state after swapping. In addition to these we also investigate on how much quantum information can be sent from the initial node to the final node (by computing the teleportation fidelity) when the measurement is perfect and imperfect with the same set of examples. Here also we obtain the limits on the number of swapping and the success probability of measurement to ensure that the final state obtained is capable of transferring the information . These results have tremendous future applications in sending quantum information between two quantum processors in remote entangled distribution.

quant-ph

Controlled State Reconstruction and Quantum Secret Sharing

In this article, we present a benchmark for resource characterization in the process of controlled quantum state reconstruction and secret sharing for general three-qubit states. This is achieved by providing a closed expression for the reconstruction fidelity, which relies on the genuine tripartite correlation and the bipartite channel between the dealer and the reconstructor characterized by the respective correlation parameters. We formulate the idea of quantum advantage in approximate state reconstruction as surpassing the classical limit set at 2/3. This article brings out new interoperability between teleportation and state reconstruction. This is detailed through a case-by-case analysis of relevant correlation matrices. We are reformulating the idea of quantum secret sharing by setting up additional constraints on the teleportation capacity of the bipartite channels between the dealer and shareholders by ensuring that, individually, the shareholders cannot reconstruct the secret. We believe that this will give us the ideal picture of how quantum secret sharing should be.

quant-ph

Teleportation of quantum coherence

We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a lesser number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a non-maximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's lab in terms of the composition of the completely positive maps corresponding to the shared resource state and joint POVM performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is possible perfectly with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with the Werner states and show that even when the Werner states become separable, the amount of teleported coherence is non-zero, implying the possibility of teleportation of coherence without entanglement.

quant-ph

Persistency of non-n-local correlations in noisy linear networks

Linear n-local networks are compatible with quantum repeaters based entanglement distribution protocols. Different sources of imperfections such as error in entanglement generation, communication over noisy quantum channels and imperfections in measurements result in decay of quantumness across such networks. From practical perspectives it becomes imperative to analyze non classicality of quantum network correlations in presence of different types of noise. Present discussion provides a formal characterization of non n-local feature of quantum correlations in noisy network scenario. In this context, persistency of non n-locality has been introduced. Such a notion helps in analyzing decay of non n-local feature of network correlations with increasing length of the linear network in presence of one or more causes of imperfections.

quant-ph

Absolute fully entangled fraction from spectrum

Fully entangled fraction (FEF) is a significant figure of merit for density matrices. In bipartite $ d \otimes d $ quantum systems, the threshold value FEF $ > 1/d $, carries significant implications for quantum information processing tasks. Like separability, the value of FEF is also related to the choice of global basis of the underlying Hilbert space. A state having its FEF $ \le 1/d $, might give a value $ > 1/d $ in another global basis. A change in the global basis corresponds to a global unitary action on the quantum state. In the present work, we find that there are quantum states whose FEF remains less than $ 1/d $, under the action of any global unitary i.e., any choice of global basis. We invoke the hyperplane separation theorem to demarcate the set from states whose FEF can be increased beyond $ 1/d $ through global unitary action. Consequent to this, we probe the marginals of a pure three party system in qubits. We observe that under some restrictions on the parameters, even if two parties collaborate (through unitary action on their combined system) they will not be able to breach the FEF threshold. The study is further extended to include some classes of mixed three qubit and three qutrit systems. Furthermore, the implications of our work pertaining to $ k- $copy nonlocality and teleportation are also investigated.

quant-ph

A-unital Operations and Quantum Conditional Entropy

Negative quantum conditional entropy states are key ingredients for information theoretic tasks such as superdense coding, state merging and one-way entanglement distillation. In this work, we ask: how does one detect if a channel is useful in preparing negative conditional entropy states? We answer this question by introducing the class of A-unital channels, which we show are the largest class of conditional entropy non-decreasing channels. We also prove that A-unital channels are precisely the completely free operations for the class of states with non-negative conditional entropy. Furthermore, we study the relationship between A-unital channels and other classes of channels pertinent to the resource theory of entanglement. We then prove similar results for ACVENN: a previously defined, relevant class of states and also relate the maximum and minimum conditional entropy of a state with its von Neumann entropy. The definition of A-unital channels naturally lends itself to a procedure for determining membership of channels in this class. Thus, our work is valuable for the detection of resourceful channels in the context of conditional entropy.

quant-ph

Revocation and Reconstruction of Shared Quantum States

The problem of revocation of quantum states after sharing is interesting and we ask: Is it possible for a dealer to revoke the state once shared, before the reconstruction process? Additional resources like bell states are used to help the dealer to get back the state. In a three-party scenario, we show an independent way to revoke, if, for any reason, the dealer is not sure about the intention of the/any reconstructor. In general, the classical outcomes of the dealer in sharing phase are needed, to be able to reconstruct the state perfectly. When both the shareholders are dishonest, and without the dealer's knowledge, collude to reconstruct, they always have some chance of succeeding. This is addressed by giving more control to the dealer by making him/her) to have a quantum share as well. We give a sharing and revocation protocol with a four-qubit entangled resource shared among three parties (two qubits with the dealer and one each with the shareholders). We further consider a class of four qubit pure entangled states as resource and explicitly find the range of parameters for which the protocol will be successful.

quant-ph