Searcharxiv⌕ Search

arXiv subjects

Yong Hu

Publications and source records attributed to Yong Hu.

At least 145 records · Page 8Linked to original sources

Hasse Principle for Simply Connected Groups over Function Fields of Surfaces

Let $K$ be the function field of a $p$-adic curve, $G$ a semisimple simply connected group over $K$ and $X$ a $G$-torsor over $K$. A conjecture of Colliot-Thélène, Parimala and Suresh predicts that if for every discrete valuation $v$ of $K$, $X$ has a point over the completion $K_v$, then $X$ has a $K$-rational point. The main result of this paper is the proof of this conjecture for groups of some classical types. In particular, we prove the conjecture when $G$ is of one of the following types: (1) ${}^2A_n^*$, i.e. $G=\mathbf{SU}(h)$ is the special unitary group of some hermitian form $h$ over a pair $(D, τ)$, where $D$ is a central division algebra of square-free index over a quadratic extension $L$ of $K$ and $τ$ is an involution of the second kind on $D$ such that $L^τ=K$; (2) $B_n$, i.e., $G=\mathbf{Spin}(q)$ is the spinor group of quadratic form of odd dimension over $K$; (3) $D_n^*$, i.e., $G=\mathbf{Spin}(h)$ is the spinor group of a hermitian form $h$ over a quaternion $K$-algebra $D$ with an orthogonal involution. Our method actually yields a parallel local-global result over the fraction field of a 2-dimensional, henselian, excellent local domain with finite residue field, under suitable assumption on the residue characteristic.

math.AG↗

Division Algebras and Quadratic Forms over Fraction Fields of Two-dimensional Henselian Domains

Let $K$ be the fraction field of a 2-dimensional, henselian, excellent local domain with finite residue field $k$. When the characteristic of $k$ is not 2, we prove that every quadratic form of rank $\ge 9$ is isotropic over $K$ using methods of Parimala and Suresh, and we obtain the local-global principle for isotropy of quadratic forms of rank 5 with respect to discrete valuations of $K$. The latter result is proved by making a careful study of ramification and cyclicity of division algebras over the field $K$, following Saltman's methods. A key step is the proof of the following result, which answers a question of Colliot-Thélène--Ojanguren--Parimala: For a Brauer class over $K$ of prime order $q$ different from the characteristic of $k$, if it is cyclic of degree $q$ over the completed field $K_v$ for every discrete valuation $v$ of $K$, then the same holds over $K$. This local-global principle for cyclicity is also established over function fields of $p$-adic curves with the same method.

math.AG↗

A biologically inspired model for transshipment problem

Transshipment problem is one of the basic operational research problems. In this paper, our first work is to develop a biologically inspired mathematical model for a dynamical system, which is first used to solve minimum cost flow problem. It has lower computational complexity than Physarum Solver. Second, we apply the proposed model to solve the traditional transshipment problem. Compared with the conditional methods, experiment results show the provided model is simple, effective as well as handling problem in a continuous manner.

eess.SY↗

A Visibility Graph Averaging Aggregation Operator

The problem of aggregation is considerable importance in many disciplines. In this paper, a new type of operator called visibility graph averaging (VGA) aggregation operator is proposed. This proposed operator is based on the visibility graph which can convert a time series into a graph. The weights are obtained according to the importance of the data in the visibility graph. Finally, the VGA operator is used in the analysis of the TAIEX database to illustrate that it is practical and compared with the classic aggregation operators, it shows its advantage that it not only implements the aggregation of the data purely, but also conserves the time information, and meanwhile, the determination of the weights is more reasonable.

cs.AI↗

A generalized evidence distance

Dempster-Shafer theory of evidence (D-S theory) is widely used in uncertain information process. The basic probability assignment(BPA) is a key element in D-S theory. How to measure the distance between two BPAs is an open issue. In this paper, a new method to measure the distance of two BPAs is proposed. The proposed method is a generalized of existing evidence distance. Numerical examples are illustrated that the proposed method can overcome the shortcomings of existing methods.

cs.AI↗

A new information dimension of complex networks

The fractal and self-similarity properties are revealed in many real complex networks. However, the classical information dimension of complex networks is not practical for real complex networks. In this paper, a new information dimension to characterize the dimension of complex networks is proposed. The difference of information for each box in the box-covering algorithm of complex networks is considered by this measure. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient for fractal dimension of complex networks.

cs.SI↗

An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs

This paper presents an adaptive amoeba algorithm to address the shortest path tree (SPT) problem in dynamic graphs. In dynamic graphs, the edge weight updates consists of three categories: edge weight increases, edge weight decreases, the mixture of them. Existing work on this problem solve this issue through analyzing the nodes influenced by the edge weight updates and recompute these affected vertices. However, when the network becomes big, the process will become complex. The proposed method can overcome the disadvantages of the existing approaches. The most important feature of this algorithm is its adaptivity. When the edge weight changes, the proposed algorithm can recognize the affected vertices and reconstruct them spontaneously. To evaluate the proposed adaptive amoeba algorithm, we compare it with the Label Setting algorithm and Bellman-Ford algorithm. The comparison results demonstrate the effectiveness of the proposed method.

cs.NE↗

Ranking basic belief assignments in decision making under uncertain environment

Dempster-Shafer theory (D-S theory) is widely used in decision making under the uncertain environment. Ranking basic belief assignments (BBAs) now is an open issue. Existing evidence distance measures cannot rank the BBAs in the situations when the propositions have their own ranking order or their inherent measure of closeness. To address this issue, a new ranking evidence distance (RED) measure is proposed. Compared with the existing evidence distance measures including the Jousselme's distance and the distance between betting commitments, the proposed RED measure is much more general due to the fact that the order of the propositions in the systems is taken into consideration. If there is no order or no inherent measure of closeness in the propositions, our proposed RED measure is reduced to the existing evidence distance. Numerical examples show that the proposed RED measure is an efficient alternative to rank BBAs in decision making under uncertain environment.

cs.AI↗

Tunable interfaces for realizing universal quantum computation with topological qubits

We propose to implement tunable interfaces for realizing universal quantum computation with topological qubits. One interface is between the topological and superconducting qubits, which can realize arbitrary single-qubit gate on the topological qubit. When two qubits are involved, the interface between the topological qubits and a microwave cavity can induce a nontrivial two-qubit gate, which can not be constructed based on braiding operations. The two interfaces, being tunable via an external magnetic flux, may serve as the building blocks towards universal quantum computation with topological qubits.

quant-ph↗

Coefficient of performance for a low-dissipation Carnot-like refrigerator with nonadiabatic dissipation

We study the coefficient of performance (COP) and its bounds of the Canot-like refrigerator working between two heat reservoirs at constant temperatures $T_h$ and $T_c$, under two optimization criteria $χ$ and $Ω$. In view of the fact that an "adiabatic" process takes finite time and is nonisentropic, the nonadiabatic dissipation and the finite time required for the "adiabatic" processes are taken into account. For given optimization criteria, we find that the lower and upper bounds of the COP are the same as the corresponding ones obtained from the previous idealized models where any adiabatic process undergoes instantaneously with constant entropy. When the dissipations of two "isothermal" and two "adiabatic" processes are symmetric, respectively, our theoretical predictions match the observed COP's of real refrigerators more closely than the ones derived in the previous models, providing a strong argument in favor of our approach.

cond-mat.stat-mech↗

Local-global principle for quadratic forms over fraction fields of two-dimensional henselian domains

Let $R$ be a 2-dimensional normal excellent henselian local domain in which 2 is invertible and let $L$ and $k$ be respectively its fraction field and residue field. Let $Ω_R$ be the set of rank 1 discrete valuations of $L$ corresponding to codimension 1 points of regular proper models of $\Spec R$. We prove that a quadratic form $q$ over $L$ satisfies the local-global principle with respect to $Ω_R$ in the following two cases: (1) $q$ has rank 3 or 4; (2) $q$ has rank $\ge 5$ and $R=A[y]$, where $A$ is a complete discrete valuation ring with a not too restrictive condition on the residue field $k$, which is satisfied when $k$ is $C_1$.

math.AG↗

Universal Quantum Degeneracy Point for Superconducting Qubits

