◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Kai-Min Chung

36 papers hereh-index 313.1k citations110 works total

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

author position
  • first author17
  • middle author16
  • last author3

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

fields
  • quant-ph21
  • cs.CR6
  • cs.DS4
  • cs.CC1
  • cs.IT1
  • cs.LO1
same name
  • Kai-Min Chung — 5 papers, h 2
  • Kai-Min Chung — 3 papers, h 2
  • Kai-Min Chung — 2 papers, h 4

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
20082024
most citedPhysical Randomness Extractors: Generating Random Numbers with Minimal Assumptions

40 citations · 92 across the 28 of their papers we have counts for

collaborators
Showing 2018Show all

4 papers · 1 filter

quant-ph2018★ 2 cited

Interactive Leakage Chain Rule for Quantum Min-entropy

Ching-Yi Lai, Kai-Min Chung

The leakage chain rule for quantum min-entropy quantifies the change of min-entropy when one party gets additional leakage about the information source. Herein we provide an intera…

quant-ph2018

Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem

Kai-Min Chung, Han-Hsuan Lin

We generalize the PAC (probably approximately correct) learning model to the quantum world by generalizing the concepts from classical functions to quantum processes, defining the…

cs.NE2018

On the Algorithmic Power of Spiking Neural Networks

Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu

Spiking Neural Networks (SNN) are mathematical models in neuroscience to describe the dynamics among a set of neurons that interact with each other by firing instantaneous signals,…

cs.IT2018★ 12 cited

Quantum Encryption and Generalized Quantum Shannon Impossibility

Ching-Yi Lai, Kai-Min Chung

The famous Shannon impossibility result says that any encryption scheme with perfect secrecy requires a secret key at least as long as the message. In this paper we provide its qua…

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