Searcharxiv⌕ Search

arXiv subjects

Wen Zheng

Publications and source records attributed to Wen Zheng.

52 records · Page 3Linked to original sources

Experimental Observation of Tensor Monopoles with a Superconducting Qudit

Monopoles play a center role in gauge theories and topological matter. There are two fundamental types of monopoles in physics: vector monopoles and tensor monopoles. Examples of vector monopoles include the Dirac monopole in 3D and Yang monopole in 5D, which have been extensively studied and observed in condensed matter or artificial systems. However, tensor monopoles are less studied, and their observation has not been reported. Here we experimentally construct a tunable spin-1 Hamiltonian to generate a tensor monopole and then measure its unique features with superconducting quantum circuits. The energy structure of a 4D Weyl-like Hamiltonian with three-fold degenerate points acting as tensor monopoles is imaged. Through quantum-metric measurements, we report the first experiment that measures the Dixmier-Douady invariant, the topological charge of the tensor monopole. Moreover, we observe topological phase transitions characterized by the topological Dixmier-Douady invariant, rather than the Chern numbers as used for conventional monopoles in odd-dimensional spaces.

quant-ph↗

Improving Monocular Depth Estimation by Leveraging Structural Awareness and Complementary Datasets

Monocular depth estimation plays a crucial role in 3D recognition and understanding. One key limitation of existing approaches lies in their lack of structural information exploitation, which leads to inaccurate spatial layout, discontinuous surface, and ambiguous boundaries. In this paper, we tackle this problem in three aspects. First, to exploit the spatial relationship of visual features, we propose a structure-aware neural network with spatial attention blocks. These blocks guide the network attention to global structures or local details across different feature layers. Second, we introduce a global focal relative loss for uniform point pairs to enhance spatial constraint in the prediction, and explicitly increase the penalty on errors in depth-wise discontinuous regions, which helps preserve the sharpness of estimation results. Finally, based on analysis of failure cases for prior methods, we collect a new Hard Case (HC) Depth dataset of challenging scenes, such as special lighting conditions, dynamic objects, and tilted camera angles. The new dataset is leveraged by an informed learning curriculum that mixes training examples incrementally to handle diverse data distributions. Experimental results show that our method outperforms state-of-the-art approaches by a large margin in terms of both prediction accuracy on NYUDv2 dataset and generalization performance on unseen datasets.

cs.CV↗

Siamese Keypoint Prediction Network for Visual Object Tracking

Visual object tracking aims to estimate the location of an arbitrary target in a video sequence given its initial bounding box. By utilizing offline feature learning, the siamese paradigm has recently been the leading framework for high performance tracking. However, current existing siamese trackers either heavily rely on complicated anchor-based detection networks or lack the ability to resist to distractors. In this paper, we propose the Siamese keypoint prediction network (SiamKPN) to address these challenges. Upon a Siamese backbone for feature embedding, SiamKPN benefits from a cascade heatmap strategy for coarse-to-fine prediction modeling. In particular, the strategy is implemented by sequentially shrinking the coverage of the label heatmap along the cascade to apply loose-to-strict intermediate supervisions. During inference, we find the predicted heatmaps of successive stages to be gradually concentrated to the target and reduced to the distractors. SiamKPN performs well against state-of-the-art trackers for visual object tracking on four benchmark datasets including OTB-100, VOT2018, LaSOT and GOT-10k, while running at real-time speed.

cs.CV↗

Experimental Realization of Universal Time-optimal non-Abelian Geometric Gates

Based on the geometrical nature of quantum phases, non-adiabatic holonomic quantum control (NHQC) has become a standard technique for enhancing robustness in constructing quantum gates. However, the conventional approach of NHQC is sensitive to control instability, as it requires the driving pulses to cover a fixed pulse area. Furthermore, even for small-angle rotations, all operations need to be completed with the same duration of time. Here we experimentally demonstrate a time-optimal and unconventional approach of NHQC (called TOUNHQC), which can optimize the operation time of any holonomic gate. Compared with the conventional approach, TOUNHQC provides an extra layer of robustness to decoherence and control errors. The experiment involves a scalable architecture of superconducting circuit, where we achieved a fidelity of 99.51% for a single qubit gate using interleaved randomized benchmarking. Moreover, a two-qubit holonomic control-phase gate has been implemented where the gate error can be reduced by as much as 18% compared with NHQC.

quant-ph↗

Uniqueness of VOA structure of 3C-algebra and 5A-algebra

