User talk:Luca Innocenti

Welcome ! 

Welcome to Wikipedia and thank you for your contributions! I'm Paine Ellsworth, one of the other editors here, and I hope you decide to stay and help contribute to this amazing repository of knowledge. Alternatively, leave me a message at my talk page or type  here on your talk page, and someone will try to help. Remember to always sign your posts on talk pages. You can do this either by clicking on the button on the edit toolbar or by typing four tildes   at the end of your post. This will automatically insert your, a link to this talk) page, and a timestamp. The best way to learn about something is to experience it. Explore, learn, contribute, and don't forget to have some fun! To get some practice editing you can use a sandbox. ou can  for use any time. Perfect for working on bigger projects. Then for easy access in the future, you  put  on.

 Sincerely, – Paine EllsworthC LIMAX ! 11:28, 6 February 2015 (UTC)  [//en.wikipedia.org/w/index.php?title=User_talk:Paine_Ellsworth&action=edit&section=new&preload=Template:Welcome_to_Wikipedia/user-talk_preload (Leave me a message)]

Español

Deutsch

Français

Italiano

עברית

Русский

日本語

Polski

فارسی

Because you thanked me
11:28, 6 February 2015 (UTC)

Split exact sequence
Hi Luca, just letting you know that there is a small mistake in the commutative diagram you added to the split exact sequence article – the map $$A \to A \oplus C$$ in the bottom row should be the inclusion $$i$$, not the identity (thank you for adding a commutative diagram though!). Joel Brennan (talk) 13:54, 6 December 2021 (UTC)


 * Thanks for pointing that out! Should be fixed now Luca (talk) 14:02, 6 December 2021 (UTC)

ArbCom 2022 Elections voter message
 Hello! Voting in the 2022 Arbitration Committee elections is now open until 23:59 (UTC) on. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2022 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add to your user talk page. MediaWiki message delivery (talk) 01:23, 29 November 2022 (UTC)

Fidelity of quantum states
Could I interest you in making some edits to Fidelity of quantum states where I have a major conflict of interest? I see you have expertise in this area.

In the subsection Consistency with fidelity between probability distributions it is noted that the fidelity formula can be simplified for the case that $$\rho$$ and $$\sigma$$ commute to give $$F(\rho,\sigma)=\left[\operatorname{tr}\sqrt{\rho\sigma}\right]^2$$, and that this then simplifies further in terms of the eigenvalues of $$\rho$$ and $$\sigma$$. However we have shown in Efficiently computing the Uhlmann fidelity for density matrices (arxiv version here) that the form $$\left[\operatorname{tr}\sqrt{\rho\sigma}\right]^2$$ can be used in the general case, for any $$\rho$$ and $$\sigma$$ (the next step, in terms of eigenvalues, does require commutation).

Would it be possible to add this result? Thanks, Jonathan A Jones (talk) 11:10, 25 September 2023 (UTC)


 * Hello! Sorry, yes, I agree it would be useful to add that to the page, and I understand the conflict of interest situation. I started doing it but then ended up modifying a bunch of other things because I was a bit annoyed by the overall structuring of the page. I'm planning to add the $$\operatorname{tr}\sqrt{\rho\sigma}$$ expression, but I wanted to understand the paper a bit better first. I'll get to it, just give me a few days.
 * Interesting paper by the way. I assume you're familiar with this quantumcomputing.SE post? It's where I first heard about that simplified expression for the fidelity a few years ago. It might be nice to link your paper there as well. Either as a comment, or even better as an answer if you feel like going into a more detailed explanation of the main arguments. Luca (talk) 16:20, 26 September 2023 (UTC)
 * That would be great, many thanks. As you can see I also was unhappy with some of the structure of the page, and have tweaked some of your improvements. Our result was independently rediscovered by Adrian Muller, and he put it on Scirate where Bartosz Regula pointed him at our paper, an earlier equivalent result from Sarah Plosker's group, and that stackexchange post. It looks to me like this result keeps on being rediscovered, and so it would be good to have it on the Wikipedia page so it doesn't get forgotten yet again. Jonathan A Jones (talk) 19:24, 26 September 2023 (UTC)
 * Armed with these other versions it's possible to come up with a much simpler proof. From the fact that the Uhlmann form is normal by construction you can use the spectral decomposition to work out the fidelity in the eigenbasis, leading to the square of the sum of the sqare-roots of the eigenvalues form. Then you can use the fact that the the eigenvalues of a matrix product are invariant uder cyclic permutation to get the eigenvalues from those of $$\rho\sigma$$. Note that this doesn't have to be normal, because you apply the spectral decomposition argument to a different matrix with the same eigenvalues which is normal. The invariance of the eigenvalues under cyclic permutation was new to me, but was described to me by Plosker as "well known", and Muller has a simple sketch proof in his paper. Jonathan A Jones (talk) 19:34, 26 September 2023 (UTC)
 * I have been adding stuff at the stackexchange page as you suggested, as has Adrian Muller. Let me know if there's anything more I can help with on possible edits to the Wikipedia page. Jonathan A Jones (talk) 18:09, 13 November 2023 (UTC)

ArbCom 2023 Elections voter message
 Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2023 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add to your user talk page. MediaWiki message delivery (talk) 00:46, 28 November 2023 (UTC)