◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jianqiang Li

7 papers hereh-index 431 citations7 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author2
  • middle author3

Across the 7 of 7 papers where every author was matched, so the position is known.

fields
  • quant-ph6
  • cs.DS1
same name
  • Jianqiang Li — 18 papers, h 10
  • Jianqiang Li — 7 papers, h 3
  • Jianqiang Li — 7 papers, h 2
  • Jianqiang Li — 4 papers, h 26
  • Jianqiang Li — 4 papers, h 9
  • Jianqiang Li — 3 papers, h 23

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20232026
most citedExponential Quantum Advantage for Pathfinding in Regular Sunflower Graphs

3 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing quant-phShow all

4 papers · 1 filter

quant-ph2026

Faster quantum linear system solver beyond the condition number

Alexander M. Dalzell, Jianqiang Li, Yuan Su

The spectral condition number is a widely adopted measure of worst-case cost for quantum linear system solvers. Yet it can significantly overestimate the actual runtime for a typic…

quant-ph2025

A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving Multivariate Polynomial Systems

Jianqiang Li

Given a matrix A of dimension M×N and a vector b, the quantum linear system (QLS) problem asks for the preparation of a quantum state ∣y​⟩ proportio…

quant-ph2025

Layerwise Federated Learning for Heterogeneous Quantum Clients using Quorus

Jason Han, Nicholas S. DiBrita, Daniel Leeds +3

Quantum machine learning (QML) holds the promise to solve classically intractable problems, but, as critical data can be fragmented across private clients, there is a need for dist…

quant-ph2024

Exponential Quantum Advantage for Pathfinding in Regular Sunflower Graphs

Jianqiang Li, Yu Tong

Finding problems that allow for superpolynomial quantum speedup is one of the most important tasks in quantum computation. A key challenge is identifying problem structures that ca…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.