检索结果-内蒙古大学图书馆

Comment on "Quantum key agreement protocol"

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Das, Nayana Majumdar, Ritajit Applied Statistics Unit Indian Statistical Institute India Advanced Computing & Microelectronics Unit Indian Statistical Institute India

The first two party Quantum Key Agreement (QKA) protocol, based on quantum teleportation, was proposed by Zhou et al. (Electronics Letters 40.18 (2004): 1149-1150). In this protocol, to obtain the key bit string, one of the parties use a device to obtain inner product of two quantum states, one being unknown, and the other one performs Bell measurement. However, in this article, we show that it is not possible to obtain a device that would output the inner product of two qubits even when only one of the qubit is unknown. This is so because existence of such device would imply perfectly distinguishing among four different states in a two-dimensional vector space. This is not permissible in quantum mechanics. Furthermore, we argue that existence of such a device would also imply violation of the "No Signalling Theorem" as well. Finally, we also comment that this protocol is not a valid key agreement protocol at all. Copyright © 2020, The Authors. All rights reserved.

关键词： Vector spaces

Efficient decoding of surface code syndromes for error correction in quantum computing

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Bhoumik, Debasmita Sen, Pinaki Majumdar, Ritajit Sur-Kolay, Susmita Kumar, Latesh K.J. Iyengar, Sundaraja Sitharama Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India Department of Electrical Engineering National Institute of Technology Agartala India KFSCIS Florida International University MiamiFL United States

Errors in surface code have typically been decoded by Minimum Weight Perfect Matching (MWPM) based method. Recently, neural-network-based Machine Learning (ML) techniques have been employed for this purpose. Here we propose a two-level (low and high) ML-based decoding scheme, where the first level corrects errors on physical qubits and the second one corrects any existing logical errors, for different noise models. Our results show that our proposed decoding method achieves ∼ 10× and ∼ 2× higher values of pseudo-threshold and threshold respectively, than for MWPM. We show that usage of more sophisticated ML models with higher training/testing time, do not provide significant improvement in the decoder performance. Finally, data generation for training the ML decoder requires significant overhead hence lower volume of training data is desirable. We have shown that our decoder maintains a good performance with the train-test-ratio as low as 40: 60. © 2021, CC BY.

关键词： Error correction

Quantum Secure Direct Communication with Mutual Authentication using a Single Basis

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Das, Nayana Paul, Goutam Majumdar, Ritajit Applied Statistics Unit Indian Statistical Institute Kolkata India Cryptology and Security Research Unit R. C. Bose Centre for Cryptology and Security Indian Statistical Institute Kolkata India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

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 eavesdropper 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. Copyright © 2021, The Authors. All rights reserved.

关键词： Quantum cryptography

A Framework for Automated Correctness Checking of Biochemical Protocol Realizations on Digital Microfluidic Biochips

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Bhattacharjee, Sukanta Banerjee, Ansuman Chakrabarty, Krishnendu Bhattacharya, Bhargab B. Department of Computer Science and Engineering Indian Institute of Technology Assam Guwahati781039 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India Department of Electrical and Computer Engineering Duke University United States Department of Computer Science and Engineering National Institute of Technology Rourkela Odisha769008 India

Recent advances in digital microfluidic (DMF) technologies offer a promising platform for a wide variety of biochemical applications, such as DNA analysis, automated drug discovery, and toxicity monitoring. For on-chip implementation of complex bioassays, automated synthesis tools have been developed to meet the design challenges. Currently, the synthesis tools pass through a number of complex design steps to realize a given biochemical protocol on a target DMF architecture. Thus, design errors can arise during the synthesis steps. Before deploying a DMF biochip on a safety critical system, it is necessary to ensure that the desired biochemical protocol has been correctly implemented, i.e., the synthesized output (actuation sequences for the biochip) is free from any design or realization errors. We propose a symbolic constraint-based analysis framework for checking the correctness of a synthesized biochemical protocol with respect to the original design specification. The verification scheme based on this framework can detect several post-synthesis fluidic violations and realization errors in 2D-array based or pin-constrained biochips as well as in cyberphysical systems. It further generates diagnostic feedback for error localization. We present experimental results on the polymerase chain reaction (PCR) and in-vitro multiplexed bioassays to demonstrate the proposed verification approach. © 2022, CC BY.

关键词： Polymerase chain reaction

A machine learning based heuristic to predict the efficacy of online sale

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Singhania, Aditya Vikram Mukherjee, Saronyo Lal Majumdar, Ritajit Mehta, Akash Banerjee, Priyanka Bhoumik, Debasmita Department of Computer Science Bhawanipur Education Society College Advanced Computing & Microelectronics Unit Indian Statistical Institute India

It is difficult to decide upon the efficacy of an online sale simply from the discount offered on commodities. Different features have different influence on the price of a product which must be taken into consideration when determining the significance of a discount. In this paper we have proposed a machine learning based heuristic to quantify the "significance" of the discount offered on any commodity. Our proposed technique can quantify the significance of the discount based on features and the original price, and hence can guide a buyer during a sale season by predicting the efficacy of the sale. We have applied this technique on the Flipkart Summer Sale dataset using Support Vector Machine, which predicts the efficacy of the sale with an accuracy of 91.11%. Our result shows that very few mobile phones have a significant discount during the Flipkart Summer Sale. Copyright © 2020, The Authors. All rights reserved.

