187,875 research outputs found
Doing and Showing
The persisting gap between the formal and the informal mathematics is due to
an inadequate notion of mathematical theory behind the current formalization
techniques. I mean the (informal) notion of axiomatic theory according to which
a mathematical theory consists of a set of axioms and further theorems deduced
from these axioms according to certain rules of logical inference. Thus the
usual notion of axiomatic method is inadequate and needs a replacement.Comment: 54 pages, 2 figure
A Secure Communication Game with a Relay Helping the Eavesdropper
In this work a four terminal complex Gaussian network composed of a source, a
destination, an eavesdropper and a jammer relay is studied under two different
set of assumptions: (i) The jammer relay does not hear the source transmission,
and (ii) The jammer relay is causally given the source message. In both cases
the jammer relay assists the eavesdropper and aims to decrease the achievable
secrecy rates. The source, on the other hand, aims to increase it. To help the
eavesdropper, the jammer relay can use pure relaying and/or send interference.
Each of the problems is formulated as a two-player, non-cooperative, zero-sum
continuous game. Assuming Gaussian strategies at the source and the jammer
relay in the first problem, the Nash equilibrium is found and shown to be
achieved with mixed strategies in general. The optimal cumulative distribution
functions (cdf) for the source and the jammer relay that achieve the value of
the game, which is the Nash equilibrium secrecy rate, are found. For the second
problem, the Nash equilibrium solution is found and the results are compared to
the case when the jammer relay is not informed about the source message.Comment: 13 pages, 11 figures, to appear in IEEE Transactions on Information
Forensics and Security, Special Issue on Using the Physical Layer for
Securing the Next Generation of Communication Systems. This is the journal
version of cs.IT:0911.008
Efficient Online Quantum Generative Adversarial Learning Algorithms with Applications
The exploration of quantum algorithms that possess quantum advantages is a
central topic in quantum computation and quantum information processing. One
potential candidate in this area is quantum generative adversarial learning
(QuGAL), which conceptually has exponential advantages over classical
adversarial networks. However, the corresponding learning algorithm remains
obscured. In this paper, we propose the first quantum generative adversarial
learning algorithm-- the quantum multiplicative matrix weight algorithm
(QMMW)-- which enables the efficient processing of fundamental tasks. The
computational complexity of QMMW is polynomially proportional to the number of
training rounds and logarithmically proportional to the input size. The core
concept of the proposed algorithm combines QuGAL with online learning. We
exploit the implementation of QuGAL with parameterized quantum circuits, and
numerical experiments for the task of entanglement test for pure state are
provided to support our claims
Hilbert's Program Then and Now
Hilbert's program was an ambitious and wide-ranging project in the philosophy
and foundations of mathematics. In order to "dispose of the foundational
questions in mathematics once and for all, "Hilbert proposed a two-pronged
approach in 1921: first, classical mathematics should be formalized in
axiomatic systems; second, using only restricted, "finitary" means, one should
give proofs of the consistency of these axiomatic systems. Although Godel's
incompleteness theorems show that the program as originally conceived cannot be
carried out, it had many partial successes, and generated important advances in
logical theory and meta-theory, both at the time and since. The article
discusses the historical background and development of Hilbert's program, its
philosophical underpinnings and consequences, and its subsequent development
and influences since the 1930s.Comment: 43 page
On compression rate of quantum autoencoders: Control design, numerical and experimental realization
Quantum autoencoders which aim at compressing quantum information in a
low-dimensional latent space lie in the heart of automatic data compression in
the field of quantum information. In this paper, we establish an upper bound of
the compression rate for a given quantum autoencoder and present a learning
control approach for training the autoencoder to achieve the maximal
compression rate. The upper bound of the compression rate is theoretically
proven using eigen-decomposition and matrix differentiation, which is
determined by the eigenvalues of the density matrix representation of the input
states. Numerical results on 2-qubit and 3-qubit systems are presented to
demonstrate how to train the quantum autoencoder to achieve the theoretically
maximal compression, and the training performance using different machine
learning algorithms is compared. Experimental results of a quantum autoencoder
using quantum optical systems are illustrated for compressing two 2-qubit
states into two 1-qubit states
A Minimization Approach to Conservation Laws With Random Initial Conditions and Non-smooth, Non-strictly Convex Flux
We obtain solutions to conservation laws under any random initial conditions
that are described by Gaussian stochastic processes (in some cases
discretized). We analyze the generalization of Burgers' equation for a smooth
flux function for
under random initial data. We then consider a piecewise linear, non-smooth and
non-convex flux function paired with general discretized Gaussian stochastic
process initial data. By partitioning the real line into a finite number of
points, we obtain an exact expression for the solution of this problem. From
this we can also find exact and approximate formulae for the density of shocks
in the solution profile at a given time and spatial coordinate . We
discuss the simplification of these results in specific cases, including
Brownian motion and Brownian bridge, for which the inverse covariance matrix
and corresponding eigenvalue spectrum have some special properties. We
calculate the transition probabilities between various cases and examine the
variance of the solution in both and . We also
describe how results may be obtained for a non-discretized version of a
Gaussian stochastic process by taking the continuum limit as the partition
becomes more fine.Comment: 36 pages, 5 figures, small update from published versio
- …