Goutam Paul

QUANT-PH
14papers
121citations
Novelty40%
AI Score33

14 Papers

LGAug 6, 2025
Quantum Temporal Fusion Transformer

Krishnakanta Barik, Goutam Paul

The \textit{Temporal Fusion Transformer} (TFT), proposed by Lim \textit{et al.}, published in \textit{International Journal of Forecasting} (2021), is a state-of-the-art attention-based deep neural network architecture specifically designed for multi-horizon time series forecasting. It has demonstrated significant performance improvements over existing benchmarks. In this work, we introduce the Quantum Temporal Fusion Transformer (QTFT), a quantum-enhanced hybrid quantum-classical architecture that extends the capabilities of the classical TFT framework. The core idea of this work is inspired by the foundation studies, \textit{The Power of Quantum Neural Networks} by Amira Abbas \textit{et al.} and \textit{Quantum Vision Transformers} by El Amine Cherrat \textit{et al.}, published in \textit{ Nature Computational Science} (2021) and \textit{Quantum} (2024), respectively. A key advantage of our approach lies in its foundation on a variational quantum algorithm, enabling implementation on current noisy intermediate-scale quantum (NISQ) devices without strict requirements on the number of qubits or circuit depth. Our results demonstrate that QTFT is successfully trained on the forecasting datasets and is capable of accurately predicting future values. In particular, our experimental results on two different datasets display that the model outperforms its classical counterpart in terms of both training and test loss. These results indicate the prospect of using quantum computing to boost deep learning architectures in complex machine learning tasks.

QUANT-PHJan 14, 2021
Secure Multi-Party Quantum Conference and Xor Computation

Nayana Das, Goutam Paul

Quantum conference is a process of securely exchanging messages between three or more parties, using quantum resources. A Measurement Device Independent Quantum Dialogue (MDI-QD) protocol, which is secure against information leakage, has been proposed (Quantum Information Processing 16.12 (2017): 305) in 2017, is proven to be insecure against intercept-and-resend attack strategy. We first modify this protocol and generalize this MDI-QD to a three-party quantum conference and then to a multi-party quantum conference. We also propose a protocol for quantum multi-party XOR computation. None of these three protocols proposed here use entanglement as a resource and we prove the correctness and security of our proposed protocols.

QUANT-PHJan 10, 2021
Quantum Secure Direct Communication with Mutual Authentication using a Single Basis

Nayana Das, Goutam Paul, Ritajit Majumdar

In this paper, we propose a new theoretical scheme for quantum secure direct communication (QSDC) with user authentication. Different from the previous QSDC protocols, the present protocol uses only one orthogonal basis of single-qubit states to encode the secret message. Moreover, this is a one-time and one-way communication protocol, which uses qubits prepared in a randomly chosen arbitrary basis, to transmit the secret message. We discuss the security of the proposed protocol against some common attacks and show that no eaves-dropper can get any information from the quantum and classical channels. We have also studied the performance of this protocol under realistic device noise. We have executed the protocol in IBMQ Armonk device and proposed a repetition code based protection scheme that requires minimal overhead.

QUANT-PHJul 7, 2020
Cryptanalysis of Quantum Secure Direct Communication Protocol with Mutual Authentication Based on Single Photons and Bell States

Nayana Das, Goutam Paul

Recently, Yan et al. proposed a quantum secure direct communication (QSDC) protocol with authentication using single photons and Einstein-Podolsky-Rosen (EPR) pairs (Yan et al., CMC-Computers, Materials \& Continua, 63(3), 2020). In this work, we show that the QSDC protocol is not secure against intercept-and-resend attack and impersonation attack. An eavesdropper can get the full secret message by applying these attacks. We propose a modification of this protocol, which defeats the above attacks along with all the familiar attacks.

QUANT-PHJun 9, 2020
Improving the Security of "Measurement-Device-Independent Quantum Communication without Encryption"

Nayana Das, Goutam Paul

Recently in 2018, Niu et al. proposed a measurement-device-independent quantum secure direct communication protocol using Einstein-Podolsky-Rosen pairs and generalized it to a quantum dialogue protocol (Niu et al., Science bulletin 63.20, 2018). By analyzing these protocols we find some security issues in both these protocols. In this work, we show that both the protocols are not secure against information leakage, and a third party can get half of the secret information without any active attack. We also propose suitable modifications of these protocols to improve the security.

QUANT-PHMay 7, 2020
Two Efficient Measurement Device Independent Quantum Dialogue Protocols

Nayana Das, Goutam Paul

Quantum dialogue is a process of two way secure and simultaneous communication using a single channel. Recently, a Measurement Device Independent Quantum Dialogue (MDI-QD) protocol has been proposed (Quantum Information Processing 16.12 (2017): 305). To make the protocol secure against information leakage, the authors have discarded almost half of the qubits remaining after the error estimation phase. In this paper, we propose two modified versions of the MDI-QD protocol such that the number of discarded qubits is reduced to almost one-fourth of the remaining qubits after the error estimation phase. We use almost half of their discarded qubits along with their used qubits to make our protocol more efficient in qubits count. We show that both of our protocols are secure under the same adversarial model given in MDI-QD protocol.

QUANT-PHApr 25, 2019
Dimensionality Distinguishers

