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

Novel quantum voting protocol for four-particle entangled states based on superdense coding

QUANTUM INFORMATION PROCESSING 2025年第2期24卷 1-17页

作者： Zhang, Hao-Wen Xu, Guang-Bao Jiang, Dong-Huan Shandong Univ Sci & Technol Coll Comp Sci & Engn Qingdao 266590 Shandong Peoples R China Shandong Univ Sci & Technol Coll Math & Syst Sci Qingdao 266590 Shandong Peoples R China

We propose a novel quantum voting protocol that utilizes superdense coding of four-particle entangled states. The protocol is simultaneously legitimate, anonymous, blind, verifiable and irreducible. In order to prevent malicious tampering of the public content, we introduce the distributed proof of work (PoW) consensus algorithm in blockchain as a database mechanism for voting participants. The voting protocol utilizes four-particle entangled states as a quantum resource to perform only single-particle operations, as well as GHZ basis measurements and |0 >,|1 >\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left\{ | 0 \rangle ,| 1\rangle \right\} $$\end{document}-basis measurements. This means that our protocol can be successfully implemented using existing quantum information processing techniques. We conduct simulation experiments on the proposed voting protocol on the IBM Qiskit platform, and the results show that it is correct and feasible.

关键词： Quantum voting superdense coding Unitary operator Four-particle entangled states

来源：评论

学校读者我要写书评

暂无评论

Quantum Two-Way Protocol Beyond superdense coding: Joint Transfer of Data and Entanglement

IEEE TRANSACTIONS ON QUANTUM ENGINEERING

引用

IEEE TRANSACTIONS ON QUANTUM ENGINEERING 2025年第1期6卷 1-8页

作者： Jensen, Kristian S. Valentini, Lorenzo Christensen, Rene B. Chiani, Marco Popovski, Petar Aalborg Univ Dept Elect Syst DK-9220 Aalborg Denmark Univ Bologna Dept Elect Elect & Informat Engn Natl Lab Wireless Commun CNIT I-40126 Bologna Italy Aalborg Univ Dept Math Sci DK-9220 Aalborg Denmark

In this article, we introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyze this both in an ideal setting with no decoherence and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the NetSquid framework. We compare the simulation results with the theoretical values.

关键词： Qubit Protocols Encoding Photonics Quantum entanglement Quantum channels Metadata Throughput Proposals Repeaters Quantum communication superdense coding time-division duplexing two-way communication

来源：评论

学校读者我要写书评

暂无评论

Optimal superdense coding capacity in the non-Markovian regime

引用

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL 2024年第19期57卷 195303-195303页

作者： Aiache, Y. Al-Kuwari, S. El Anouz, K. El Allati, A. Abdelmalek Essaadi Univ Fac Sci & Tech Al Hoceima Lab R&D Engn Sci Tetouan Morocco Max Planck Inst Phys Komplexer Syst Nothnitzer Str 38 D-01187 Dresden Germany Hamad Bin Khalifa Univ Coll Sci & Engn Qatar Ctr Quantum Comp QC2 Doha Qatar

superdense coding (SDC) is a significant technique widely used in quantum information processing. Indeed, it consists of sending two bits of classical information using a single qubit, leading to faster and more efficient quantum communication. In this paper, we propose a model to evaluate the effect of backflow information in a SDC protocol through a non-Markovian dynamics. The model considers a qubit interacting with a structured Markovian environment. In order to generate a non-Markovian dynamic, an auxiliary qubit contacts a Markovian reservoir in such a way that the non-Markovian regime can be induced. By varying the coupling strength between the central qubit and the auxiliary qubit, the two dynamical regimes can be switched interchangeably. An enhancement in non-Markovian effects corresponds to an increase in this coupling strength. Furthermore, we conduct an examination of various parameters, namely temperature weight, and decoherence parameters in order to explore the behaviors of SDC, quantum fisher information (QFI), and local quantum uncertainty using an exact calculation. The obtained results show a significant relationship between non-classical correlations and QFI since they behave similarly, allowing them to detect what is beyond entanglement. In addition, the presence of non-classical correlations enables us to detect the optimal SDC capacity in a non-Markovian regime.

关键词： non-Markovianity superdense coding quantum Fisher information local quantum uncertainty

来源：评论

学校读者我要写书评

暂无评论

Mutually Unbiased Measurements, Hadamard Matrices, and superdense coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2023年第6期69卷 3814-3824页

