SGSuchetana Goswami

Suchetana Goswami

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Suchetana Goswami has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Hybrid authentication protocols for advanced quantum networks

    by Suchetana Goswami, Mina Doosti, Elham Kashefi

    Authentication is a fundamental building block of secure quantum networks, essential for quantum cryptographic protocols and often debated as a key limitation of quantum key distribution in security standards. Most quantum-safe authentication schemes rely on small pre-shared keys or post-quantum computational assumptions. In this work, we introduce a new authentication approach that combines hardware assumptions, particularly physical unclonable functions (PUFs), along with fundamental quantum properties of non-local states, such as local indistinguishability, to achieve provable security in entanglement-based protocols. We propose two protocols for different scenarios in entanglement-enabled quantum networks. The first protocol, referred to as the offline protocol, requires pre-distributed entangled states but no quantum communication during the authentication phase. It enables a server to authenticate clients at any time with only minimal classical communication. The second, an online protocol, requires quantum communication but only necessitates entangled state generation on the Prover ’s side. For this, we introduce a novel hardware module, the hybrid entangled PUF. Both protocols use weakly secure, off-the-shelf classical PUFs as their hardware module, yet we prove that quantum properties such as local indistinguishability enable exponential security for authentication, even in a single round. We provide full security analysis for both protocols and establish them as the first entanglement-based extension of hardware-based quantum authentication. These protocols are suitable for implementation across various platforms, particularly photonics-based ones, and offer a practical and flexible solution to the long-standing challenge of authentication in quantum communication networks.


  • Open Access

    Non-Markovian noise limits for sustaining entanglement in multiparty quantum states

    by Suchetana Goswami, Ujjwal Sen

    The principal resource in several quantum information-processing tasks is entanglement. Building practically useful versions of such tasks, one often needs to consider multipartite systems. And in such scenarios, it is impossible to eliminate the effects of the environment while distributing the resources. We show how information backflow from the environment due to non-Markovianity in the system dynamics affects the resources in multipartite systems, specifically multiparty entanglement. In particular, we find that the entanglement of multiqubit Greenberger-Horne-Zeilinger cat states saturates with time to a nonzero value for a non-Markovian dephasing noise. The multiqubit W states saturate to a higher value. Such nonzero time-saturated values are washed out if the non-Markovianity in the channel is removed. The multiqubit W states provide a richer set of features, including a nonzero value for an asymptotic number of qubits and an even-odd dichotomy in the entanglement with the number of qubits. Moving to a non-Markovian depolarizing channel, we find that both cat and W states exhibit a revival of entanglement after the collapse.

  • Breaking absolute separability with quantum switch

    by Sravani Yanamandra, P. V. Srinidhi, Samyadeb Bhattacharya, Indranil Chakrabarty, Suchetana Goswami


  • Open Access

    Non-Markovian noise limits for sustaining entanglement in multiparty quantum states

    by Suchetana Goswami, Ujjwal Sen

    The principal resource in several quantum information processing tasks is entanglement. Building practically useful versions of such tasks, one often needs to consider multipartite systems. And in such scenarios, it is impossible to eliminate the effects of environment while distributing the resources. We show how information back-flow from the environment, as a result of non-Markovianity in the system dynamics, affects the resources in multipartite systems, specifically multiparty entanglement. In particular, we find that entanglement of multi-qubit Greenberger-Horne-Zeilinger cat states saturate with time to a non-zero value for a non-Markovian dephasing noise. The multi-qubit W states saturate to a higher value. Such non-zero time-saturated values are washed out if the non-Markovianity in the channel is removed. The multi-qubit W states provide a richer set of features, including a non-zero value for an asymptotic number of qubits and an even-odd dichotomy in entanglement with number of qubits. Moving over to a non-Markovian depolarising channel, we find that both cat and W states exhibit revival of entanglement after collapse.

  • Detecting entanglement harnessing Lindblad structure

    by Vaibhav Chimalgi, Bihalan Bhattacharya, Suchetana Goswami, Samyadeb Bhattacharya

    The problem of entanglement detection is a long standing problem in quantum information theory. One of the primary procedures of detecting entanglement is to find the suitable positive but non-completely positive maps. Here we try to give a generic prescription to construct a positive map that can be useful for such scenarios. We study a class of positive maps arising from Lindblad structures. We show that two famous positive maps viz. transposition, reduction map and Choi map can be obtained as a special case of a class of positive maps having Lindblad structure. Generalizing the transposition map to a one parameter family we have used it to detect genuine multipartite entanglement. Finally being motivated by the negativity of entanglement, we have defined a similar measure for genuine multipartite entanglement.


  • Open Access

    Breaking absolute separability with quantum switch

    by Sravani Yanamandra, P V Srinidhi, Samyadeb Bhattacharya, Indranil Chakrabarty, Suchetana Goswami

    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.

  • Open Access

    Information locking and its resource efficient extraction

    by Suchetana Goswami, Saronath Halder

    Locally indistinguishable states are useful to distribute information among spatially separated parties such that the information is locked. This implies that the parties are not able to extract the information completely via local operations and classical communication (LOCC) while it might be possible via LOCC when the parties share entanglement. In this work, we consider an information distribution protocol using orthogonal states for m >= 3 spatially separated parties such that even if any k <= (m-1) parties collaborate still the information cannot be revealed completely. Such a protocol is useful to understand up to what extent the encoded information remains locked. However, if required, the parties can share entanglement and extract the information completely by LOCC. To make the process resource efficient, it should consume less number of entangled states. We show that though the set of states, which are locally indistinguishable across every bipartition, are sufficient for the above protocol, they may consume higher number of entangled states when aiming for complete information extraction. We establish this by constructing a class of locally indistinguishable sets of orthogonal states which can be employed to accomplish the above protocol and these sets consume less number of entangled states, compared to the former sets, for complete information extraction. In fact, this difference in the number of required entangled states for complete information extraction grows linearly with the number of parties. This study sheds light on suitable use of local indistinguishability property of quantum states as resource and thus, we demonstrate an efficient way of information distribution.

  • Information locking and its resource-efficient extraction

    by Suchetana Goswami, Saronath Halder

    Locally indistinguishable states are useful to distribute information among spatially separated parties such that the information is locked. This implies that the parties are not able to extract the information completely via local operations and classical communication (LOCC), while it might be possible via LOCC when the parties share entanglement. In this work, we consider an information distribution protocol using orthogonal states for m≥3 spatially separated parties such that even if any k≤(m−1) parties collaborate still the information cannot be revealed completely. Such a protocol is useful to understand up to what extent the encoded information remains locked. However, if required, the parties can share entanglement and extract the information completely by LOCC. To make the process resource efficient, it should consume less number of entangled states. We show that though the set of states, which are locally indistinguishable across every bipartition, are sufficient for the above protocol, they may consume a higher number of entangled states when aiming for complete information extraction. We establish this by constructing a class of locally indistinguishable sets of orthogonal states which can be employed to accomplish the above protocol and these sets consume less number of entangled states, compared with the former sets, for complete information extraction. In fact, this difference in the number of required entangled states for complete information extraction grows linearly with the number of parties. This study sheds light on suitable use of local indistinguishability property of quantum states as a resource, and thus we demonstrate an efficient way of information distribution.


  • 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.