15,103 research outputs found
Tema Con Variazioni: Quantum Channel Capacity
Channel capacity describes the size of the nearly ideal channels, which can
be obtained from many uses of a given channel, using an optimal error
correcting code. In this paper we collect and compare minor and major
variations in the mathematically precise statements of this idea which have
been put forward in the literature. We show that all the variations considered
lead to equivalent capacity definitions. In particular, it makes no difference
whether one requires mean or maximal errors to go to zero, and it makes no
difference whether errors are required to vanish for any sequence of block
sizes compatible with the rate, or only for one infinite sequence.Comment: 32 pages, uses iopart.cl
State-of-the-art in aerodynamic shape optimisation methods
Aerodynamic optimisation has become an indispensable component for any aerodynamic design over the past 60 years, with applications to aircraft, cars, trains, bridges, wind turbines, internal pipe flows, and cavities, among others, and is thus relevant in many facets of technology. With advancements in computational power, automated design optimisation procedures have become more competent, however, there is an ambiguity and bias throughout the literature with regards to relative performance of optimisation architectures and employed algorithms. This paper provides a well-balanced critical review of the dominant optimisation approaches that have been integrated with aerodynamic theory for the purpose of shape optimisation. A total of 229 papers, published in more than 120 journals and conference proceedings, have been classified into 6 different optimisation algorithm approaches. The material cited includes some of the most well-established authors and publications in the field of aerodynamic optimisation. This paper aims to eliminate bias toward certain algorithms by analysing the limitations, drawbacks, and the benefits of the most utilised optimisation approaches. This review provides comprehensive but straightforward insight for non-specialists and reference detailing the current state for specialist practitioners
New class of quantum error-correcting codes for a bosonic mode
We construct a new class of quantum error-correcting codes for a bosonic mode
which are advantageous for applications in quantum memories, communication, and
scalable computation. These 'binomial quantum codes' are formed from a finite
superposition of Fock states weighted with binomial coefficients. The binomial
codes can exactly correct errors that are polynomial up to a specific degree in
bosonic creation and annihilation operators, including amplitude damping and
displacement noise as well as boson addition and dephasing errors. For
realistic continuous-time dissipative evolution, the codes can perform
approximate quantum error correction to any given order in the timestep between
error detection measurements. We present an explicit approximate quantum error
recovery operation based on projective measurements and unitary operations. The
binomial codes are tailored for detecting boson loss and gain errors by means
of measurements of the generalized number parity. We discuss optimization of
the binomial codes and demonstrate that by relaxing the parity structure, codes
with even lower unrecoverable error rates can be achieved. The binomial codes
are related to existing two-mode bosonic codes but offer the advantage of
requiring only a single bosonic mode to correct amplitude damping as well as
the ability to correct other errors. Our codes are similar in spirit to 'cat
codes' based on superpositions of the coherent states, but offer several
advantages such as smaller mean number, exact rather than approximate
orthonormality of the code words, and an explicit unitary operation for
repumping energy into the bosonic mode. The binomial quantum codes are
realizable with current superconducting circuit technology and they should
prove useful in other quantum technologies, including bosonic quantum memories,
photonic quantum communication, and optical-to-microwave up- and
down-conversion.Comment: Published versio
Quantum Optical Systems for the Implementation of Quantum Information Processing
We review the field of Quantum Optical Information from elementary
considerations through to quantum computation schemes. We illustrate our
discussion with descriptions of experimental demonstrations of key
communication and processing tasks from the last decade and also look forward
to the key results likely in the next decade. We examine both discrete (single
photon) type processing as well as those which employ continuous variable
manipulations. The mathematical formalism is kept to the minimum needed to
understand the key theoretical and experimental results
On the Shannon Cipher System With a Wiretapper Guessing Subject to Distortion and Reliability Requirements
In this paper we discuss the processes in the Shannon cipher system with
discrete memoryless source and a guessing wiretapper. The wiretapper observes a
cryptogram of -vector of ciphered messages in the public channel and tries
to guess successively the vector of messages within given distortion level
and small probability of error less than with positive
reliability index . The security of the system is measured by the expected
number of guesses which wiretapper needs for the approximate reconstruction of
the vector of source messages. The distortion, the reliability criteria and the
possibility of upper limiting the number of guesses extend the approach studied
by Merhav and Arikan. A single-letter characterization is given for the region
of pairs (of the rate of the maximum number of guesses
and the rate of the average number of guesses) in dependence on key rate
, distortion level and reliability .Comment: 14 pages, 3 figures, Submitted to IEEE Transactions on Information
Theor
- …