This article reviews the progress of quantum communication that utilizes photonic entanglement We start with a survey of various methods for generating entangled photons followed by an introduction of the theoretical ...
详细信息
This article reviews the progress of quantum communication that utilizes photonic entanglement We start with a survey of various methods for generating entangled photons followed by an introduction of the theoretical principles and the experimental implementations of quantum key distribution We then move on to a discussion of more Involved quantum communication protocols including quantum dense coding teleportation and quantum communication complexity After that we review the progress in free-space quantum communication decoherence-free subspace and quantum repeater protocols which are essential ingredients for long-distance quantum communication Practical realizations of quantum repeaters which require an interface between photons and quantum memories are discussed briefly Finally we draw concluding remarks considering the technical challenges and put forward an outlook on further developments of this field (C) 2010 Elsevier B V All rights reserved
We propose to search for new wave phenomena in the brain by using interference effects in analogy to the well-known double slit (Young) experiment. This method is able to extend the range of oscillation frequencies to...
详细信息
We propose to search for new wave phenomena in the brain by using interference effects in analogy to the well-known double slit (Young) experiment. This method is able to extend the range of oscillation frequencies to much higher values than currently accessible. It is argued that such experiments may test the hypothesis of the wave nature of information coding.
We have proven that there exists a quantum state approximating any multi-copy state universally when we measure the error by means of the normalized relative entropy. While the qubit case was proven by Krattenthaler a...
详细信息
We have proven that there exists a quantum state approximating any multi-copy state universally when we measure the error by means of the normalized relative entropy. While the qubit case was proven by Krattenthaler and Slater (IEEE Trans. IT 46, 810-819 (2009)), the general case has been open for more than ten years. For a deeper analysis, we have solved the mini-max problem concerning 'approximation error' up to the second order. Furthermore, we have applied this result to quantum lossless data compression, and have constructed a universal quantum lossless data compression.
A physical model which allows the use of the program code KARAT for simulating the quasi-steady state of the beam-plasma discharge with plasma regeneration from a neutral gas is developed. The results of simulation of...
详细信息
A physical model which allows the use of the program code KARAT for simulating the quasi-steady state of the beam-plasma discharge with plasma regeneration from a neutral gas is developed. The results of simulation of the modes of discharge at different potentials at the discharge collector are reported. The results obtained for isolated and grounded ion collectors are compared.
It is known that electroencephalograph (EEG) signals show specific responses with a event;e.g., visual stimulus, cognition or motor imagery. Especially users can control an electronic device by classifying and interpr...
详细信息
ISBN:
(纸本)9784907764388
It is known that electroencephalograph (EEG) signals show specific responses with a event;e.g., visual stimulus, cognition or motor imagery. Especially users can control an electronic device by classifying and interpreting the EEG signals;such a system is called brain-computer interface (BCI). In this study, we tried to construct the BCI system, based on transient visual evoked potentials (VEPs) and its visual stimuli flash in conformity with the sequence of binary Bose-Chaudhuri-Hocquenghem (BCH) codes.
Let G be a finite undirected graph with vertex set V(G). If v is an element of V (G), let N[v] denote the closed neighbourhood of v, i.e. v itself and all its adjacent vertices in G. An identifying code in G is a subs...
详细信息
Let G be a finite undirected graph with vertex set V(G). If v is an element of V (G), let N[v] denote the closed neighbourhood of v, i.e. v itself and all its adjacent vertices in G. An identifying code in G is a subset e of V (G) such that the sets N[v]boolean AND are nonempty and pairwise distinct for each vertex v is an element of V(G). We consider the problem of finding the minimum size of an identifying code in a given graph, which is known to be NP-hard. We give a linear algorithm that solves it in the class of trees, but show that the problem remains NP-hard in the class of planar graphs with arbitrarily large girth. (C) 2009 Elsevier Ltd. All rights reserved.
The conventional approach in computational neuroscience in favor of the efficient coding hypothesis goes from image statistics to perception. It has been argued that the behavior of the early stages of biological visu...
详细信息
The conventional approach in computational neuroscience in favor of the efficient coding hypothesis goes from image statistics to perception. It has been argued that the behavior of the early stages of biological visual processing (e.g., spatial frequency analyzers and their nonlinearities) may be obtained from image samples and the efficient coding hypothesis using no psychophysical or physiological information. In this work we address the same issue in the opposite direction: from perception to image statistics. We show that psychophysically fitted image representation in V1 has appealing statistical properties, for example, approximate PDF factorization and substantial mutual information reduction, even though no statistical information is used to fit the V1 model. These results are complementary evidence in favor of the efficient coding hypothesis.
Bent functions are maximally nonlinear Boolean functions with an even number of variables. They were introduced by Rothaus in 1976. For their own sake as interesting combinatorial objects, but also because of their re...
详细信息
ISBN:
(纸本)9781424482641
Bent functions are maximally nonlinear Boolean functions with an even number of variables. They were introduced by Rothaus in 1976. For their own sake as interesting combinatorial objects, but also because of their relations to coding theory (Reed-Muller codes) and applications in cryptography (design of stream ciphers), they have attracted a lot of research, specially in the last 15 years. The class of bent functions contains a subclass of functions, introduced by Youssef and Gong in 2001, the so-called hyper-bent functions whose properties are still stronger and whose elements are still rarer than bent functions. Bent and hyper-bent functions are not classified. A complete classification of these functions is elusive and looks hopeless. So, it is important to design constructions in order to know as many of (hyper)-bent functions as possible. This paper is devoted to the constructions of bent and hyper-bent Boolean functions in polynomial forms. We survey and present an overview of the constructions discovered recently. We extensively investigate the link between the bentness property of such functions and some exponential sums (involving Dickson polynomials).
Recently Kurosawa and Suzuki considered almost secure (1-phase n-channel) message transmission when n = (2t +1). The authors gave a lower bound on the communication complexity and presented an exponential time algorit...
详细信息
ISBN:
(纸本)9783642126772
Recently Kurosawa and Suzuki considered almost secure (1-phase n-channel) message transmission when n = (2t +1). The authors gave a lower bound on the communication complexity and presented an exponential time algorithm achieving this bound. In this paper we present a polynomial time protocol achieving the same security properties for the same network conditions. Additionally, we introduce and formalize new security parameters to message transmission protocols which we feel are missing and necessary in the literature. We also focus on 2-phase protocols. We present a protocol achieving perfectly secure message transmission of a single message with O(n(2)) communication complexity in polynomial time. This is an improvement on previous protocols which achieve perfectly secure message transmission of a single message with a communication complexity of O(n(3)).
This paper, studies the comparative performance of a traditional and Concatenated coding schemes for transmission of digital data over a mobile communication channel. Traditional codes are effective for reliable trans...
详细信息
ISBN:
(纸本)9781424455690
This paper, studies the comparative performance of a traditional and Concatenated coding schemes for transmission of digital data over a mobile communication channel. Traditional codes are effective for reliable transmission of information over hostile channel when the errors caused by the channel are statistically independent. This is the case for AWGN channel. However, some channels exhibits bursty error characteristics, one example is the mobile communication channel, such a case a concatenated block code is more effective to deal with such type of errors. Results presented in this paper prove that concatenated code has better performance than traditional code which is Reed-Solomon code and hence suggested for mobile communication.
暂无评论