Jintao Yu

Jintao Yu

Auto-generated profile, based on publicly available information

Jintao Yu

Arclight Quantum Computing Inc., Beijing, Beijing, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
25 October 2022 in ACM Journal on Emerging Technologies in Computing Systems
Verified
Journal Article
Open access
AGAnteneh Gebregiorgis
Anteneh Gebregiorgis
HNHoang Anh Du Nguyen
Hoang Anh Du Nguyen
JYJintao Yu
Jintao Yu
RBRajendra Bishnoi
Rajendra Bishnoi
MTMottaqiallah Taouil
Mottaqiallah Taouil
SHSaid Hamdioui
Said Hamdioui
Faster and cheaper computers have been constantly demanding technological and architectural improvements. However, current technology is suffering from three technology walls: leakage wall, reliability wall, and cost wall. Meanwhile, existing architecture performance is also saturating due to three well-known architecture walls: memory wall, power wall, and instruction-level parallelism (ILP) wall. Hence, a lot of novel technologies and architectures have been introduced and developed intensively. Our previous work has presented a comprehensive classification and broad overview of memory-centric computer architectures. In this article, we aim to discuss the most important classes of memory-centric architectures thoroughly and evaluate their advantages and disadvantages. Moreover, for each class, the article provides a comprehensive survey on memory-centric architectures available in the literature.

18 May 2023 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
JGJingzhe Guo
Jingzhe Guo
HLHuazhe Lou
Huazhe Lou
JYJintao Yu
Jintao Yu
RLRiling Li
Riling Li
WFWang Fang
Wang Fang
MYMingsheng Ying
Mingsheng Ying
We introduce isQ, a new software stack for quantum programming in an imperative programming language, also named isQ. The aim of isQ is to make programmers write quantum programs as conveniently as possible. In particular: 1)The isQ language and its compiler contain many useful features, including but not limited to: classical control flow, such as recursion; decomposition of self-defined unitary gates; and oracle programming and its circuit realization. 2)To make it flexible, an isQ program can be compiled into several different kinds of intermediate representation and assemblies, including QIR, eQASM, OpenQASM 3.0, and QCIS (specially tailored for the superconducting quantum hardware at USTC). 3)Besides interfacing isQ with real superconducting hardware, a QIR simulator is also developed for the demonstration and testing of isQ programs. isQ software stack encompasses abundant compiler optimizations of high-level quantum programs. To realize it, a distinct MLIR dialect name isQ-IR is proposed.

20 October 2017 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
JYJintao Yu
Jintao Yu
RNRazvan Nane
Razvan Nane
Imran AshrafImran Ashraf
Imran Ashraf
MTMottaqiallah Taouil
Mottaqiallah Taouil
SHSaid Hamdioui
Said Hamdioui
KBKoen Bertels
Koen Bertels
Memristor-based Computation-in-Memory (CIM) is one of the emerging architectures for next-generation Big Data problems. Its design requires a radically new synthesis flow because the memristor is a passive device that uses resistance to encode its logic value. This article proposes a synthesis flow for mapping parallel applications on memristor-based CIM architecture. It employs solution templates that contain scheduling, placement, and routing information to map multiple algorithms with similar data flow graphs to memristor crossbar; this template is named skeleton. Complex algorithms that do not fit any skeleton can be solved by nested skeletons. Therefore, this approach can be applied to a wide range of applications with a limited number of skeletons. It further improves the design when spatial and temporal patterns exist in input data. To accelerate simulation of generated SystemC models, we integrate MPI in skeletons. The synthesis flow and its additional features are verified with multiple applications, and the results are compared against a multicore platform. These experiments demonstrate the feasibility and the potential of this approach.

26 February 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
JYJintao Yu
Jintao Yu
MLMuath Abu Lebdeh
Muath Abu Lebdeh
HNHoang Anh Du Nguyen
Hoang Anh Du Nguyen
MTMottaqiallah Taouil
Mottaqiallah Taouil
SHSaid Hamdioui
Said Hamdioui
A novel type of hardware accelerators called automata processors (APs) have been proposed to accelerate finite-state automata. The bone structure of an AP is a hierarchical routing matrix that connects many memory arrays. With this structure, an AP can process an input symbol every clock cycle, and hence achieve much higher performance compared to conventional architectures. However, the design automation for the APs is not well researched. This paper proposes a fully automated tool named APmap for mapping the automata to APs that use a two-level routing matrix. APmap first partitions a large automaton into small graphs and then maps them. Multiple transformations are applied to the automaton by APmap to meet hardware constraints. The experiments on a standard benchmark suite show that our approach leads to around 19% less storage utilization compared to state of the art.

26 July 2026
Verified
Conference Paper
Open access
XHXin Hong
Xin Hong
JYJintao Yu
Jintao Yu
RHRunhong He
Runhong He
SYShenggang Ying
Shenggang Ying
SLSanjiang Li
Sanjiang Li
MYMingsheng Ying
Mingsheng Ying