◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Qi Yu

4 papers hereh-index 342 citations6 works total

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

author position
  • first author1
  • middle author3

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

fields
  • quant-ph4
same name
  • Qi Yu — 9 papers, h 0
  • Qi Yu — 8 papers, h 8
  • Qi Yu — 7 papers, h 25
  • Qi Yu — 5 papers, h 2
  • Qi Yu — 5 papers, h 0
  • Qi Yu — 5 papers, h 0

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
20182026
most citedQuantum speed-up in solving the maximal clique problem

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

collaborators

4 papers

quant-ph2026

Rate and depth of two-axis twisting by pair exchange under the self-Kerr constraint

Qing Yu, Ying Li, Cuilu Zhai +2

In this paper, we study two bosonic modes that exchange pairs of quanta, which realize two-axis twisting exactly: within a sector of fixed particle number the exchange operator is…

quant-ph2025

Tracking Quantum Dynamics in an Optical Cavity for Recovering Purity and Squeezing via Quantum State Smoothing

Shota Yokoyama, Kiarn T. Laverick, David McManus +6

Tracking the dynamics of a quantum system is conventionally achieved by monitoring the system continuously in time and filtering the information contained in measurement records vi…

quant-ph2025

Scalable entangling gates on ion qubits via structured light addressing

Xueying Mai, Liyun Zhang, Qinyang Yu +2

A central challenge in developing practical quantum processors is maintaining low control complexity while scaling to large numbers of qubits. Trapped-ion systems excel in small-sc…

quant-ph2018★ 17 cited

Quantum speed-up in solving the maximal clique problem

Weng-Long Chang, Qi Yu, Zhaokai Li +3

The maximal clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from…

◍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.