default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabio Benatti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j17]Fabio Benatti, Dariusz Chruscinski, Roberto Floreanini:
Local Generation of Entanglement with Redfield Dynamics. Open Syst. Inf. Dyn. 29(1): 2250001:1-2250001:18 (2022)- 2021
- [j16]Fabio Benatti
, Roberto Floreanini, Ugo Marzolino:
Entanglement and Non-Locality in Quantum Protocols with Identical Particles. Entropy 23(4): 479 (2021)
2010 – 2019
- 2019
- [j15]Fabio Benatti, Luigi Brancati:
Quasi-Entropies and Non-Markovianity. Entropy 21(10): 1020 (2019) - [j14]Fabio Benatti:
Hadamard Completely Positive Semigroups. Open Syst. Inf. Dyn. 26(4): 1950020:1-1950020:9 (2019) - 2017
- [j13]Fabio Benatti, Samad Khabbazi Oskouei, Ahmad Shafiei Deh Abad:
Quantum Entropy and Complexity. Open Syst. Inf. Dyn. 24(2): 1750005:1-1750005:26 (2017) - [j12]Fabio Benatti, Roberto Floreanini, Flaminia Franchini, Ugo Marzolino:
Remarks on Entanglement and Identical Particles. Open Syst. Inf. Dyn. 24(3): 1740004:1-1740004:16 (2017) - [i2]Fabio Benatti, Samad Khabbazi Oskouei, Ahmad Shafiei Deh Abad:
Quantum entropy and complexity. CoRR abs/1705.09449 (2017) - 2015
- [j11]Fabio Benatti, Laure Gouba:
Semi-Classical Localisation Properties of Quantum Oscillators on a Noncommutative Configuration Space. Open Syst. Inf. Dyn. 22(4): 1550021:1-1550021:17 (2015) - 2014
- [j10]Fabio Benatti, Roberto Floreanini, Kelvin Titimbo:
Entanglement of Identical Particles. Open Syst. Inf. Dyn. 21(1-2) (2014) - 2013
- [j9]Fabio Benatti, Mahya Karbalaii:
Entanglement Witnesses for a Class of Bipartite States of n × n Qubits. Open Syst. Inf. Dyn. 20(2) (2013) - [j8]Fabio Benatti, Federico Carollo:
A non-Markovian Dissipative Maryland Model. Open Syst. Inf. Dyn. 20(3) (2013) - 2012
- [j7]Fabio Benatti:
Quantum Dynamical Entropies and Gács Algorithmic Entropy. Entropy 14(7): 1259-1273 (2012)
2000 – 2009
- 2009
- [j6]Fabio Benatti:
Quantum Algorithmic Complexities and Entropy. Open Syst. Inf. Dyn. 16(1): 1-28 (2009) - 2008
- [j5]Sebastiano Anderloni, Fabio Benatti, Roberto Floreanini:
Noise Induced Current in a Double-Well Trap. Open Syst. Inf. Dyn. 15(2): 143-154 (2008) - 2007
- [j4]Fabio Benatti:
Entropy and algorithmic complexity in quantum information theory. Nat. Comput. 6(2): 133-150 (2007) - 2006
- [j3]Fabio Benatti, Roberto Floreanini:
Tests of Complete Positivity in Fiber Optics. Open Syst. Inf. Dyn. 13(3): 229-238 (2006) - 2005
- [i1]Fabio Benatti, Tyll Krueger, Markus Müller, Rainer Siegmund-Schultze, Arleta Szkola:
Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem. CoRR abs/quant-ph/0506080 (2005) - 2004
- [j2]Fabio Benatti, Roberto Floreanini, Marco Piani:
Non-Decomposable Quantum Dynamical Semigroups and Bound Entangled States. Open Syst. Inf. Dyn. 11(4): 325-338 (2004) - 2001
- [j1]Fabio Benatti, Roberto Floreanini, A. Lapel:
Open Quantum Systems and Complete Positivity. Cybern. Syst. 32(3): 343-366 (2001)
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-04-25 05:42 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:
