201 research outputs found
Advances in delimiting the Hilbert-Schmidt separability probability of real two-qubit systems
We seek to derive the probability--expressed in terms of the Hilbert-Schmidt
(Euclidean or flat) metric--that a generic (nine-dimensional) real two-qubit
system is separable, by implementing the well-known Peres-Horodecki test on the
partial transposes (PT's) of the associated 4 x 4 density matrices). But the
full implementation of the test--requiring that the determinant of the PT be
nonnegative for separability to hold--appears to be, at least presently,
computationally intractable. So, we have previously implemented--using the
auxiliary concept of a diagonal-entry-parameterized separability function
(DESF)--the weaker implied test of nonnegativity of the six 2 x 2 principal
minors of the PT. This yielded an exact upper bound on the separability
probability of 1024/{135 pi^2} =0.76854$. Here, we piece together
(reflection-symmetric) results obtained by requiring that each of the four 3 x
3 principal minors of the PT, in turn, be nonnegative, giving an
improved/reduced upper bound of 22/35 = 0.628571. Then, we conclude that a
still further improved upper bound of 1129/2100 = 0.537619 can be found by
similarly piecing together the (reflection-symmetric) results of enforcing the
simultaneous nonnegativity of certain pairs of the four 3 x 3 principal minors.
In deriving our improved upper bounds, we rely repeatedly upon the use of
certain integrals over cubes that arise. Finally, we apply an independence
assumption to a pair of DESF's that comes close to reproducing our numerical
estimate of the true separability function.Comment: 16 pages, 9 figures, a few inadvertent misstatements made near the
end are correcte
Quasi-Monte Carlo rules for numerical integration over the unit sphere
We study numerical integration on the unit sphere using equal weight quadrature rules, where the weights are such
that constant functions are integrated exactly.
The quadrature points are constructed by lifting a -net given in the
unit square to the sphere by means of an area
preserving map. A similar approach has previously been suggested by Cui and
Freeden [SIAM J. Sci. Comput. 18 (1997), no. 2].
We prove three results. The first one is that the construction is (almost)
optimal with respect to discrepancies based on spherical rectangles. Further we
prove that the point set is asymptotically uniformly distributed on
. And finally, we prove an upper bound on the spherical cap
-discrepancy of order (where denotes the
number of points). This slightly improves upon the bound on the spherical cap
-discrepancy of the construction by Lubotzky, Phillips and Sarnak [Comm.
Pure Appl. Math. 39 (1986), 149--186]. Numerical results suggest that the
-nets lifted to the sphere have spherical cap
-discrepancy converging with the optimal order of
Good Random Matrices over Finite Fields
The random matrix uniformly distributed over the set of all m-by-n matrices
over a finite field plays an important role in many branches of information
theory. In this paper a generalization of this random matrix, called k-good
random matrices, is studied. It is shown that a k-good random m-by-n matrix
with a distribution of minimum support size is uniformly distributed over a
maximum-rank-distance (MRD) code of minimum rank distance min{m,n}-k+1, and
vice versa. Further examples of k-good random matrices are derived from
homogeneous weights on matrix modules. Several applications of k-good random
matrices are given, establishing links with some well-known combinatorial
problems. Finally, the related combinatorial concept of a k-dense set of m-by-n
matrices is studied, identifying such sets as blocking sets with respect to
(m-k)-dimensional flats in a certain m-by-n matrix geometry and determining
their minimum size in special cases.Comment: 25 pages, publishe
Hurst's Rescaled Range Statistical Analysis for Pseudorandom Number Generators used in Physical Simulations
The rescaled range statistical analysis (R/S) is proposed as a new method to
detect correlations in pseudorandom number generators used in Monte Carlo
simulations. In an extensive test it is demonstrated that the RS analysis
provides a very sensitive method to reveal hidden long run and short run
correlations. Several widely used and also some recently proposed pseudorandom
number generators are subjected to this test. In many generators correlations
are detected and quantified.Comment: 12 pages, 12 figures, 6 tables. Replaces previous version to correct
citation [19
Higgs and non-universal gaugino masses: no SUSY signal expected yet?
So far, no supersymmetric particles have been detected at the Large Hadron
Collider (LHC). However, the recent Higgs results have interesting implications
for the SUSY parameter space. In this paper, we study the consequences of an
LHC Higgs signal for a model with non-universal gaugino masses in the context
of SU(5) unification. The gaugino mass ratios associated with the higher
representations produce viable spectra that are largely inaccessible to the
current LHC and direct dark matter detection experiments. Thus, in light of the
Higgs results, the non-observation of SUSY is no surprise.Comment: supplementary file containing plots with log priors in ancillary
files. v2: added some comments on more general settings and references,
accepted for publication in JHE
An Adaptive Interacting Wang-Landau Algorithm for Automatic Density Exploration
While statisticians are well-accustomed to performing exploratory analysis in
the modeling stage of an analysis, the notion of conducting preliminary
general-purpose exploratory analysis in the Monte Carlo stage (or more
generally, the model-fitting stage) of an analysis is an area which we feel
deserves much further attention. Towards this aim, this paper proposes a
general-purpose algorithm for automatic density exploration. The proposed
exploration algorithm combines and expands upon components from various
adaptive Markov chain Monte Carlo methods, with the Wang-Landau algorithm at
its heart. Additionally, the algorithm is run on interacting parallel chains --
a feature which both decreases computational cost as well as stabilizes the
algorithm, improving its ability to explore the density. Performance is studied
in several applications. Through a Bayesian variable selection example, the
authors demonstrate the convergence gains obtained with interacting chains. The
ability of the algorithm's adaptive proposal to induce mode-jumping is
illustrated through a trimodal density and a Bayesian mixture modeling
application. Lastly, through a 2D Ising model, the authors demonstrate the
ability of the algorithm to overcome the high correlations encountered in
spatial models.Comment: 33 pages, 20 figures (the supplementary materials are included as
appendices
- …