Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Electronics Letters

Broadcast in point-point network with quantum mechanism

Huang Zheng, Chen Ke-fei

Published May 1, 2003• 0 citations
Publisher

Abstract

A method for solving the broadcast problem in a point–point network with 1/3 players being a false player is presented. The method explores the interesting property of Qutrits (quantum triplets) in the Aharonov State and solves the broadcast problem at the price of sharing the Qutrits among the players in the initial phase.
DOI
10.1049/el:20030497

Related papers

Four-Party Quantum Broadcast Scheme Based on Aharonov State

Yuan Li, Zeng Gui-Hua

In this paper, we propose a solution based on four-qubit Aharonov state to an old problem by using the property of congruence. The proposed scheme may realize the broadcast among four participants, therefore, it makes progress to the three-party broadcast realized previously. Using pairwise quantum channels and entangled qubits, the detection between these players also can be accomplished. Finally, the feasibility of the protocol and the analysis of security are illustrated.

Communications in Theoretical Physics•Aug 1, 2008•19 citations

Quantum solution to a three player Kolkata restaurant problem using entangled qutrits

SharifPuya, HeydariHoshang

Three player quantum Kolkata restaurant problem is modelled using three entangled qutrits. This first use of three level quantum states in this context is a step towards a N-choice generalization o...

Quantum Information and Computation•Mar 1, 2014•0 citations

Secretly Broadcasting Five Qubit Entangled state among three parties from W- type states

Indranil Chakrabarty, Binayak Samadder Choudhury

In this work we investigate the problem of secretly broadcasting five qubit entangled state between three different partners We implement the protocol described in ref [16] on three particle W-state shared by three distant partners Alice,Bob and Charlie. The problem is interesting in the sense it is the first attempt to broadcast five qubit entangled state between three parties.

arXiv:0804.2568•Apr 16, 2008•0 citations

Quantum Secret Broadcast for Wireless Quantum Networks

Tao Shang, Gang Du, Jianwei Liu

In wireless quantum networks, nodes communicate by means of pre-distribution for entangled pairs and relay path establishment for quantum teleportation. However, simple point-to-point communication seriously restricts the efficiency of quantum communication. Inspired by sharing idea of quantum secret sharing (QSS), which is based on three collaborative nodes with pre-shared GHZ (Greenberger-Horne-Zeilinger) states, we propose a quantum secret broadcast scheme to improve network performance. In a cluster net-work cored on three parties of QSS, three cluster heads with pre-shared GHZ states are senders, while cluster members are receivers. One cluster head encodes secret messages on auxiliary particles by performing certain operations on them with GHZ particles, then three cluster heads measure their own par-ticles and broadcast measurement results honestly. Based on the specific correlation of measurement results and secret messages, all receivers can re-cover the secret messages. Furthermore, to prevent eavesdropping, cluster heads can update an encoding key periodically. Analysis shows the proposed scheme is more efficient than previous schemes in wireless quantum net-works, especially when the number of receivers is larger. Besides, in the proposed scheme, attacks on quantum channel based on GHZ state can be detected, and eavesdroppers cannot recover messages correctly for lack of suitable decoding key.

International Journal of Communications Network and System Sciences•Jan 1, 2017•0 citations

Quantum games

Mei Lyn Jaclyn Thang

Quantum games have demonstrated to propose a new point of view for the solution of the classical problems and dilemmas in game theory. It has been shown in many literatures that quantum games are more efficient than classical games and provide a greater and more efficient solution. As interest in multi-player quantum games grow, methods are proposed to analyze and obtain efficient solutions for these problems. In quantum games with cooperation, analysis so far have taken into consideration all possible scenarios for the multiple players playing different strategies and in the calculation of payoff, setting the payoff of scenarios not possible to be zero. Chapter 5 presents the analysis of multiple players (three players and four players) using this method of analysis. In Chapter 6, a modification of the analysis was done. In Chapter 5, it should be noted that the probabilities of participating scenarios do not sum to unity which is technically not ideal. Hence Chapter 6 addresses this by performing re-normalizing the probabilities of the participating scenarios so that the probabilities sum to unity. The analysis was done for three and four player games and a comparison was made between the un-normalized method and the re-normalized method. It was found that re-normalization provides a more accurate representation of the classical game and hence can be a better solution for the quantum game.

•Jan 1, 2010•0 citations

Global broadcast by broadcasts among subsets of players

Matthias Fitzi, Ueli M. Maurer

In the standard model with only pairwise communication channels, unconditionally secure broadcast among n players is achievable if and only if the number t of corrupted players satisfies t<n/3. We show that, when additionally given broadcast among each subset of three players then global broadcast is achievable if t<n/2.

IEEE International Symposium on Information Theory (ISIT)•Nov 7, 2002•0 citations
In wireless quantum networks, nodes communicate by means of pre-distribution for entangled pairs and relay path establishment for quantum teleportation. However, simple point-to-point communication seriously restricts the efficiency of quantum communication. Inspired by sharing idea of quantum secret sharing (QSS), which is based on three collaborative nodes with pre-shared GHZ (Greenberger-Horne-Zeilinger) states, we propose a quantum secret broadcast scheme to improve network performance. In a cluster net-work cored on three parties of QSS, three cluster heads with pre-shared GHZ states are senders, while cluster members are receivers. One cluster head encodes secret messages on auxiliary particles by performing certain operations on them with GHZ particles, then three cluster heads measure their own par-ticles and broadcast measurement results honestly. Based on the specific correlation of measurement results and secret messages, all receivers can re-cover the secret messages. Furthermore, to prevent eavesdropping, cluster heads can update an encoding key periodically. Analysis shows the proposed scheme is more efficient than previous schemes in wireless quantum net-works, especially when the number of receivers is larger. Besides, in the proposed scheme, attacks on quantum channel based on GHZ state can be detected, and eavesdroppers cannot recover messages correctly for lack of suitable decoding key.
Quantum games have demonstrated to propose a new point of view for the solution of the classical problems and dilemmas in game theory. It has been shown in many literatures that quantum games are more efficient than classical games and provide a greater and more efficient solution. As interest in multi-player quantum games grow, methods are proposed to analyze and obtain efficient solutions for these problems. In quantum games with cooperation, analysis so far have taken into consideration all possible scenarios for the multiple players playing different strategies and in the calculation of payoff, setting the payoff of scenarios not possible to be zero. Chapter 5 presents the analysis of multiple players (three players and four players) using this method of analysis. In Chapter 6, a modification of the analysis was done. In Chapter 5, it should be noted that the probabilities of participating scenarios do not sum to unity which is technically not ideal. Hence Chapter 6 addresses this by performing re-normalizing the probabilities of the participating scenarios so that the probabilities sum to unity. The analysis was done for three and four player games and a comparison was made between the un-normalized method and the re-normalized method. It was found that re-normalization provides a more accurate representation of the classical game and hence can be a better solution for the quantum game.