English
Related papers

Related papers: MLC No-go Theorems: Reinterpretation and Extension

200 papers

We propose a teleportation protocol that enables perfect transmission of a qubit using a partially entangled two-qutrit quantum channel. Within our scheme, we analyze the relationship among the three key ingredients of teleportation: (i)…

Quantum Physics · Physics 2026-02-05 Zhu Dian , Fulin Zhang , Jingling Chen

Mayers, Lo and Chau argued that all quantum bit commitment protocols are insecure, because there is no way to prevent an Einstein-Podolsky-Rosen (EPR) cheating attack. However, Yuen presented some protocols which challenged the previous…

Quantum Physics · Physics 2007-05-23 Giacomo Mauro D'Ariano

In this paper, a three-party secure semiquantum summation protocol, which can calculate the modulo 2 addition of the private bits from one quantum participant and two classical participants, is constructed by only using single qubits as the…

Quantum Physics · Physics 2022-06-15 Jia-Li , Hu , Tian-Yu Ye

We devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has…

Quantum Physics · Physics 2023-09-07 Kazuki Ikeda , Adam Lowe

After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner,…

Quantum Physics · Physics 2011-03-02 Roger Colbeck

The cryptographic task of secure multi-party (classical) computation has received a lot of attention in the last decades. Even in the extreme case where a computation is performed between $k$ mutually distrustful players, and security is…

Quantum Physics · Physics 2020-06-17 Yfke Dulek , Alex B. Grilo , Stacey Jeffery , Christian Majenz , Christian Schaffner

It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to…

Quantum Physics · Physics 2007-05-23 Gilles Brassard , Claude Crépeau , Dominic Mayers , Louis Salvail

Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks through it's ability to preserve privacy and integrity of the highly valuable computations they would enable.…

Quantum Physics · Physics 2023-04-18 Theodoros Kapourniotis , Elham Kashefi , Luka Music , Harold Ollivier

Multipartite quantum correlations, in spite of years of intensive research, still leave many questions unanswered. While bipartite entanglement is relatively well understood for Gaussian states, the complexity of mere qualitative…

Quantum Physics · Physics 2014-05-01 Ondřej Černotík , Jaromír Fiurášek

Quantum teleportation circumvents the uncertainty principle using dual channels: a quantum one consisting of previously-shared entanglement, and a classical one, together allowing the disembodied transport of an unknown quantum state over…

Quantum Physics · Physics 2016-06-14 Hatim Salih

Secure multi-party quantum computation (MPQC) protocol is a cryptographic primitive allowing error-free distributed quantum computation to a group of $n$ mutually distrustful quantum nodes even when some quantum nodes disobey the…

Quantum Physics · Physics 2024-11-18 Petr A. Mishchenko , Keita Xagawa

In this paper, we build upon the model of two-party quantum computation introduced by Salvail et al. [SSS09] and show that in this model, only trivial correct two-party quantum protocols are weakly self-composable. We do so by defining a…

Quantum Physics · Physics 2009-06-15 Louis Salvail , Miroslava Sotakova

We consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum channel. Our main result is a capacity theorem that gives a three-dimensional achievable rate region. Points in the…

Quantum Physics · Physics 2010-08-23 Min-Hsiu Hsieh , Mark M. Wilde

In this paper we present a new unified theoretical framework that describes the full dynamics of quantum computation. Our formulation allows any questions pertaining to the physical behavior of a quantum computer to be framed, and in…

Quantum Physics · Physics 2007-05-23 Gerald Gilbert , Michael Hamrick , F. Javier Thayer

Fundamental primitives such as bit commitment and oblivious transfer serve as building blocks for many other two-party protocols. Hence, the secure implementation of such primitives are important in modern cryptography. In this work, we…

Bit commitment protocols, whose security is based on the laws of quantum mechanics alone, are generally held to be impossible on the basis of a concealment-bindingness tradeoff. A strengthened and explicit impossibility proof has been given…

Quantum Physics · Physics 2013-12-03 G. Chiribella , G. M. D'Ariano , P. Perinotti , D. M. Schlingemann , R. F. Werner

Alice can distribute a quantum state $|\phi>$ to $N$ spatially separated parties(say Bobs) by telecloning. It is possible for Charlie to reconstruct the quantum state to him if he shares same kind of telecloning quantum channel with Bobs…

Quantum Physics · Physics 2007-05-23 Partha Mukhopadhyay

We investigate two senders and one receiver multiparty communication scenario. Following Phys.Rev.A83, 062112 and arXiv : 2506.07699, we study multiparty communication bounded by dimension and distinguishability. We provide an explicit…

Quantum Physics · Physics 2025-12-08 Ankush Pandit

Quantum entanglement distillation protocols are LOCC protocols between Alice and Bob that convert imperfect EPR pairs, or, in general, partially entangled bipartite states into perfect or near-perfect EPR pairs. The classical communication…

Quantum Physics · Physics 2007-05-23 Andris Ambainis , Ke Yang

The oblivious transfer primitive is sufficient to implement secure multiparty computation. However, secure multiparty computation based only on classical cryptography is severely limited by the security and efficiency of the oblivious…

‹ Prev 1 3 4 5 6 7 10 Next ›