相关论文: Lower bound for a class of weak quantum coin flipp…
Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…
The locker puzzle is a game played by multiple players against a referee. It has been previously shown that the best strategy that exists cannot succeed with probability greater than 1-ln2 \approx 0.31, no matter how many players are…
We propose a new cryptographic protocol. It is suggested to encode information in ordinary binary form into many-qubit entangled states with the help of a quantum computer. A state of qubits (realized, e.g., with photons) is transmitted…
Absorption of two-state coined quantum walks on a finite line with two sinks located at $N$ and $-N$ is investigated. Elaborating on the results of Konno et al., J. Phys. A: Math. Gen. 36 241 (2003), we derive closed formulas for the…
Recently, Zhang, Li, and Guo have proposed a particular eavesdropping attack [Phys. Rev. A {\bf 63}, 036301 (2001), quant-ph/0009042] which shows that my quantum key distribution protocol based on entanglement swapping [Phys. Rev. A {\bf…
This study proposes a new lightweight quantum key distribution (LQKD) protocol based on the four-particle cluster state within a quantum-restricted environment. The protocol enables a quantum-capable user to simultaneously establish two…
Quasi-twisted (QT) codes generalize several important families of linear codes, including cyclic, constacyclic, and quasi-cyclic codes. Despite their potential, to the best of our knowledge, there exists no efficient decoding algorithm for…
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum…
We perform the scattering analysis of the evolution operator of quantum walks with an anisotropic coin, and we prove a weak limit theorem for their asymptotic velocity. The quantum walks that we consider include one-defect models, two-phase…
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result of our simulation, we show that if the quantum k-party communication complexity of a…
A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is…
Due to the impossibility results of Mayers and Lo/Chau it is generally thought that a quantum channel is cryptographically strictly weaker than oblivious transfer. In this paper we prove that in a three party scenario a quantum channel can…
Quantum mechanics is known to provide significant improvements in information processing tasks when compared to classical models. These advantages range from computational speeds-up to security improvements. A key question is where these…
Quantum Game Theory provides us with new tools for practising games and some other risk related enterprices like, for example, gambling. The two party gambling protocol presented by Goldenberg {\it et al} is one of the simplest yet still…
In quantum Shannon theory, various kinds of quantum entropies are used to characterize the capacities of noisy physical systems. Among them, min-entropy and its smooth version attract wide interest especially in the field of quantum…
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…
Consider the boundary case in a one-dimensional super-critical branching random walk. It is known that upon the survival of the system, the minimal position after $n$ steps behaves in probability like ${3\over 2} \log n$ when $n\to \infty$.…
The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. It is based usually on single-photon polarization states. Unfortunately, the implemented ``qubits'' in the usual…
We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.
Alice is a charismatic quantum cryptographer who believes her parties are unmissable; Bob is a (relatively) glamorous string theorist who believes he is an indispensable guest. To prevent possibly traumatic collisions of self-perception and…