The structure of 3C-algebra and 5A-algebra constructed by Lam-Yamada-Yamauchi is studied and the uniqueness of the vertex operator algebra structure of these two algebras is established. We also give the fusion rules for these two algebras.

math.QA↗

Realization of Superadiabatic Two-qubit Gates Using Parametric Modulation in Superconducting Circuits

Fast robust two-qubit gate operation with low susceptibility to crosstalk are the key to scalable quantum information processing. Parametrically driven gate is inherently insensitive to crosstalk while superadiabatic control can speed up the gate without losing accuracy. We propose and experimentally implement superadiabatic two-qubit gates using parametric modulation on superconducting quantum circuits. Our results demonstrate the preservation of adiabaticity at a gate speed close to the quantum limit, in addition to robustness against control instability. We demonstrate a CZ gate with error rate of 5.8$\%$, limited largely by qubit decoherence, promising future improvement and scalable implementation.

quant-ph↗

Adaptive Wasserstein Hourglass for Weakly Supervised Hand Pose Estimation from Monocular RGB

Insufficient labeled training datasets is one of the bottlenecks of 3D hand pose estimation from monocular RGB images. Synthetic datasets have a large number of images with precise annotations, but the obvious difference with real-world datasets impacts the generalization. Little work has been done to bridge the gap between two domains over their wide difference. In this paper, we propose a domain adaptation method called Adaptive Wasserstein Hourglass (AW Hourglass) for weakly-supervised 3D hand pose estimation, which aims to distinguish the difference and explore the common characteristics (e.g. hand structure) of synthetic and real-world datasets. Learning the common characteristics helps the network focus on pose-related information. The similarity of the characteristics makes it easier to enforce domain-invariant constraints. During training, based on the relation between these common characteristics and 3D pose learned from fully-annotated synthetic datasets, it is beneficial for the network to restore the 3D pose of weakly labeled real-world datasets with the aid of 2D annotations and depth images. While in testing, the network predicts the 3D pose with the input of RGB.

cs.CV↗

End-to-end Hand Mesh Recovery from a Monocular RGB Image

In this paper, we present a HAnd Mesh Recovery (HAMR) framework to tackle the problem of reconstructing the full 3D mesh of a human hand from a single RGB image. In contrast to existing research on 2D or 3D hand pose estimation from RGB or/and depth image data, HAMR can provide a more expressive and useful mesh representation for monocular hand image understanding. In particular, the mesh representation is achieved by parameterizing a generic 3D hand model with shape and relative 3D joint angles. By utilizing this mesh representation, we can easily compute the 3D joint locations via linear interpolations between the vertexes of the mesh, while obtain the 2D joint locations with a projection of the 3D joints.To this end, a differentiable re-projection loss can be defined in terms of the derived representations and the ground-truth labels, thus making our framework end-to-end trainable.Qualitative experiments show that our framework is capable of recovering appealing 3D hand mesh even in the presence of severe occlusions.Quantitatively, our approach also outperforms the state-of-the-art methods for both 2D and 3D hand pose estimation from a monocular RGB image on several benchmark datasets.

cs.CV↗

StyleRemix: An Interpretable Representation for Neural Image Style Transfer

Multi-Style Transfer (MST) intents to capture the high-level visual vocabulary of different styles and expresses these vocabularies in a joint model to transfer each specific style. Recently, Style Embedding Learning (SEL) based methods represent each style with an explicit set of parameters to perform MST task. However, most existing SEL methods either learn explicit style representation with numerous independent parameters or learn a relatively black-box style representation, which makes them difficult to control the stylized results. In this paper, we outline a novel MST model, StyleRemix, to compactly and explicitly integrate multiple styles into one network. By decomposing diverse styles into the same basis, StyleRemix represents a specific style in a continuous vector space with 1-dimensional coefficients. With the interpretable style representation, StyleRemix not only enables the style visualization task but also allows several ways of remixing styles in the smooth style embedding space.~Extensive experiments demonstrate the effectiveness of StyleRemix on various MST tasks compared to state-of-the-art SEL approaches.

cs.CV↗

Jamming of packings of frictionless particles with and without shear

By minimizing the enthalpy of packings of frictionless particles, we obtain jammed solids at desired pressures and hence investigate the jamming transition with and without shear. Typical scaling relations of the jamming transition are recovered in both cases. In contrast to systems without shear, shear-driven jamming transition occurs at a higher packing fraction and the jammed solids are more rigid with an anisotropic force network. Furthermore, by introducing the macro-friction coefficient, we propose an explanation of the packing fraction gap between sheared and non-sheared systems at fixed pressure.

