Related papers: Quantum Simultaneous Protocols without Public Coin…
In this article we show for the first time that quantum coin flipping with security guarantees that are strictly better than any classical protocol is possible to implement with current technology. Our protocol takes into account all…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…
A quantum key distribution and identification protocol is proposed, which is based on entanglement swapping. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping,…
We present a quantum protocol which securely and implicitly implements a random shuffle to realize differential privacy in the shuffle model. The shuffle model of differential privacy amplifies privacy achievable via local differential…
Coherently manipulating multipartite quantum correlations leads to remarkable advantages in quantum information processing. A fundamental question is whether such quantum advantages persist only by exploiting multipartite correlations, such…
This paper investigates the role of interaction and coins in public-coin quantum interactive proof systems (also called quantum Arthur-Merlin games). While prior works focused on classical public coins even in the quantum setting, the…
We present a setup for quantum secret sharing using pseudo-GHZ states based on energy-time entanglement. In opposition to true GHZ states, our states do not enable GHZ-type tests of nonlocality, however, they bare the same quantum…
In this paper, we adopt \c{hi}-type states to design a novel circular semiquantum private comparison (SQPC) protocol which can determine the equality of private inputs from two semiquantum users within one round implementation under the…
This paper considers distributed computing on an anonymous quantum network, a network in which no party has a unique identifier and quantum communication and computation are available. It is proved that the leader election problem can…
In this paper, a bidirectional quantum teleportation protocol based on Einstein-Podolsky-Rosen (EPR) pairs and entanglement swapping is proposed. In this scheme, two users can simultaneously transmit an unknown single-qubit state to each…
Quantum key distribution (QKD) allows Alice and Bob to agree on a shared secret key, while communicating over a public (untrusted) quantum channel. Compared to classical key exchange, it has two main advantages: (i) The key is…
Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing inter-server communication -- an issue central to the study of communication complexity. Quantum resources…
We demonstrate a multipartite protocol to securely distribute and reconstruct a quantum state. A secret quantum state is encoded into a tripartite entangled state and distributed to three players. Any two of the three players are able to…
We present a scheme for three-party simultaneous quantum secure direct communication by using EPR pairs. In the scheme, three legitimate parties can simultaneously exchange their secret messages. It is also proved to be secure against the…
A protocol for multiparty quantum secret splitting is proposed with an ordered $N$ EPR pairs and Bell state measurements. It is secure and has the high intrinsic efficiency and source capacity as almost all the instances are useful and each…
We consider a family of quantum communication protocols involving $N$ partners. We demonstrate the existence of a link between the security of these protocols against individual attacks by the eavesdropper, and the violation of some Bell's…
We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation…
The no-go theorem regarding unconditionally secure Quantum Bit Commitment protocols is a relevant result in quantum cryptography. Such result has been used to prove the impossibility of unconditional security for other protocols, such as…
The paper presents general protocols for quantum teleportation between multiparties. It is shown how N parties can teleport N unknown quantum states to M other parties with the use of N+M qudits in the maximally entangled state. It is also…
The goal of demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity…