English
Related papers

Related papers: Serial composition of quantum coin-flipping, and b…

200 papers

Employing the fundamental laws of quantum physics, Quantum Key Distribution (QKD) promises the unconditionally secure distribution of cryptographic keys. However, in practical realisations, a QKD protocol is only secure, when the quantum…

Quantum Physics · Physics 2011-12-07 Muhammad Mubashir Khan , Jie Xu , Almut Beige

We consider the cloning of sequences of qubits prepared in the states used in the BB84 or 6-state quantum cryptography protocol, and show that the single-qubit fidelity is unaffected even if entire sequences of qubits are prepared in the…

Quantum Physics · Physics 2007-05-23 L. -P. Lamoureux , H. Bechmann-Pasquinucci , N. J. Cerf , N. Gisin , C. Macchiavello

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,…

Quantum Physics · Physics 2007-05-23 Fei Gao , Fenzhuo Guo , Qiaoyan Wen , Fuchen Zhu

Using unstable particles which decay by emitting neutrinos, we propose a quantum bit commitment protocol that is humanly impossible to break. Neutrinos carry away quantum information, but their interaction with matter is so weak that it…

Quantum Physics · Physics 2007-05-23 Chi-Yee Cheung

In a multi-party fair coin-flipping protocol, the parties output a common (close to) unbiased bit, even when some adversarial parties try to bias the output. In this work we focus on the case of an arbitrary number of corrupted parties.…

Cryptography and Security · Computer Science 2022-06-20 Niv Buchbinder , Iftach Haitner , Nissan Levi , Eliad Tsfadia

A new protocol for quantum key distribution based on entanglement swapping is presented. In this protocol, both certain key and random key can be generated without any loss of security. It is this property differs our protocol from the…

Quantum Physics · Physics 2007-05-23 Chong Li , He-Shan Song , Ling Zhou , Chun-Feng Wu

We demonstrate the possibility of controlling the success probability of a secret sharing protocol using a quantum cloning circuit. The cloning circuit is used to clone the qubits containing the encoded information and {\em en route} to the…

Quantum Physics · Physics 2018-08-17 Satyabrata Adhikari , Sovik Roy , Shantanav Chakraborty , V. Jagadish , M. K. Haris , Atul Kumar

A quantum key distribution protocol based on entanglement swapping is proposed. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping and obtain the secure key.…

Quantum Physics · Physics 2007-05-23 Fei Gao , Fenzhuo Guo , Qiaoyan Wen , Fuchen Zhu

Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this letter,…

Quantum Physics · Physics 2007-05-23 Harry Buhrman , Matthias Christandl , Patrick Hayden , Hoi-Kwong Lo , Stephanie Wehner

This paper addresses the controversy between Mayers, Lo and Chau on one side, and Yuen on the opposite side, on whether there exist or not unconditionally secure protocols. For such purpose, a complete classification of all possible bit…

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

Contrary to the assumption that most quantum error-correcting codes (QECC) make, it is expected that phase errors are much more likely than bit errors in physical devices. By employing the entanglement-assisted stabilizer formalism, we…

Quantum Physics · Physics 2011-04-27 Yuichiro Fujiwara , Min-Hsiu Hsieh

It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of…

Quantum Physics · Physics 2007-05-23 R. W. Spekkens , T. Rudolph

Quantum state transfer protocols are a major toolkit in many quantum information processing tasks, from quantum key distribution to quantum computation. To assess performance of a such a protocol, one often relies on the average fidelity…

Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and controlling a single effective exchange interaction and possibly a global magnetic field. This "encoded universality"…

Quantum Physics · Physics 2007-05-23 M. Mohseni , D. A. Lidar

I discuss a variety of issues relating to near-future experiments demonstrating fault-tolerant quantum computation. I describe a family of fault-tolerant quantum circuits that can be performed with 5 qubits arranged on a ring with…

Quantum Physics · Physics 2016-10-17 Daniel Gottesman

In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components;…

Quantum Physics · Physics 2013-05-29 Ying Li , Sean D. Barrett , Thomas M. Stace , Simon C. Benjamin

Symmetric private information retrieval is a cryptographic task allowing a user to query a database and obtain exactly one entry without revealing to the owner of the database which element was accessed. The task is a variant of general…

Quantum Physics · Physics 2025-09-09 Esther Hänggi , Severin Winkler

Entanglement detection is a fundamental task in quantum information science, serving as a cornerstone for quantum benchmarking and foundational studies. With an increasing qubit number that can be effectively controlled, there is a pressing…

We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to $M \geq 2$ parties and to $N \geq 2$ outcomes for any chosen outcome biases, and show them unconditionally secure. Our results prove that the…

Quantum Physics · Physics 2021-09-13 Damián Pitalúa-García

We show that the existence of a coin-flipping protocol safe against \emph{any} non-trivial constant bias (\eg $.499$) implies the existence of one-way functions. This improves upon a recent result of Haitner and Omri [FOCS '11], who proved…

Cryptography and Security · Computer Science 2021-05-05 Itay Berman , Iftach Haitner , Aris Tentes
‹ Prev 1 4 5 6 7 8 10 Next ›