The quantum degeneracy point approach [D. Vion et al., Science 296, 886 (2002)] effectively protects superconducting qubits from low-frequency noise that couples with the qubits as transverse noise. However, low-frequency noise in superconducting qubits can originate from various mechanisms and can couple with the qubits either as transverse or as longitudinal noise. Here, we present a quantum circuit containing a universal quantum degeneracy point that protects an encoded qubit from arbitrary low-frequency noise. We further show that universal quantum logic gates can be performed on the encoded qubit with high gate fidelity. The proposed scheme is robust against small parameter spreads due to fabrication errors in the superconducting qubits.

quant-ph↗

Cross Kerr Effect Induced by Coupled Josephson Qubits in Circuit Quantum Electrodynamics

We propose a scheme for implementing cross Kerr nonlinearity between two superconducting transmission line resonators (TLR) via their interaction with a coupler which is constructed by two superconducting charge qubits connected to each other via a superconducting quantum interference device. When suitably driven, the coupler can induce very strong cross phase modulation (XPM) between the two TLRs due to its N-type level structure and the consequent electromagnetically induced transparency in its lowest states. The flexibility of our design can lead to various inter-TLR coupling configurations. The obtained cross Kerr coefficient is large enough to allow many important quantum operations in which only few photons are involved. We further show that this scheme is very robust against the fluctuations in solid state circuits. Our numerical calculations imply that the absorption and dispersion resulted from the decoherence of the coupler are very small compared with the strength of the proposed XPM.

quant-ph↗

Weak Approximation over Function Fields of Curves over Large or Finite Fields

Let $K=k(C)$ be the function field of a curve over a field $k$ and let $X$ be a smooth, projective, separably rationally connected $K$-variety with $X(K)\neq\emptyset$. Under the assumption that $X$ admits a smooth projective model $π: \mathcal{X}\to C$, we prove the following weak approximation results: (1) if $k$ is a large field, then $X(K)$ is Zariski dense; (2) if $k$ is an infinite algebraic extension of a finite field, then $X$ satisfies weak approximation at places of good reduction; (3) if $k$ is a nonarchimedean local field and $R$-equivalence is trivial on one of the fibers $\mathcal{X}_p$ over points of good reduction, then there is a Zariski dense subset $W\subseteq C(k)$ such that $X$ satisfies weak approximation at places in $W$. As applications of the methods, we also obtain the following results over a finite field $k$: (4) if $|k|>10$, then for a smooth cubic hypersurface $X/K$, the specialization map $X(K)\longrightarrow \prod_{p\in P}\mathcal{X}_p(κ(p))$ at finitely many points of good reduction is surjective; (5) if $\mathrm{char} k\neq 2, 3$ and $|k|>47$, then a smooth cubic surface $X$ over $K$ satisfies weak approximation at any given place of good reduction.

math.AG↗

Integrated photonic qubit quantum computing on a superconducting chip

We study a quantum computing system using microwave photons in transmission line resonators on a superconducting chip as qubits. We show that all control necessary for quantum computing can be implemented by coupling to Josephson devices on the same chip, and take advantage of their strong inherent nonlinearities to realize qubit interactions. We analyze the gate error rate to demonstrate that our scheme is realistic even for Josephson devices with limited decoherence times. A conceptually innovative solution based on existing technologies, our scheme provides an integrated and scalable approach to the next key milestone for photonic qubit quantum computing.

quant-ph↗

Dispersive Coupling Between the Superconducting Transmission Line Resonator and the Double Quantum Dots

Realization of controllable interaction between distant qubits is one of the major problems in scalable solid state quantum computing. We study a superconducting transmission line resonator (TLR) as a tunable dispersive coupler for the double-dot molecules. A general interaction Hamiltonian of $n$ two-electron spin-based qubits and the TLR is presented, where the double-dot qubits are biased at the large detuning region and the TLR is always empty and virtually excited. Our analysis o the main decoherence sources indicates that various major quantum operations can be reliably implemented with current technology.

quant-ph↗

Divisors of the Euler and Carmichael functions

We study the distribution of divisors of Euler's totient function and Carmichael's function. In particular, we estimate how often the values of these functions have "dense" divisors.

math.NT↗