Chao Yang

Chao Yang

Auto-generated profile, based on publicly available information

Chao Yang

Applied Mathematics and Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, USA

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 March 2024 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
DCDaan Camps
Daan Camps
LLLin Lin
Lin Lin
RBRoel Van Beeumen
Roel Van Beeumen
CYChao Yang
Chao Yang
Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest [Formula: see text] in a larger unitary transformation [Formula: see text] that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of [Formula: see text], which is difficult in general, and not trivial even for well structured sparse matrices. In this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

15 February 2016 in Nano Letters
Verified
Journal Article
Closed access
WHWei Hu
Wei Hu
LLLin Lin
Lin Lin
CYChao Yang
Chao Yang
JDJun Dai
Jun Dai
JYJinlong Yang
Jinlong Yang


23 July 2024 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
YZYuhang Zheng
Yuhang Zheng
XCXiangyu Chen
Xiangyu Chen
YZYupeng Zheng
Yupeng Zheng
SGSongen Gu
Songen Gu
RYRunyi Yang
Runyi Yang
MWMeiqing Wang
Meiqing Wang
Constructing a 3D scene capable of accommodating open-ended language queries, is a pivotal pursuit in the domain of robotics, which facilitates robots in executing object manipulations based on human language directives. To achieve this, some research efforts have been dedicated to the development of language-embedded implicit fields. However, implicit fields (e.g. NeRF) encounter limitations due to the necessity of taking images from a larger number of viewpoints for reconstruction, coupled with their inherent inefficiencies in inference. Furthermore, these methods directly distill patch-level 2D features, leading to ambiguous segmentation boundaries. Thus, we present the GaussianGrasper , which uses 3D Gaussian Splatting (3DGS) to explicitly represent the scene as a set of Gaussian primitives and is capable of real-time rendering. Our approach takes RGB-D images from limited viewpoints as input and uses an Efficient Feature Distillation (EFD) module that employs contrastive learning to efficiently distill 2D language embeddings and constraint consistency of feature embeddings. With the reconstructed geometry of the Gaussian field, our method enables the pre-trained grasping model to generate collision-free grasp pose candidates. Furthermore, we propose a normal-guided grasp module to select the best grasp pose. Through comprehensive real-world experiments, we demonstrate that GaussianGrasper enables robots to accurately locate and grasp objects according to language instructions, providing a new solution for language-guided grasping tasks.

3 October 2013 in Inverse Problems
Verified
Journal Article
Closed access
PDF file
SMStefano Marchesini
Stefano Marchesini
ASAndre Schirotzek
Andre Schirotzek
CYChao Yang
Chao Yang
HWHau-tieng Wu
Hau-tieng Wu
FMFilipe Maia
Filipe Maia
Ptychography is a popular technique to achieve diffraction limited resolution images of a two- or three-dimensional sample using high frame rate detectors. We introduce a relaxation of common projection algorithms to account for instabilities given by intensity and background fluctuations, position errors, or poor calibration using multiplexing illumination. This relaxation introduces an additional phasing optimization at every step that enhances the convergence rate of common projection algorithms. Numerical tests exhibit the exact recovery of the object and the perturbations when there is high redundancy in the data.

17 February 2017 in Journal of Chemical Theory and Computation
Verified
Journal Article
Closed access
WHWei Hu
Wei Hu
LLLin Lin
Lin Lin
ABAmartya S. Banerjee
Amartya S. Banerjee
EVEugene Vecharynski
Eugene Vecharynski
CYChao Yang
Chao Yang