default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKun Fang 0001
Person information
- affiliation: University of Cambridge, Department of Applied Mathematics and Theoretical Physics, UK
- affiliation (PhD2018): University of Technology Sydney, Centre for Quantum Software and Information, Australia
- affiliation (former): Wuhan University, China
Other persons with the same name
- Kun Fang — disambiguation page
- Kun Fang 0002
![[0000-0003-4686-2354]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-4686-2354")
— Beihang University, Research Institute for Frontier Science, Beijing, China (and 1 more) - Kun Fang 0003 — Delft University of Technnology, Faculty of Electrical Engineering, Mathematics and Computer Science, EEMCS, Netherlands (and 2 more)
- Kun Fang 0004 — Shanghai Jiao Tong University, Institute of Image Processing and Pattern Recognition, China
- Kun Fang 0005 — Nvidia, Santa Clara, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Kun Fang, Jingtian Zhao, Xiufan Li, Yifei Li, Runyao Duan:
Quantum NETwork: from theory to practice. Sci. China Inf. Sci. 66(8) (2023)- 2022
- [i6]Kun Fang, Jingtian Zhao, Xiufan Li, Yifei Li, Runyao Duan:
Quantum NETwork: from theory to practice. CoRR abs/2212.01226 (2022) - 2021
- [j5]Kun Fang, Hamza Fawzi:
The sum-of-squares hierarchy on the sphere and applications in quantum information theory. Math. Program. 190(1): 331-360 (2021) - [i5]Kun Fang, Gilad Gour, Xin Wang:
Ultimate Limits of Quantum Channel Discrimination. CoRR abs/2110.14842 (2021) - 2020
- [j4]Kun Fang, Xin Wang, Marco Tomamichel, Mario Berta:
Quantum Channel Simulation and the Channel's Smooth Max-Information. IEEE Trans. Inf. Theory 66(4): 2129-2140 (2020)
2010 – 2019
- 2019
- [j3]Xin Wang, Kun Fang, Runyao Duan:
Semidefinite Programming Converse Bounds for Quantum Communication. IEEE Trans. Inf. Theory 65(4): 2583-2592 (2019) - [j2]Xin Wang, Kun Fang, Marco Tomamichel:
On Converse Bounds for Classical Communication Over Quantum Channels. IEEE Trans. Inf. Theory 65(7): 4609-4619 (2019) - [j1]Kun Fang, Xin Wang, Marco Tomamichel, Runyao Duan:
Non-Asymptotic Entanglement Distillation. IEEE Trans. Inf. Theory 65(10): 6454-6465 (2019) - [i4]Kun Fang, Hamza Fawzi:
The sum-of-squares hierarchy on the sphere, and applications in quantum information theory. CoRR abs/1908.05155 (2019) - [i3]Kun Fang, Hamza Fawzi:
Geometric Rényi Divergence and its Applications in Quantum Channel Capacities. CoRR abs/1909.05758 (2019) - [i2]Kun Fang, Omar Fawzi, Renato Renner, David Sutter:
A chain rule for the quantum relative entropy. CoRR abs/1909.05826 (2019) - 2018
- [b1]Kun Fang:
Distillation and simulation in quantum information. University of Technology Sydney, Australia, 2018 - [c2]Xin Wang, Kun Fang, Marco Tomamichel:
On Finite Blocklength Converse Bounds for Classical Communication Over Quantum Channels. ISIT 2018: 2157-2161 - [c1]Kun Fang, Xin Wang, Marco Tomamichel, Mario Berta:
Quantum Channel Simulation and the Channel's Smooth Max-Information. ISIT 2018: 2326-2330 - 2017
- [i1]Xin Wang, Kun Fang, Marco Tomamichel:
On converse bounds for classical communication over quantum channels. CoRR abs/1709.05258 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