Nayana Das, Goutam Paul, Arpita Maitra

The celebrated Clauser, Horne, Shimony and Holt (CHSH) game model helps to perform the security analysis of many two-player quantum protocols. This game specifies two Boolean functions whose outputs have to be computed to determine success or failure. It also specifies the measurement bases used by each player. In this paper, we generalize the CHSH game by considering all possible non-constant Boolean functions and all possible measurement basis (up to certain precision). Based on the success probability computation, we construct several equivalence classes and show how they can be used to generate three classes of dimension distinguishers. In particular, we demonstrate how to distinguish between dimensions 2 and 3 for a special form of maximally entangled state.

QUANT-PHOct 23, 2016
Revisiting optimal eavesdropping in quantum cryptography: Optimal interaction is unique up to rotation of the underlying basis

Atanu Acharyya, Goutam Paul

A general framework of optimal eavesdropping on BB84 protocol was provided by Fuchs et al. [Phys. Rev. A, 1997]. An upper bound on mutual information was derived, which could be achieved by a specific type of interaction and the corresponding measurement. However, uniqueness of optimal interaction was posed as an unsolved problem there and it has remained open for almost two decades now. In this paper, we solve this open problem and establish the uniqueness of optimal interaction up to rotation. The specific choice of optimal interaction by Fuchs et al. is shown to be a special case of the form derived in our work.

CRApr 8, 2015
Secure two-party quantum computation for non-rational and rational settings

Arpita Maitra, Goutam Paul, Asim K. Pal

Since the negative result of Lo (Physical Review A, 1997), it has been left open whether there exist some functions that can be securely computed in two-party setting in quantum domain when one of the parties is malicious. In this paper, we for the first time, show that there are some functions for which secure two-party quantum computation is indeed possible for non-simultaneous channel model. This is in sharp contrast with the impossibility result of Ben -Or et al. (FOCS, 2006) in broadcast channel model. The functions we study are of two types - one is any function without an embedded XOR, and the other one is a particular function containing an embedded XOR. Contrary to classical solutions, security against adversaries with unbounded power of computation is achieved by the quantum protocols due to entanglement. Further, in the context of secure multi-party quantum computation, for the first time we introduce rational parties, each of whom tries to maximize its utility by obtaining the function output alone. We adapt our quantum protocols for both the above types of functions in rational setting to achieve fairness and strict Nash equilibrium.

QUANT-PHJan 30, 2015
A Resilient Quantum Secret Sharing Scheme

Arpita Maitra, Goutam Paul

A resilient secret sharing scheme is supposed to generate the secret correctly even after some shares are damaged. In this paper, we show how quantum error correcting codes can be exploited to design a resilient quantum secret sharing scheme, where a quantum state is shared among more than one parties.

QUANT-PHJan 29, 2015
Quantum Information splitting using a pair of GHZ states

Kaushik Nandi, Goutam Paul

We describe a protocol for quantum information splitting (QIS) of a restricted class of three-qubit states among three parties Alice, Bob and Charlie, using a pair of GHZ states as the quantum channel. There are two different forms of this three-qubit state that is used for QIS depending on the distribution of the particles among the three parties. There is also a special type of four-qubit state that can be used for QIS using the above channel. We explicitly construct the quantum channel, Alice's measurement basis and the analytic form of the unitary operations required by the receiver for such a purpose.

QUANT-PHJan 17, 2015
Proposal for Quantum Rational Secret Sharing

Arpita Maitra, Sourya Joyee De, Goutam Paul et al.

A rational secret sharing scheme is a game in which each party responsible for reconstructing a secret tries to maximize his utility by obtaining the secret alone. Quantum secret sharing schemes, either derived from quantum teleportation or from quantum error correcting code, do not succeed when we assume rational participants. This is because all existing quantum secret sharing schemes consider that the secret is reconstructed by a party chosen by the dealer. In this paper, for the first time, we propose a quantum secret sharing scheme which is resistant to rational parties. The proposed scheme is fair (everyone gets the secret), correct and achieves strict Nash equilibrium.

QUANT-PHNov 28, 2013
Three particle Hyper Entanglement: Teleportation and Quantum Key Distribution

P. Chithrabhanu, A. Aadhi, Salla Gangi Reddy et al.

We present a scheme to generate three particle hyper-entanglement utilizing polarization and orbital angular momentum (OAM) of a photon. We show that the generated state can be used to teleport a two-qubit state described by the polarization and the OAM. The proposed quantum system has also been used to describe a new efficient quantum key distribution (QKD) protocol. We give a sketch of the experimental arrangement to realize the proposed teleportation and the QKD.

QUANT-PHMay 12, 2012
Eavesdropping in Semiquantum Key Distribution Protocol

Arpita Maitra, Goutam Paul

In semiquantum key-distribution (Boyer et al.) Alice has the same capability as in BB84 protocol, but Bob can measure and prepare qubits only in $\{|0\rangle, |1\rangle\}$ basis and reflect any other qubit. We study an eavesdropping strategy on this scheme that listens to the channel in both the directions. With the same level of disturbance induced in the channel, Eve can extract more information using our two-way strategy than what can be obtained by the direct application of one-way eavesdropping in BB84.