165,786 research outputs found
Tables of subspace codes
One of the main problems of subspace coding asks for the maximum possible
cardinality of a subspace code with minimum distance at least over
, where the dimensions of the codewords, which are vector
spaces, are contained in . In the special case of
one speaks of constant dimension codes. Since this (still) emerging
field is very prosperous on the one hand side and there are a lot of
connections to classical objects from Galois geometry it is a bit difficult to
keep or to obtain an overview about the current state of knowledge. To this end
we have implemented an on-line database of the (at least to us) known results
at \url{subspacecodes.uni-bayreuth.de}. The aim of this recurrently updated
technical report is to provide a user guide how this technical tool can be used
in research projects and to describe the so far implemented theoretic and
algorithmic knowledge.Comment: 44 pages, 6 tables, 7 screenshot
Authentication of Quantum Messages
Authentication is a well-studied area of classical cryptography: a sender S
and a receiver R sharing a classical private key want to exchange a classical
message with the guarantee that the message has not been modified by any third
party with control of the communication line. In this paper we define and
investigate the authentication of messages composed of quantum states. Assuming
S and R have access to an insecure quantum channel and share a private,
classical random key, we provide a non-interactive scheme that enables S both
to encrypt and to authenticate (with unconditional security) an m qubit message
by encoding it into m+s qubits, where the failure probability decreases
exponentially in the security parameter s. The classical private key is 2m+O(s)
bits. To achieve this, we give a highly efficient protocol for testing the
purity of shared EPR pairs. We also show that any scheme to authenticate
quantum messages must also encrypt them. (In contrast, one can authenticate a
classical message while leaving it publicly readable.) This has two important
consequences: On one hand, it allows us to give a lower bound of 2m key bits
for authenticating m qubits, which makes our protocol asymptotically optimal.
On the other hand, we use it to show that digitally signing quantum states is
impossible, even with only computational security.Comment: 22 pages, LaTeX, uses amssymb, latexsym, time
Multi-party Quantum Computation
We investigate definitions of and protocols for multi-party quantum computing
in the scenario where the secret data are quantum systems. We work in the
quantum information-theoretic model, where no assumptions are made on the
computational power of the adversary. For the slightly weaker task of
verifiable quantum secret sharing, we give a protocol which tolerates any t <
n/4 cheating parties (out of n). This is shown to be optimal. We use this new
tool to establish that any multi-party quantum computation can be securely
performed as long as the number of dishonest players is less than n/6.Comment: Masters Thesis. Based on Joint work with Claude Crepeau and Daniel
Gottesman. Full version is in preparatio
Mixed State Entanglement and Quantum Error Correction
Entanglement purification protocols (EPP) and quantum error-correcting codes
(QECC) provide two ways of protecting quantum states from interaction with the
environment. In an EPP, perfectly entangled pure states are extracted, with
some yield D, from a mixed state M shared by two parties; with a QECC, an arbi-
trary quantum state can be transmitted at some rate Q through a
noisy channel without degradation. We prove that an EPP involving one-
way classical communication and acting on mixed state (obtained
by sharing halves of EPR pairs through a channel ) yields a QECC on
with rate , and vice versa. We compare the amount of entanglement
E(M) required to prepare a mixed state M by local actions with the amounts
and that can be locally distilled from it by EPPs using one-
and two-way classical communication respectively, and give an exact expression
for when is Bell-diagonal. While EPPs require classical communica-
tion, QECCs do not, and we prove Q is not increased by adding one-way classical
communication. However, both D and Q can be increased by adding two-way com-
munication. We show that certain noisy quantum channels, for example a 50%
depolarizing channel, can be used for reliable transmission of quantum states
if two-way communication is available, but cannot be used if only one-way com-
munication is available. We exhibit a family of codes based on universal hash-
ing able toachieve an asymptotic (or ) of 1-S for simple noise models,
where S is the error entropy. We also obtain a specific, simple 5-bit single-
error-correcting quantum block code. We prove that {\em iff} a QECC results in
high fidelity for the case of no error the QECC can be recast into a form where
the encoder is the matrix inverse of the decoder.Comment: Resubmission with various corrections and expansions. See also
http://vesta.physics.ucla.edu/~smolin/ for related papers and information. 82
pages latex including 19 postscript figures included using psfig macro
Orthogonal Codes for Robust Low-Cost Communication
Orthogonal coding schemes, known to asymptotically achieve the capacity per
unit cost (CPUC) for single-user ergodic memoryless channels with a zero-cost
input symbol, are investigated for single-user compound memoryless channels,
which exhibit uncertainties in their input-output statistical relationships. A
minimax formulation is adopted to attain robustness. First, a class of
achievable rates per unit cost (ARPUC) is derived, and its utility is
demonstrated through several representative case studies. Second, when the
uncertainty set of channel transition statistics satisfies a convexity
property, optimization is performed over the class of ARPUC through utilizing
results of minimax robustness. The resulting CPUC lower bound indicates the
ultimate performance of the orthogonal coding scheme, and coincides with the
CPUC under certain restrictive conditions. Finally, still under the convexity
property, it is shown that the CPUC can generally be achieved, through
utilizing a so-called mixed strategy in which an orthogonal code contains an
appropriate composition of different nonzero-cost input symbols.Comment: 2nd revision, accepted for publicatio
- …