作者： Farkas, Mate Kaniewski, Jedrzej Nayak, Ashwin Barcelona Inst Sci & Technol ICFO Inst Photon Sci Castelldefels 08860 Spain Univ Warsaw Fac Phys PL-02093 Warsaw Poland Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Univ Waterloo Inst Quantum Comp Waterloo ON N2L 3G1 Canada

Mutually unbiased bases (MUBs) are highly symmetric bases on complex Hilbert spaces, and the corresponding rank-1 projective measurements are ubiquitous in quantum information theory. In this work, we study a recently introduced generalisation of MUBs called mutually unbiased measurements (MUMs). These measurements inherit the essential property of complementarity from MUBs, but the Hilbert space dimension is no longer required to match the number of outcomes. This operational complementarity property renders MUMs highly useful for device-independent quantum information processing. It has been shown that MUMs are strictly more general than MUBs. In this work we provide a complete proof of the characterisation of MUMs that are direct sums of MUBs. We then construct new examples of MUMs that are not direct sums of MUBs. A crucial technical tool for this construction is a correspondence with quaternionic Hadamard matrices, which allows us to map known examples of such matrices to MUMs that are not direct sums of MUBs. Furthermore, we show that-in stark contrast with MUBs-the number of MUMs for a fixed outcome number is unbounded. Next, we focus on the use of MUMs in quantum communication. We demonstrate how any pair of MUMs with d outcomes defines a d-dimensional superdense coding protocol. Using MUMs that are not direct sums of MUBs, we disprove a recent conjecture due to Nayak and Yuen on the rigidity of superdense coding, for infinitely many dimensions. The superdense coding protocols arising in the refutation reveal how shared entanglement may be used in a manner heretofore unknown.

关键词： Mutually unbiased bases (MUBs) mutually unbiased measurements (MUMs) hadamard matrix of unitary operators quaternionic Hadamard matrix perfect sequences superdense coding rigidity shared entanglement

来源：评论

学校读者我要写书评

暂无评论

Rigidity of superdense coding

引用

ACM TRANSACTIONS ON QUANTUM COMPUTING 2023年第4期4卷 1-39页

作者： Nayak, Ashwin Yuen, Henry Univ Waterloo Inst Quantum Comp Dept Combinator & Optimizat 200 Univ Ave West Waterloo ON N2L 3G1 Canada Columbia Univ Dept Comp Sci 500 W 120th St New York NY 10027 USA