cond-mat.soft↗

Shear induced solidification of athermal systems with weak attraction

We find that unjammed packings of frictionless particles with rather weak attraction can always be driven into solid-like states by shear. The structure of shear-driven solids evolves continuously with packing fraction from gel-like to jamming-like, but is almost independent of the shear stress. In contrast, both the density of vibrational states (DOVS) and force network evolve progressively with the shear stress. There exists a packing fraction independent shear stress $σ_c$, at which the shear-driven solids are isostatic and have a flattened DOVS. Solid-like states induced by a shear stress greater than $σ_c$ possess properties of marginally jammed solids and are thus strictly-defined shear jammed states. Below $σ_c$, states at all packing fractions are under isostaticity and share common features in the DOVS and force network, although their structures can be rather different. Our study reveals the significance of the shear stress in determining properties of shear-driven solids and leads to an enriched jamming phase diagram for weakly attractive particles.

cond-mat.soft↗

Disordered Solids Without Well-Defined Transverse Phonons: The Nature of Hard Sphere Glasses

We probe the Ioffe-Regel limits of glasses with repulsions near the zero-temperature jamming transition by measuring the dynamical structure factors. At zero temperature, the transverse Ioffe-Regel frequency vanishes at the jamming transition with a diverging length, but the longitudinal one does not, which excludes the existence of a diverging length associated with the longitudinal excitations. At low temperatures, the transverse and longitudinal Ioffe-Regel frequencies approach zero at the jamming-like transition and glass transition, respectively. As a consequence, glasses between the glass transition and jamming-like transition, which are hard sphere glasses in the low temperature limit, can only carry well-defined longitudinal phonons and have an opposite pressure dependence of the ratio of the shear modulus to the bulk modulus from glasses beyond the jamming-like transition.

cond-mat.soft↗

Signatures of shear thinning-thickening transition in dense athermal shear flows

In non-equilibrium molecular dynamics simulations of dense athermal shear flows, we observe the transition from shear thinning to shear thickening at a crossover shear rate $\dotγ_c$. Shear thickening occurs when $\frac{{\rm d (ln} T_g)}{{\rm d (ln}\dotγ)}>2$ with $T_g$ the granular temperature. At the transition, the pair distribution function shows the strongest anisotropy. Meanwhile, the dynamics undergo apparent changes, signified by distinct scaling behaviors of the mean squared displacement and relaxation time on both sides of $\dotγ_c$. These features serve as robust signatures of the shear thinning-thickening transition.

cond-mat.soft↗

L2C2: Logic-based LSC Consistency Checking

Live sequence charts (LSCs) have been proposed as an inter-object scenario-based specification and visual programming language for reactive systems. In this paper, we introduce a logic-based framework to check the consistency of an LSC specification. An LSC simulator has been implemented in logic programming, utilizing a memoized depth-first search strategy, to show how a reactive system in LSCs would response to a set of external event sequences. A formal notation is defined to specify external event sequences, extending the regular expression with a parallel operator and a testing control. The parallel operator allows interleaved parallel external events to be tested in LSCs simultaneously; while the testing control provides users to a new approach to specify and test certain temporal properties (e.g., CTL formula) in a form of LSC. Our framework further provides either a state transition graph or a failure trace to justify the consistency checking results.

cs.LO↗

Dynamic Studies of Scaffold-dependent Mating Pathway in Yeast

The mating pathway in \emph{Saccharomyces cerevisiae} is one of the best understood signal transduction pathways in eukaryotes. It transmits the mating signal from plasma membrane into the nucleus through the G-protein coupled receptor and the mitogen-activated protein kinase (MAPK) cascade. According to the current understandings of the mating pathway, we construct a system of ordinary differential equations to describe the process. Our model is consistent with a wide range of experiments, indicating that it captures some main characteristics of the signal transduction along the pathway. Investigation with the model reveals that the shuttling of the scaffold protein and the dephosphorylation of kinases involved in the MAPK cascade cooperate to regulate the response upon pheromone induction and to help preserving the fidelity of the mating signaling. We explored factors affecting the dose-response curves of this pathway and found that both negative feedback and concentrations of the proteins involved in the MAPK cascade play crucial role. Contrary to some other MAPK systems where signaling sensitivity is being amplified successively along the cascade, here the mating signal is transmitted through the cascade in an almost linear fashion.

q-bio.MN↗