zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Communication with qubit pairs. (English) Zbl 1075.81505
Chen, Goong (ed.) et al., Mathematics of quantum computation. Boca Raton, FL: Chapman & Hall/ CRC (ISBN 1-58488-282-4). Computational Mathematics Series, 359-401 (2002).
Quantum information is transmitted either by single qubit, and the model is then probabilistic, or by qubit pairs, in which case the scheme is deterministic. Here one describes and analyzes this last nonrandom model. As a preliminary example, the authors bear in mind the (Vaidman-Aharonov-Albert) mean kings first problem and the mean kings second problem of which a careful analysis will introduce to quantum cryptography. Then cryptography wih single qubits is considered via minimizing error probability or maximizing raw information. In a like manner, cryptography with qubit pairs are dealt with via both approaches. Then, by using an idealized single-photon model, one shows how the schemes for secure key distribution can be realized exponentially by quantum-optical means.
MSC:
81P68Quantum computation