相关论文: Quantum message authentication codes
Classical and quantum information theory are simply explained. To be more specific it is clarified why Shannon entropy is used as measure of classical information and after a brief review of quantum mechanics it is possible to demonstrate…
Even though a method to perfectly sign quantum messages has not been known, the arbitrated quantum signature scheme has been considered as one of good candidates. However, its forgery problem has been an obstacle to the scheme being a…
We derive universal codes for simultaneous transmission of classical messages and entanglement through quantum channels, possibly under attack of a malignant third party. These codes are robust to different kinds of channel uncertainty. To…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
Collective coherent (CC) errors are inevitable, as every physical qubit undergoes free evolution under its kinetic Hamiltonian. These errors can be more damaging than stochastic Pauli errors because they affect all qubits coherently,…
In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is twice as long as the…
Linearity and unitarity are two fundamental tenets of quantum theory. Any consequence that follows from these must be respected in the quantum world. The no-cloning theorem and the no-deleting theorem are the consequences of the linearity…
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies…
We consider the secure quantum communication over a network with the presence of a malicious adversary who can eavesdrop and contaminate the states. The network consists of noiseless quantum channels with the unit capacity and the nodes…
This paper studies quantum Arthur-Merlin games, which are Arthur-Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum information. As in the classical case, messages from Arthur to…
The goal of quantum key distribution (QKD) is to establish a secure key between two parties connected by an insecure quantum channel. To use a QKD protocol in practice, one has to prove that a finite size key is secure against general…
We show that the proof of the generalised quantum Stein's lemma [Brand\~ao & Plenio, Commun. Math. Phys. 295, 791 (2010)] is not correct due to a gap in the argument leading to Lemma III.9. Hence, the main achievability result of Brand\~ao…
There had been well known claims of ``provably unbreakable'' quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and therefore coin tossing) schemes…
This paper reports three almost trivial theorems that nevertheless appear to have significant import for quantum foundations studies. 1) A Gleason-like derivation of the quantum probability law, but based on the positive operator-valued…
Modern quantum engineering techniques enabled successful foundational tests of quantum mechanics. Yet, the universal validity of quantum postulates is an open question. Here we propose a new theoretical framework of Q-data tests, which…
The problem of security of quantum key protocols is examined. In addition to the distribution of classical keys, the problem of encrypting quantum data and the structure of the operators which perform quantum encryption is studied. It is…
We present some results that show that bounds from classical coding theory still work in many cases of quantum coding theory.
Recently a framework for assisted quantum error correction was proposed in which a specific type of error is allowed to occur on auxiliary qubits, which is in contrast to standard entanglement assistance that requires noiseless auxiliary…
By introducing an operator sum representation for arbitrary linear maps, we develop a generalized theory of quantum error correction (QEC) that applies to any linear map, in particular maps that are not completely positive (CP). This theory…
The article is taken out.