Results 1  10
of
67
Sufficiency in quantum statistical inference
"... This paper attempts to develop a theory of sufficiency in the setting of noncommutative algebras parallel to the ideas in classical mathematical statistics. Sufficiency of a coarsegraining means that all information is extracted about the mutual relation of a given family of states. In the paper s ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
Hilbert space dimension, but proved here in generality: the KoashiImoto theorem on maps leaving a family of states invariant, and the characterization of the general form of states in the equality case of strong subadditivity.
Quantum entanglement
, 2007
"... Contents All our former experience with application of quantum theory seems to say: what is predicted by quantum formalism must occur in laboratory. But the essence of quantum formalism — entanglement, recognized by Einstein, Podolsky, Rosen and Schrödinger — waited over 70 years to enter to laborat ..."
Abstract

Cited by 84 (1 self)
 Add to MetaCart
Contents All our former experience with application of quantum theory seems to say: what is predicted by quantum formalism must occur in laboratory. But the essence of quantum formalism — entanglement, recognized by Einstein, Podolsky, Rosen and Schrödinger — waited over 70 years to enter to laboratories as a new resource as real as energy.
Linear optical quantum computing with photonic qubits
 Rev. Mod. Phys
"... Linear optics with photon counting is a prominent candidate for practical quantum computing. The protocol by Knill, Laflamme, and Milburn �2001, Nature �London � 409, 46 � explicitly demonstrates that efficient scalable quantum computing with single photons, linear optical elements, and projective m ..."
Abstract

Cited by 70 (4 self)
 Add to MetaCart
Linear optics with photon counting is a prominent candidate for practical quantum computing. The protocol by Knill, Laflamme, and Milburn �2001, Nature �London � 409, 46 � explicitly demonstrates that efficient scalable quantum computing with single photons, linear optical elements, and projective measurements is possible. Subsequently, several improvements on this protocol have started to bridge the gap between theoretical scalability and practical implementation. The original theory and its improvements are reviewed, and a few examples of experimental twoqubit gates are given. The use of realistic components, the errors they induce in the computation, and how these errors can be corrected is discussed.
The security of practical quantum key distribution
, 2009
"... Quantum key distribution �QKD � is the first quantum information task to reach the level of mature technology, already fit for commercialization. It aims at the creation of a secret key between authorized partners connected by a quantum channel and a classical authenticated channel. The security of ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
Quantum key distribution �QKD � is the first quantum information task to reach the level of mature technology, already fit for commercialization. It aims at the creation of a secret key between authorized partners connected by a quantum channel and a classical authenticated channel. The security of the key can in principle be guaranteed without putting any restriction on an eavesdropper’s power. This article provides a concise uptodate review of QKD, biased toward the practical side. Essential theoretical tools that have been developed to assess the security of the main experimental platforms are presented �discretevariable, continuousvariable, and distributedphasereference protocols�.
Quantum universal variablelength source coding
, 2002
"... We construct an optimal quantum universal variablelength code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of i ..."
Abstract

Cited by 24 (8 self)
 Add to MetaCart
We construct an optimal quantum universal variablelength code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0.
1 Compression of sources of probability distributions and density operators
, 2002
"... Abstract — We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon’s source coding problem. It has relation to the theory of common randomness, as well as to channel coding and rate–distortion theory: in the f ..."
Abstract
 Add to MetaCart
: in the first two subjects “inverses ” to established coding theorems can be derived, yielding a new approach to proving converse theorems, in the third we find a new proof of Shannon’s rate–distortion theorem. After reviewing the known lower bound for the optimal compression rate, we present a number
Exponents of quantum fixedlength pure state source coding
, 2002
"... We derive the optimal exponent of the error probability of the quantum fixedlength pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Josza et al. (PRL, 81, 1714 (1998))’s universal code. In the converse part, Nielsen and Kempe ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
We derive the optimal exponent of the error probability of the quantum fixedlength pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Josza et al. (PRL, 81, 1714 (1998))’s universal code. In the converse part, Nielsen and Kempe (PRL, 86, 5184 (2001))’s lemma is essential. In the direct part, a group representation theoretical type method is essential.
Received Day Month Year
, 2014
"... In majority of protocols of secure quantum communication (such as, BB84, B92, etc.), the unconditional security of the protocols are obtained by using conjugate coding (two or more mutually unbiased bases). Initially all the conjugatecodingbased protocols of secure quantum communication were restr ..."
Abstract
 Add to MetaCart
In majority of protocols of secure quantum communication (such as, BB84, B92, etc.), the unconditional security of the protocols are obtained by using conjugate coding (two or more mutually unbiased bases). Initially all the conjugatecodingbased protocols of secure quantum communication were restricted to quantum key distribution (QKD), but later on they were extended to other cryptographic tasks (such as, secure direct quantum communication and quantum key agreement). In contrast to the conjugatecodingbased protocols, a few completely orthogonalstatebased protocols of unconditionally secure QKD (such as, GoldenbergVaidman (GV) and N09) were also proposed. However, till the recent past orthogonalstatebased protocols were only a theoretical concept and were limited to QKD. Only recently, orthogonalstatebased protocols of QKD are experimentally realized and extended to cryptographic tasks beyond QKD. This paper aims to briefly review the orthogonalstatebased protocols of secure quantum communication that are recently introduced by our group and other researchers.
Results 1  10
of
67