English
Related papers

Related papers: Information-Theoretic Description of No-go Theorem…

200 papers

Symmetries of both closed and open-system dynamics imply many significant constraints. These generally have instantiations in both classical and quantum dynamics (Noether's theorem, for instance, applies to both sorts of dynamics). We here…

Quantum Physics · Physics 2020-11-03 Iman Marvian , Robert W. Spekkens

Quantum protocols for bit commitment have been proposed and it is largely accepted that unconditionally secure quantum bit commitment is not possible; however, it can be more secure than classical bit commitment. In despite of its…

Quantum Physics · Physics 2008-01-07 Rubens Viana Ramos , Fabio Alencar Mendonca

By using local quantum teleportation of a fixed state to one qubit of an entangled pair sent from the other party, it is shown how one party can commit a bit with only classical information as evidence that results in an unconditionally…

Quantum Physics · Physics 2007-05-23 Horace P. Yuen

We prove a new impossibility for quantum information (the no-splitting theorem): an unknown quantum bit (qubit) cannot be split into two complementary qubits. This impossibility, together with the no-cloning theorem, demonstrates that an…

Quantum Physics · Physics 2009-11-11 D. L. Zhou , B. Zeng , L. You

No-broadcasting theorem is one of the most fundamental results in quantum information theory; it guarantees that the simplest attacks on any quantum protocol, based on eavesdropping and copying of quantum information, are impossible. Due to…

Quantum Physics · Physics 2023-04-12 Teiko Heinosaari , Anna Jenčová , Martin Plávala

Information Causality contributes to the program of deriving fundamentals of quantum theory from information theoretic principles. It puts restrictions on the amount of information learned by a party (Bob) from the other party (Alice) in a…

Quantum Physics · Physics 2013-04-04 Salman Beigi , Amin Gohari

We propose a framework of bit commitment protocol using a comparison scheme and present a compound comparison scheme based on counterfactual cryptography. Finally, we propose a counterfactual quantum bit commitment protocol. In security…

Quantum Physics · Physics 2018-07-05 Ya-Qi Song , Li Yang

We propose a new classical bit commitment protocol using the relativistic constraint that signals cannot travel faster than the speed of light $c$. This protocol is unconditionally secure against both classical or quantum attacks. The…

Quantum Physics · Physics 2014-04-29 Chi-Yee Cheung

Bit commitment is a fundamental cryptographic primitive and a cornerstone for numerous two-party cryptographic protocols, including zero-knowledge proofs. However, it has been proven that unconditionally secure bit commitment, both…

Quantum Physics · Physics 2025-02-20 Ziad Chaoui , Anna Pappa , Matteo Rosati

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

The aim of this thesis project is to investigate the bit commitment protocol in the framework of operational probabilistic theories. In particular a careful study is carried on the feasibility of bit commitment in the non-local boxes…

Quantum Physics · Physics 2021-01-25 Lorenzo Giannelli

Pusey, Barrett, and Rudolph introduce a new no-go theorem for hidden-variables models of quantum theory. We make precise the class of models targeted and construct equivalent models that evade the theorem. The theorem requires assumptions…

Quantum Physics · Physics 2012-06-29 Maximilian Schlosshauer , Arthur Fine

A new relativistic quantum protocol is proposed allowing to implement the bit commitment scheme. The protocol is based on the idea that in the relativistic case the field propagation to the region of space accessible to measurement…

Quantum Physics · Physics 2007-05-23 S. N. Molotkov , S. S. Nazin

In complete erasure any arbitrary pure quantum state is transformed to a fixed pure state by irreversible operation. Here we ask if the process of partial erasure of quantum information is possible by general quantum operations, where…

Quantum Physics · Physics 2011-11-28 Arun K. Pati , Barry C. Sanders

In this paper dedicated to the memory of Walter Philipp, we formalize the rules of classical$\to$ quantum correspondence and perform a rigorous mathematical analysis of the assumptions in Bell's NO-GO arguments.

Quantum Physics · Physics 2015-06-26 Andrei Khrennikov

We construct a quantum bit commitment scheme using a double-slit setup similar to Wheeler's delayed choice experiment. Bob sends photons toward the double-slit, and Alice commits by determining either the slit from which each photon emerges…

Quantum Physics · Physics 2015-04-22 Chi-Yee Cheung

Einstein-Podolsky-Rosen- (EPR) and the more powerful Mayers-Lo-Chau attack impose a serious constraint on quantum bit commitment (QBC). As a way to circumvent them, it is proposed that the quantum system encoding the commitment chosen by…

Quantum Physics · Physics 2007-05-23 R. Srikanth

It has been conjectured that counterfactual communication is impossible, even for post-selected quantum particles. We strongly challenge this by proposing precisely such a counterfactual scheme where -- unambiguously -- none of Alice's…

Quantum Physics · Physics 2022-05-19 Hatim Salih , Will McCutcheon , Jonte Hance , John Rarity

We prove a no-go theorem for storing quantum information in equilibrium systems. Namely, quantum information cannot be stored in a system with time-independent Hamiltonian interacting with heat bath of temperature $T>0$ during time that…

Quantum Physics · Physics 2007-05-23 Robert Alicki , Michal Horodecki

We revisit the familiar scenario involving two parties in relative motion, in which Alice stays at rest while Bob goes on a journey at speed $\beta c$ along an arbitrary trajectory and reunites with Alice after a certain period of time. It…

Information Theory · Computer Science 2024-05-29 Mladen Kovačević , Iosif Pinelis , Marios Kountouris
‹ Prev 1 3 4 5 6 7 10 Next ›