arXiv subjects

Ke Yang

Publications and source records attributed to Ke Yang.

204 records · Page 12Linked to original sources

arXiv2010

Scalar-Kinetic Branes

This work tries to find out thick brane solutions in braneworld scenarios described by a real scalar field in the presence of a scalar-kinetic term $F(X,ϕ)=Xϕ^m$ with a single extra dimension, where $X=\frac12\nabla_Mϕ\nabla^Mϕ$ stands for the standard kinetic term and $m=0,1,2\cdots$. We mainly consider bent branes, namely de Sitter and Anti-de Sitter four-dimensional slices. The solutions of a flat brane are obtained when taking the four-dimensional cosmological constant $Λ_4\rightarrow 0$. When the parameter $m=0$, these solutions turn to those of the standard scenario. The localization and spectrum of graviton on these branes are also analyzed.

hep-th↗

arXiv2010

Entropy/Area spectra of the charged black hole from quasinormal modes

With the new physical interpretation of quasinormal modes proposed by Maggiore, the quantum area spectra of black holes have been investigated recently. Adopting the modified Hod's treatment, results show that the area spectra for black holes are equally spaced and the spacings are in a unified form, $\triangle A=8π\hbar$, in Einstein gravity. On the other hand, following Kunstatter's method, the studies show that the area spectrum for a nonrotating black hole with no charge is equidistant. And for a rotating (or charged) black hole, it is also equidistant and independent of the angular momentum $J$ (or charge $q$) when the black hole is far from the extremal case. In this paper, we mainly deal with the area spectrum of the stringy charged Garfinkle-Horowitz-Strominger black hole, originating from effective action that emerges in the low-energy string theory. We find that both methods give the same results-that the area spectrum is equally spaced and does not depend on the charge $q$. Our study may provide new insights into understanding the area spectrum and entropy spectrum for stringy black holes.

hep-th↗

arXiv2008

Quadratic distances on probabilities: A unified foundation

This work builds a unified framework for the study of quadratic form distance measures as they are used in assessing the goodness of fit of models. Many important procedures have this structure, but the theory for these methods is dispersed and incomplete. Central to the statistical analysis of these distances is the spectral decomposition of the kernel that generates the distance. We show how this determines the limiting distribution of natural goodness-of-fit tests. Additionally, we develop a new notion, the spectral degrees of freedom of the test, based on this decomposition. The degrees of freedom are easy to compute and estimate, and can be used as a guide in the construction of useful procedures in this class.

math.ST↗

arXiv2003

On Statistical Query Sampling and NMR Quantum Computing

We introduce a ``Statistical Query Sampling'' model, in which the goal of an algorithm is to produce an element in a hidden set $Ssubseteqbit^n$ with reasonable probability. The algorithm gains information about $S$ through oracle calls (statistical queries), where the algorithm submits a query function $g(cdot)$ and receives an approximation to $Pr_{x in S}[g(x)=1]$. We show how this model is related to NMR quantum computing, in which only statistical properties of an ensemble of quantum systems can be measured, and in particular to the question of whether one can translate standard quantum algorithms to the NMR setting without putting all of their classical post-processing into the quantum system. Using Fourier analysis techniques developed in the related context of {em statistical query learning}, we prove a number of lower bounds (both information-theoretic and cryptographic) on the ability of algorithms to produces an $xin S$, even when the set $S$ is fairly simple. These lower bounds point out a difficulty in efficiently applying NMR quantum computing to algorithms such as Shor's and Simon's algorithm that involve significant classical post-processing. We also explicitly relate the notion of statistical query sampling to that of statistical query learning. An extended abstract appeared in the 18th Aunnual IEEE Conference of Computational Complexity (CCC 2003), 2003. Keywords: statistical query, NMR quantum computing, lower bound

quant-ph↗

arXiv2002

Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information

Quantum entanglement distillation protocols are LOCC protocols between Alice and Bob that convert imperfect EPR pairs, or, in general, partially entangled bipartite states into perfect or near-perfect EPR pairs. The classical communication complexity of these protocols is the minimal amount of classical communication needed for the conversion. In this paper, we focus on the communication complexity of protocols that operate with incomplete information, i.e., where the inputs are mixed states and/or prepared adversarially. We study 3 models of imperfect EPR pairs. In the measure-r model, r out of n EPR pairs are measured by an adversary; in the depolarization model, Bob's share of qubits underwent a depolarization channel; in the fidelity model, the only information Alice and Bob possess is the fidelity of the shared state. For the measure-r model and the depolarization model, we prove tight and almost-tight bounds on the outcome of LOCC protocols that don't use communication. For the fidelity model, we prove a lower bound on the communication complexity that matches the upper bound given by Ambainis, Smith, and Yang [ASY02].

quant-ph↗

arXiv2001

Extracting Quantum Entanglement (General Entanglement Purification Protocols)

We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state $ρ$ which is ``reasonably close'' to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of $ρ$ and a maximally entangled state. They wish to ``purify'' $ρ$ using local operations and classical communication and create a state that is arbitrarily close to EPR pairs. We prove that on average, Alice and Bob cannot increase the fidelity of the input state significantly. We also construct protocols that may fail with a small probability, and otherwise will output states arbitrarily close to EPR pairs with very high probability. Our constructions are efficient, i.e., they can be implemented by polynomial-size quantum circuits.

quant-ph↗