default search action
Francesco Buscemi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Michele Dall'Arno, Alessandro Tosini, Francesco Buscemi:
The signaling dimension in generalized probabilistic theories. Quantum Inf. Comput. 24(5&6): 411-424 (2024) - [j15]Francesco Buscemi
, Kodai Kobayashi, Shintaro Minagawa
A complete and operational resource theory of measurement sharpness. Quantum 8: 1235 (2024) - 2023
- [j14]Michele Dall'Arno, Francesco Buscemi, Takeshi Koshiba:
Computing the quantumguesswork: a quadratic assignment problem. Quantum Inf. Comput. 23(9&10): 721-732 (2023) - [j13]Arthur J. Parzygnat
Axioms for retrodiction: achieving time-reversal symmetry with a prior. Quantum 7: 1013 (2023) - [j12]Francesco Buscemi
Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication. Quantum 7: 1035 (2023) - [c3]Sayantan Chakraborty, Aditya Nema, Francesco Buscemi:
Generalized resource theory of purity: one-shot purity distillation with local noisy operations and one way classical communication. ISIT 2023: 980-984 - 2022
- [j11]Michele Dall'Arno
Guesswork of a Quantum Ensemble. IEEE Trans. Inf. Theory 68(5): 3139-3143 (2022) - [i7]Sayantan Chakraborty, Aditya Nema, Francesco Buscemi:
One-shot purity distillation with local noisy operations and one-way classical communication. CoRR abs/2208.05628 (2022) - 2021
- [i6]Michele Dall'Arno, Francesco Buscemi, Takeshi Koshiba:
Classical computation of quantum guesswork. CoRR abs/2112.01666 (2021) - 2020
- [j10]Michele Dall'Arno, Sarah Brandsen, Francesco Buscemi
Explicit Construction of Optimal Witnesses for Input-Output Correlations Attainable by Quantum Channels. Open Syst. Inf. Dyn. 27(4): 2050017:1-2050017:23 (2020) - [j9]Michele Dall'Arno
Extension of the Alberti-Ulhmann criterion beyond qubit dichotomies. Quantum 4: 233 (2020) - [j8]David Schmid
The type-independent resource theory of local operations and shared randomness. Quantum 4: 262 (2020)
2010 – 2019
- 2019
- [j7]Michele Dall'Arno
Tradeoff Relations Between Accessible Information, Informational Power, and Purity. IEEE Trans. Inf. Theory 65(4): 2614-2622 (2019) - [i5]Francesco Buscemi, David Sutter, Marco Tomamichel:
An information-theoretic treatment of quantum dichotomies. CoRR abs/1907.08539 (2019) - 2018
- [i4]Francesco Buscemi:
Comparison of Noisy Channels and Reverse Data-Processing Theorems. CoRR abs/1803.02945 (2018) - 2017
- [c2]Francesco Buscemi:
Comparison of noisy channels and reverse data-processing theorems. ITW 2017: 489-493 - 2016
- [j6]Francesco Buscemi
Degradable channels, less noisy channels, and quantum statistical morphisms: An equivalence relation. Probl. Inf. Transm. 52(3): 201-213 (2016) - [i3]Francesco Buscemi:
Reverse Data-Processing Theorems and Computational Second Laws. CoRR abs/1607.08335 (2016) - 2015
- [i2]Francesco Buscemi:
Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation. CoRR abs/1511.08893 (2015) - 2013
- [j5]Francesco Buscemi
General Theory of Environment-Assisted Entanglement Distillation. IEEE Trans. Inf. Theory 59(3): 1940-1954 (2013) - 2012
- [i1]Mark M. Wilde, Patrick M. Hayden, Francesco Buscemi, Min-Hsiu Hsieh:
The information-theoretic costs of simulating quantum measurements. CoRR abs/1206.4121 (2012) - 2010
- [j4]Francesco Buscemi
The quantum capacity of channels with arbitrarily correlated noise. IEEE Trans. Inf. Theory 56(3): 1447-1460 (2010)
2000 – 2009
- 2009
- [j3]Francesco Buscemi
Towards a Unified Approach to Information-Disturbance Tradeoffs in Quantum Measurements. Open Syst. Inf. Dyn. 16(1): 29-48 (2009) - 2008
- [c1]Francesco Buscemi:
Irreversibility of Entanglement Loss. TQC 2008: 16-28 - 2007
- [j2]Francesco Buscemi
A Minimum-Disturbing Quantum State Discriminator. Open Syst. Inf. Dyn. 14(1): 17-24 (2007) - [j1]Francesco Buscemi
Quantum Erasure of Decoherence. Open Syst. Inf. Dyn. 14(1): 53-62 (2007)
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-09-09 01:12 CEST 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: