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

arXiv:2305.00389 · Quantum Information Processing

Many facets of multiparty broadcasting of known quantum information using optimal quantum resource

Satish Kumar, Anirban Pathak

Published Apr 23, 2024• 3 citations
arXivHTMLPDF
DOI
10.1007/s11128-024-04370-5

Related papers

Resource reduction in multiparty quantum secret sharing of both classical and quantum information under noisy scenario

Nirupam Basak, Goutam Paul

arXiv:2504.16709•Quantum Information Processing•Apr 6, 2026•0 citations

Optimal Broadcasting of Quantum Information via Teleporation

Mio Murao, Daniel Jonathan, Martin Bodo Plenio +1 more

Elsevier eBooks•Jan 1, 1999•0 citations

Broadcast-Efficient Secure Multiparty Computation.

Juan A. Garay, Clint Givens, Rafail Ostrovsky

Secure multiparty computation (MPC) is perhaps the most popular paradigm in the area of cryptographic protocols. It allows several mutually untrustworthy parties to jointly compute a function of their private inputs, without revealing to each other information about those inputs. In the case of unconditional (information-theoretic) security, protocols are known which tolerate a dishonest minority of players, who may coordinate their attack and deviate arbitrarily from the protocol specification. It is typically assumed in these results that parties are connected pairwise by authenticated, private channels, and that in addition they have access to a “broadcast ” channel. Broadcast allows one party to send a consistent message to all other parties, guaranteeing consistency even if the broadcaster is corrupted. Because broadcast cannot be simulated on the point-to-point network when more than a third of the parties are corrupt, it is impossible to construct general MPC protocols in this setting without using a broadcast channel (or some equivalent addition to the model). A great deal of research has focused on increasing the efficiency of MPC, primarily in terms of round complexity and communication complexity. In this work we propose a refinement of the round complexity which we term broadcast complexity. We view the broadcast channel as an expensive resource

•Jan 1, 2012•3 citations

Experimental demonstration of universal symmetric quantum telecloning

Sascha Gaertner, Jonathan Wei Zhong Lau, Nikolai Kiesel +2 more

Quantum telecloning is a multiparty quantum communication protocol which allows quantum information broadcasting. It can be, therefore, seen as a generalization of quantum teleportation. However, in contrast to quantum teleportation, it requires the resource of multipartite entanglement. Here we present an experimental demonstration of universal symmetric 1->2 quantum telecloning of qubits via four-photon polarisation entanglement.

arXiv:0908.2632•Aug 18, 2009•1 citation

Design and Experimental Realization of Various Protocols for Secure Quantum Computation and Communication

Satish Kumar

A set of new schemes for quantum computation and communication have been either designed or experimentally realized using optimal quantum resources. A multi-output quantum teleportation scheme, where a sender (Alice) teleports an m and m+1-qubit GHZ-like unknown state to a receiver (Bob), has been demonstrated using two copies of the Bell state instead of a five-qubit cluster state and implemented on IBM's quantum computer for the m=1 case. Another scheme, known as quantum broadcasting where a known state is sent to two spatially separated parties (Bob and Charlie) has also been realized using two Bell states. It is shown that existing quantum broadcasting schemes can be reduced to multiparty remote state preparation. After achieving teleportation of unknown and known states, sending a quantum operator becomes the next step. A scheme for remote implementation of operators (RIO), specifically a controlled joint-RIO (CJRIO), has been proposed using a four-qubit hyper-entangled state involving spatial and polarization degrees of freedom. In this direction, two more variants, remote implementation of hidden and partially unknown operators (RIHO and RIPUO) have also been proposed. Their success probabilities are analyzed considering dissipation of an auxiliary coherent state interacting with the environment. For secure multiparty tasks like quantum voting or auction, secure multiparty quantum computation (SMQC) becomes essential. A quantum anonymous voting (QAV) scheme has been experimentally implemented on IBM's quantum computer. Finally, two quantum key distribution (QKD) protocols, coherent one-way (COW) and differential phase shift (DPS), are experimentally demonstrated and the key rates are analyzed as functions of post-processing parameters and detector dead times across various distances.

arXiv:2507.09532•Jul 13, 2025•0 citations

Family of quantum mutual information in multiparty quantum systems

Asutosh Kumar

arXiv:2407.16365•Physics Letters A•Nov 22, 2024•6 citations
Secure multiparty computation (MPC) is perhaps the most popular paradigm in the area of cryptographic protocols. It allows several mutually untrustworthy parties to jointly compute a function of their private inputs, without revealing to each other information about those inputs. In the case of unconditional (information-theoretic) security, protocols are known which tolerate a dishonest minority of players, who may coordinate their attack and deviate arbitrarily from the protocol specification. It is typically assumed in these results that parties are connected pairwise by authenticated, private channels, and that in addition they have access to a “broadcast ” channel. Broadcast allows one party to send a consistent message to all other parties, guaranteeing consistency even if the broadcaster is corrupted. Because broadcast cannot be simulated on the point-to-point network when more than a third of the parties are corrupt, it is impossible to construct general MPC protocols in this setting without using a broadcast channel (or some equivalent addition to the model). A great deal of research has focused on increasing the efficiency of MPC, primarily in terms of round complexity and communication complexity. In this work we propose a refinement of the round complexity which we term broadcast complexity. We view the broadcast channel as an expensive resource
A set of new schemes for quantum computation and communication have been either designed or experimentally realized using optimal quantum resources. A multi-output quantum teleportation scheme, where a sender (Alice) teleports an m and m+1-qubit GHZ-like unknown state to a receiver (Bob), has been demonstrated using two copies of the Bell state instead of a five-qubit cluster state and implemented on IBM's quantum computer for the m=1 case. Another scheme, known as quantum broadcasting where a known state is sent to two spatially separated parties (Bob and Charlie) has also been realized using two Bell states. It is shown that existing quantum broadcasting schemes can be reduced to multiparty remote state preparation. After achieving teleportation of unknown and known states, sending a quantum operator becomes the next step. A scheme for remote implementation of operators (RIO), specifically a controlled joint-RIO (CJRIO), has been proposed using a four-qubit hyper-entangled state involving spatial and polarization degrees of freedom. In this direction, two more variants, remote implementation of hidden and partially unknown operators (RIHO and RIPUO) have also been proposed. Their success probabilities are analyzed considering dissipation of an auxiliary coherent state interacting with the environment. For secure multiparty tasks like quantum voting or auction, secure multiparty quantum computation (SMQC) becomes essential. A quantum anonymous voting (QAV) scheme has been experimentally implemented on IBM's quantum computer. Finally, two quantum key distribution (QKD) protocols, coherent one-way (COW) and differential phase shift (DPS), are experimentally demonstrated and the key rates are analyzed as functions of post-processing parameters and detector dead times across various distances.