关键词： Electronic commerce

Time Series Snapshot of Event Boundary Detection and Area Estimation in Wireless Sensor Networks

学校读者我要写书评

暂无评论

Time Series Snapshot of Event Boundary Detection and Area Es...

International Communication Systems and Networks and Workshops, COMSNETS

作者： Srabani Kundu Nabanita Das Avirup Das Guru Nanak Inst. of Technology Kolkata India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9781728131870

ISBN: (纸本)9781728131887

To monitor the events like forest fire, flood, earth tremor etc., event boundary detection and area estimation are two challenging tasks for Wireless Sensor Networks (WSN). Researchers, so far, have proposed various innovative solutions assuming the event boundary to be static. To monitor spatiotemporal events by WSN, in this paper, we study some existing techniques to report snapshots of event boundary in successive intervals, and compare their performance in respect of accuracy, latency and message communication overhead. Testbed experiments have been done to evaluate the performance and the results show that the computation intensive techniques perform better, provided they satisfy the application specific real time constraint.

关键词： Wireless sensor networks Estimation Monitoring Forestry Real-time systems Time series analysis

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Cabello, Sergio Das, Arun Kumar Das, Sandip Mukherjee, Joydeep Faculty of Mathematics and Physics University of Ljubljana Slovenia Institute of Mathematics Physics and Mechanics Slovenia Advanced Computing and Microelectronics Unit Indian Statistical Institute India Dept. of Computer Science Ramakrishna Mission Vivekananda Educational and Research Institute India

A terrain is an x-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in O(n log n) time, where n is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of O(n2). Copyright © 2021, The Authors. All rights reserved.

关键词： Trees (mathematics)

i-QER: An Intelligent Approach towards Quantum Error Reduction

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Basu, Saikat Saha, Amit Chakrabarti, Amlan Sur-Kolay, Susmita A. K. Choudhury School of Information Technology University of Calcutta and Atos Pune India A. K. Choudhury School of Information Technology University of Calcutta India Advanced Computing & Microelectronics Unit Indian Statistical Institute India

Quantum computing has become a promising computing approach because of its capability to solve certain problems, exponentially faster than classical computers. A n-qubit quantum system is capable of providing 2n computational space to a quantum algorithm. However, quantum computers are prone to errors. Quantum circuits that can reliably run on today’s Noisy Intermediate-Scale Quantum (NISQ) devices are not only limited by their qubit counts but also by their noisy gate operations. In this paper, we have introduced i-QER, a scalable machine learning-based approach to evaluate errors in a quantum circuit and helps to reduce these without using any additional quantum resources. The i-QER predicts possible errors in a given quantum circuit using supervised learning models. If the predicted error is above a pre-specified threshold, it cuts the large quantum circuit into two smaller sub-circuits using an error-influenced fragmentation strategy for the first time to the best of our knowledge. The proposed fragmentation process is iterated until the predicted error reaches below the threshold for each sub-circuit. The sub-circuits are then executed on a quantum device. Classical reconstruction of the outputs obtained from the sub-circuits can generate the output of the complete circuit. Thus, i-QER also provides classical control over a scalable hybrid computing approach, which is a combination of quantum and classical computers. The i-QER tool is available at https://***/SaikatBasu90/i-QER. © 2021, CC BY.

关键词： Errors

Distributed Relay Selection in Presence of Dynamic Obstacles in Millimeter Wave D2D Communication

学校读者我要写书评

暂无评论

Distributed Relay Selection in Presence of Dynamic Obstacles...

IEEE International Conference on Communications (ICC)

作者： Durgesh Singh Arpan Chattopadhyay Sasthi C. Ghosh Advanced Computing& Microelectronics Unit Indian Statistical Institute Kolkata India Department of Electrical Engineering Indian Institute of Technology Delhi

ISBN: (数字)9781728150895

ISBN: (纸本)9781728150901

Millimeter wave (mmWave) device to device (D2D) communication is highly susceptible to obstacles due to severe penetration losses and requires almost a line of sight (LOS) communication path. D2D channel condition is local to devices/user equipments (UEs) and hence is not directly visible to the base station (BS). Thus quality of the D2D channel needs to be propagated to BS by UEs which may incur some delay. Hence the solution provided by BS to UEs using this gathered channel information might become less useful to establish communication due to moving obstacles. These types of obstacles might not be known in advance and hence may cause unpredictable fluctuations to the D2D channel quality. Hence we seek to learn the D2D channels using the finite horizon partially observable Markov decision process (POMDP) framework to model the uncertainty in such kind of network environments with dynamic obstacles. The objective is to minimize delay when channel quality deteriorates, by making UEs choose locally the best possible decision between i) to continue on the current relay link on which communication is taking place or ii) to switch to another good relay by exploring other possible UEs in its locality. We derive an optimal threshold policy which tells the UE to take appropriate decision locally. Later, we give a simplified and easy to implement stationary threshold policy which counts the number of successive acknowledgement failures, based on which UE make appropriate decision locally. Through extensive simulation, we demonstrate that our approach outperforms recent algorithms.

关键词： Relays Device-to-device communication Packet loss Delays Uncertainty Switches