The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary protocol for achieving this task (where there are no assumptions on the sender's encoding operations or the dimension of the shared entangled state) is locally equivalent to the canonical Bennett-Wiesner protocol. In other words, the superdense coding task is rigid. In particular, we show that the sender and receiver only use additional entanglement (beyond the EPR pair) as a source of classical randomness. We also investigate several questions about higher-dimensional superdense coding, where the goal is to communicate one of d(2) possible messages by sending a d-dimensional quantum state, for general dimensions d. Unlike the d = 2 case (i.e., sending a single qubit), there can be inequivalent superdense coding protocols for higher d. We present concrete constructions of inequivalent protocols, based on constructions of inequivalent orthogonal unitary bases for all d > 2. Finally, we analyze the performance of superdense coding protocols where the encoding operators are independently sampled from the Haar measure on the unitary group. Our analysis involves bounding the distinguishability of random maximally entangled states, which may be of independent interest.

关键词： superdense coding rigidity shared entanglement orthogonal unitary basis random maximally entangled states distinguishability generalized Holevo-Curlander bounds Marcenko-Pastur Law

来源：评论

学校读者我要写书评

暂无评论

Quantum Authentication Protocol for Secure Quantum superdense coding

Quantum Authentication Protocol for Secure Quantum Superdens...

引用

IEEE SoutheastCon Conference on Engineering the Future

作者： Kim, Teo Baek, Jinsuk Yi, John T. Univ North Carolina Greensboro Dept Comp Sci Greensboro NC 27412 USA Winston Salem State Univ Dept Comp Sci Winston Salem NC USA

ISBN: (纸本)9798350317107;9798350317114

In quantum information theory, superdense coding allows two network entities to exchange two classical bits via a quantum channel using a single quantum bit (qubit) transmission, provided they have pre-shared an entangled qubit. An attacker intercepting the qubit during transmission cannot extract meaningful data without the other entangled qubit from the pair. However, an attacker can disrupt the communication by introducing its own qubit to the receiver. To enhance the security of superdense coding, we propose an authentication mechanism through a classical communication channel.

关键词： quantum computing superdense coding quantum authentication entanglement

来源：评论

学校读者我要写书评

暂无评论

superdense coding, Teleportation Algorithms, and Bell's Inequality Test in Qiskit and IBM Circuit Composer

ELECTRICA

引用

ELECTRICA 2022年第2期22卷 120-131页

作者： Kocak, Yasemin Poyraz Sevgen, Selcuk Istanbul Univ Cerrahpasa Dept Comp Programming Istanbul Turkey Istanbul Univ Cerrahpasa Dept Comp Engn Istanbul Turkey

Quantum teleportation is a technique of sending information from one place to another place. Distance between two points can be hundreds of thousands of light-years. For quantum teleportation, there is no need for a channel between two points when sending a state vector from one place to another. Since classical information sharing is possible, it is also possible to send a state vector from one place to another place. Teleportation is the transfer of a quantum state from one place to another through classical channels. superdense coding, a dual to teleportation, uses a single quantum bit to transmit two bits classical information. superdense coding uses a qubit to transfer two classical bits, while teleportation performs one qubit transfer using two classical bits. In this article, teleportation, superdense coding algorithms, and the Bell's inequality test in which Bell's inequality is violated with quantum mechanics are performed on both Qiskit and International Business Machines circuit composer, and results are compared and presented in detail. The results revealed that whether a faster-than-light signal transfer is possible using quantum mechanics depends on whether a copy of the quantum state is created or not. Finally, Bell's inequality created by classical logic violated by quantum mechanics is shown by experimental results.

关键词： superdense coding quantum teleportation Bell's inequality

来源：评论

学校读者我要写书评

暂无评论

Multi-qubit teleportation and multi-bit superdense coding via cascade splitting

引用

OPTICAL AND QUANTUM ELECTRONICS 2023年第11期55卷 1026-1026页

作者： Mastriani, Mario Florida Int Univ Knight Fdn Sch Comp & Informat Sci 11200 SW 8th St Miami FL 33199 USA

In this study, we present a simplified version of the quantum teleportation protocol for n-qubits and a generalized version of the superdense coding protocol for n-bits, in both cases, thanks to the cascade splitting technique. Both protocols will be analyzed on three notably different platforms: Quirk simulator, IBM QASM simulator of the IBM Q Experience program, and an optical table. The experiments on the three platforms show the excellent performance of both protocols. Finally, an analysis of the immunity of these protocols in the presence of an eavesdropper is incorporated.

关键词： Entanglement superdense coding Teleportation

来源：评论

学校读者我要写书评

暂无评论

Absolutely secure distributed superdense coding: entanglement requirement for optimality

引用

PHYSICA SCRIPTA 2023年第2期98卷 025104-025104页

作者： Dutta, Sagnik Banerjee, Asmita Panigrahi, Prasanta K. Indian Inst Sci Educ & Res Kolkata Dept Phys Sci Mohanpur 741246 W Bengal India Narula Inst Technol Kolkata 700109 W Bengal India

superdense coding uses entanglement as a resource to communicate classical information efficiently through quantum channels. A superdense coding method is optimal when its capacity reaches Holevo bound. We show that for optimality, maximal entanglement is a necessity across the bipartition of Alice and Bob, but neither absolute nor genuine multipartite entanglement is required. Unlike the previous schemes, which can transmit either even or odd bits of information, we demonstrate a generalized dense coding protocol using the genuine multipartite entangled GHZ state to send arbitrary information bits. Expressed in the eigenbasis of different Pauli operators, GHZ state is characterized by a unique parity pattern which enables us to formulate a security checking technique to ensure absolute security of the protocol. We show this method is better applicable in a scenario, where the initial information is distributed among spatially separated parties. Finally, optimizing the number of qubit(s) sent to Bob, we construct a distributed dense coding method, which completely depicts absolutely secure quantum communication between many to one party.

关键词： superdense coding GHZ state quantum communication

来源：评论

学校读者我要写书评

暂无评论

A Quantum Proxy Blind Signature Scheme Based on superdense coding

引用

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 2020年第4期59卷 1121-1128页

作者： Niu, Xu-Feng Ma, Wen-Ping Chen, Bu-Qing Liu, Ge Wang, Qi-Zheng Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Shaanxi Peoples R China PLA Informat Engn Univ Teaching & Res Sect Polit Luoyang 471003 Henan Peoples R China

In this paper, we show a new quantum proxy blind signature scheme based on single particle superdense coding. We only need perform unitary operator on single qubit to blind 2-bit classical information. The scheme also satisfies the properties of blindness, unforgeability and undeniability. It has a wide application to e-payment, e-voting, e-government, and etc.

关键词： Quantum proxy blind signature superdense coding Unitary operator

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：