default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIon Nechita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Ion Nechita
, Simon Schmidt, Moritz Weber:
Sinkhorn Algorithm for Quantum Permutation Groups. Exp. Math. 32(1): 156-168 (2023)- [j16]Alexander Müller-Hermes, Ion Nechita, David Reeb:
A refinement of Reznick's Positivstellensatz with applications to quantum information theory. Quantum 7: 1001 (2023) - [i2]Pierre Botteron, Anne Broadbent, Reda Chhaibi, Ion Nechita, Clément Pellegrini:
Algebra of Nonlocal Boxes and the Collapse of Communication Complexity. CoRR abs/2312.00725 (2023) - 2022
- [j15]Qing-Hua Zhang, Ion Nechita:
A Fisher Information-Based Incompatibility Criterion for Quantum Channels. Entropy 24(6): 805 (2022) - [j14]Stéphane Dartois, Ion Nechita, Adrian Tanasa:
Entanglement criteria for the bosonic and fermionic induced ensembles. Quantum Inf. Process. 21(11): 376 (2022) - [j13]Andreas Bluhm, Ion Nechita:
Maximal violation of steering inequalities and the matrix cube. Quantum 6: 656 (2022) - [j12]Teiko Heinosaari, Maria Anastasia Jivulescu, Ion Nechita:
Order preserving maps on quantum measurements. Quantum 6: 853 (2022) - 2021
- [j11]Ion Nechita, Jordi Pillet:
SudoQ - a quantum variant of the popular game. Quantum Inf. Comput. 21(9&10): 781-799 (2021) - [j10]Ion Nechita, Clément Pellegrini, Denis Rochette:
A geometrical description of the universal $1 \rightarrow 2$ asymmetric quantum cloning region. Quantum Inf. Process. 20(10): 333 (2021) - [j9]Satvik Singh, Ion Nechita:
Diagonal unitary and orthogonal symmetries in quantum theory. Quantum 5: 519 (2021) - 2020
- [j8]Andreas Bluhm, Ion Nechita:
Compatibility of Quantum Measurements and Inclusion Constants for the Matrix Jewel. SIAM J. Appl. Algebra Geom. 4(2): 255-296 (2020)
2010 – 2019
- 2018
- [j7]Motohisa Fukuda, Ion Nechita:
On the Minimum Output Entropy of Random Orthogonal Quantum Channels. IEEE Trans. Inf. Theory 64(2): 1374-1384 (2018) - [i1]Ivan Bardet, Cécilia Lancien, Ion Nechita:
de Finetti reductions for partially exchangeable probability distributions. CoRR abs/1801.05240 (2018) - 2017
- [j6]Teodor Banica, Ion Nechita:
Flat matrix models for quantum permutation groups. Adv. Appl. Math. 83: 24-46 (2017) - 2015
- [j5]Maria Anastasia Jivulescu, Nicolae Lupa, Ion Nechita:
Thresholds for reduction-related entanglement criteria in quantum information theory. Quantum Inf. Comput. 15(13&14): 1165-1184 (2015) - [j4]Motohisa Fukuda, Ion Nechita, Michael M. Wolf:
Quantum Channels With Polytopic Images and Image Additivity. IEEE Trans. Inf. Theory 61(4): 1851-1859 (2015) - 2013
- [j3]Teodor Banica, Ion Nechita:
Almost Hadamard matrices: The case of arbitrary exponents. Discret. Appl. Math. 161(16-17): 2367-2379 (2013) - 2012
- [j2]Teodor Banica, Ion Nechita, Karol Zyczkowski:
Almost Hadamard Matrices: General Theory and Examples. Open Syst. Inf. Dyn. 19(4) (2012) - 2010
- [j1]Benoit Collins, Ion Nechita:
Eigenvalue and Entropy Statistics for Products of Conjugate Random Quantum Channels. Entropy 12(6): 1612-1631 (2010)
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:50 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:
