123,490 research outputs found
Some recent developments in quantization of fractal measures
We give an overview on the quantization problem for fractal measures,
including some related results and methods which have been developed in the
last decades. Based on the work of Graf and Luschgy, we propose a three-step
procedure to estimate the quantization errors. We survey some recent progress,
which makes use of this procedure, including the quantization for self-affine
measures, Markov-type measures on graph-directed fractals, and product measures
on multiscale Moran sets. Several open problems are mentioned.Comment: 13 page
On the spectral distribution of kernel matrices related to\ud radial basis functions
This paper focuses on the spectral distribution of kernel matrices related to radial basis functions. The asymptotic behaviour of eigenvalues of kernel matrices related to radial basis functions with different smoothness are studied. These results are obtained by estimated the coefficients of an orthogonal expansion of the underlying kernel function. Beside many other results, we prove that there are exactly (k+d−1/d-1) eigenvalues in the same order for analytic separable kernel functions like the Gaussian in Rd. This gives theoretical support for how to choose the diagonal scaling matrix in the RBF-QR method (Fornberg et al, SIAM J. Sci. Comput. (33), 2011) which can stably compute Gaussian radial basis function interpolants
Fast geometric gate operation of superconducting charge qubits in circuit QED
A scheme for coupling superconducting charge qubits via a one-dimensional
superconducting transmission line resonator is proposed. The qubits are working
at their optimal points, where they are immune to the charge noise and possess
long decoherence time. Analysis on the dynamical time evolution of the
interaction is presented, which is shown to be insensitive to the initial state
of the resonator field. This scheme enables fast gate operation and is readily
scalable to multiqubit scenario
Testing Cluster Structure of Graphs
We study the problem of recognizing the cluster structure of a graph in the
framework of property testing in the bounded degree model. Given a parameter
, a -bounded degree graph is defined to be -clusterable, if it can be partitioned into no more than parts, such
that the (inner) conductance of the induced subgraph on each part is at least
and the (outer) conductance of each part is at most
, where depends only on . Our main
result is a sublinear algorithm with the running time
that takes as
input a graph with maximum degree bounded by , parameters , ,
, and with probability at least , accepts the graph if it
is -clusterable and rejects the graph if it is -far from
-clusterable for , where depends only on . By the lower
bound of on the number of queries needed for testing graph
expansion, which corresponds to in our problem, our algorithm is
asymptotically optimal up to polylogarithmic factors.Comment: Full version of STOC 201
Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement
We initiate the study of quantifying nonlocalness of a bipartite measurement
by the minimum amount of classical communication required to simulate the
measurement. We derive general upper bounds, which are expressed in terms of
certain tensor norms of the measurement operator. As applications, we show that
(a) If the amount of communication is constant, quantum and classical
communication protocols with unlimited amount of shared entanglement or shared
randomness compute the same set of functions; (b) A local hidden variable model
needs only a constant amount of communication to create, within an arbitrarily
small statistical distance, a distribution resulted from local measurements of
an entangled quantum state, as long as the number of measurement outcomes is
constant.Comment: A preliminary version of this paper appears as part of an article in
Proceedings of the the 37th ACM Symposium on Theory of Computing (STOC 2005),
460--467, 200
Coarse-Grained Picture for Controlling Complex Quantum Systems
We propose a coarse-grained picture to control ``complex'' quantum dynamics,
i.e., multi-level-multi-level transition with a random interaction. Assuming
that optimally controlled dynamics can be described as a Rabi-like oscillation
between an initial and final state, we derive an analytic optimal field as a
solution to optimal control theory. For random matrix systems, we numerically
confirm that the analytic optimal field steers an initial state to a target
state which both contains many eigenstates.Comment: jpsj2.cls, 2 pages, 3 figure files; appear in J. Phys. Soc. Jpn.
Vol.73, No.11 (Nov. 15, 2004
Gravitational lensing statistical properties in general FRW cosmologies with dark energy component(s): analytic results
Various astronomical observations have been consistently making a strong case
for the existence of a component of dark energy with negative pressure in the
universe. It is now necessary to take the dark energy component(s) into account
in gravitational lensing statistics and other cosmological tests. By using the
comoving distance we derive analytic but simple expressions for the optical
depth of multiple image, the expected value of image separation and the
probability distribution of image separation caused by an assemble of singular
isothermal spheres in general FRW cosmological models with dark energy
component(s). We also present the kinematical and dynamical properties of these
kinds of cosmological models and calculate the age of the universe and the
distance measures, which are often used in classical cosmological tests. In
some cases we are able to give formulae that are simpler than those found
elsewhere in the literature, which could make the cosmological tests for dark
energy component(s) more convenient.Comment: 14 pages, no figure, Latex fil
- …