Antonio Anna Mele
@antonioannamele.bsky.social
170 followers 240 following 22 posts
Thinking about Quantum information at Freie Universität Berlin antonioannamele.com
Posts Media Videos Starter Packs
antonioannamele.bsky.social
It was a great collaboration with Marco Fanizza, Vishnu Iyer, Junseo Lee and Francesco Anna Mele -- mostly entirely done over the past few months on a Whatsapp group that, due to the different time zones of our 3 different continents, was basically constantly active with new insightful messages. 😁
antonioannamele.bsky.social
All operations in the protocol are experimentally friendly for current photonic platforms, and the protocol has the nice feature that we can trade more input probe energy for lower sample complexity. 🔦
antonioannamele.bsky.social
Super happy to share our new preprint today on ArXiv: 🥳
arxiv.org/pdf/2510.05531

It’s about efficient learning of bosonic Gaussian unitaries with provable recovery guarantees in a physically motivated accuracy metric: the "energy-constrained diamond-norm".
Reposted by Antonio Anna Mele
francescoannamele.bsky.social
The saga of *quantum learning theory with CV systems* never ends!

And indeed, when you look closely at this field, many natural and promising questions arise. For instance:
How to learn CV Gaussian unitaries?

arxiv.org/pdf/2510.05531

1/
antonioannamele.bsky.social
Now I’m heading to Cologne for the “Clifford Commutant” workshop (quantum-randomness.com/clifford-wor...), organized by Markus Heinrich, Xhek Turkeshi, and David Gross, where our Berlin team will have the chance to present our recent paper: arxiv.org/abs/2504.12263. 🇩🇪
Workshop: "Clifford commutant and its applications"
quantum-randomness.com
antonioannamele.bsky.social
Just had the chance to spend a wonderful week in Florence, attending the “Understanding Quantum Machine Learning” workshop ggi.infn.it/showevent.pl...
organized by Leonardo Banchi, Giacomo De Palma, Anderson M. Hernandez & Dario Trevisan, at the charming Galileo Galilei Institute. 🇮🇹
ggi.infn.it
antonioannamele.bsky.social
Super happy to see our beautiful work out — led by the amazing Los Alamos team — now on arXiv:
“Characterizing Quantum Resourcefulness via Group-Fourier Decompositions” lnkd.in/dQWhG4my.

Check out Marco’s great summary!
antonioannamele.bsky.social
Glad to see our Clifford commutant paper accepted as a talk at TQC 2025 happening later this year in India! 🥳
Reposted by Antonio Anna Mele
jenseisert.bsky.social
A complete theory of the Clifford commutant

scirate.com/arxiv/2504.1...

The Clifford group is ubiquitous in quantum information science, with applications in benchmarking, quantum error correction and learning algorithms. Understanding which operators commute with is a powerful tool.
antonioannamele.bsky.social
8/
We hope these results contribute to the toolbox of anyone working with Clifford circuits 🧰.

Thanks again for the wonderful collaboration to my amazing collaborators Lennart Bittel, @jenseisert.bsky.social, Lorenzo Leone, @sfeoliviero.bsky.social. 💪

We’re very happy to receive feedback! 👍
A complete theory of the Clifford commutant
The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unit...
arxiv.org
antonioannamele.bsky.social
7/
💥 Applications abound:
• Complete characterization of measurable magic measures 🧮
• Design of optimal stabilizer property testing strategies 🎯
• A new operational interpretation of stabilizer entropy 🔍, and more!
antonioannamele.bsky.social
6/
📐 We also introduce a graphical calculus tool to diagrammatically manipulate and visualize the elements of this new basis 🎨.

Perfect for hands-on calculations: It allowed us to save lots of writing 📚, as many pages of analytical calculations became just a few diagrams 😉.
antonioannamele.bsky.social
5/
This new "Pauli-sum" basis is intuitive and computationally friendly 💻.

It’s (gracefully) generated by products of:
• Permutation operators (which generate the commutant of the unitary group) 🔄
• Just three additional operators 🔑
antonioannamele.bsky.social
4/
🔧 In our work, we give a full description of the commutant for arbitrary n (qubits) and k (tensor powers):

- An explicit orthogonal basis 🧮

- The exact dimension of the commutant 📏

- A new, compact, and easy-to-manipulate basis formed by isotropic sums of Pauli operators 🔀
antonioannamele.bsky.social
3/
The seminal work arxiv.org/abs/1712.086... already provided a characterization of the Clifford commutant 🧠, assuming k was relatively small (less than linear with respect to the number of qubits n). However, a characterization for larger values of k was still missing 🤔.
Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
Schur-Weyl duality is a ubiquitous tool in quantum information. At its heart is the statement that the space of operators that commute with the tensor powers of all unitaries is spanned by the permutations of the tensor factors. In this work, we describe a similar duality theory for tensor powers of Clifford unitaries. The Clifford group is a central object in many subfields of quantum information, most prominently in the theory of fault-tolerance. The duality theory has a simple and clean description in terms of finite geometries. We demonstrate its effectiveness in several applications: (1) We resolve an open problem in quantum property testing by showing that "stabilizerness" is efficiently testable: There is a protocol that, given access to six copies of an unknown state, can determine whether it is a stabilizer state, or whether it is far away from the set of stabilizer states. We give a related membership test for the Clifford group. (2) We find that tensor powers of stabilizer states have an increased symmetry group. We provide corresponding de Finetti theorems, showing that the reductions of arbitrary states with this symmetry are well-approximated by mixtures of stabilizer tensor powers (in some cases, exponentially well). (3) We show that the distance of a pure state to the set of stabilizers can be lower-bounded in terms of the sum-negativity of its Wigner function. This gives a new quantitative meaning to the sum-negativity (and the related mana) -- a measure relevant to fault-tolerant quantum computation. The result constitutes a robust generalization of the discrete Hudson theorem. (4) We show that complex projective designs of arbitrary order can be obtained from a finite number (independent of the number of qudits) of Clifford orbits. To prove this result, we give explicit formulas for arbitrary moments of random stabilizer states.
arxiv.org
antonioannamele.bsky.social
2/
At the heart of understanding many properties of the Clifford group 💡 — and unlocking its broad range of applications 🚀 — lies its commutant: the set of operators that commute with the k-fold tensor powers of all Clifford unitaries.
antonioannamele.bsky.social
1/
The Clifford group is ubiquitous in quantum information 🌐.
It lies at the core of many key applications 🔑, including error correction, tomography, benchmarking, and more.

It consists of unitaries that map Pauli operators to Pauli operators under conjugation 🔄.
antonioannamele.bsky.social
I think it's a great feeling in research when someone else finds a problem you were excited about interesting too, and decides to invest their time in it! 🙂
antonioannamele.bsky.social
Happy to announce that our paper is now published in @quantum-journal.bsky.social .

We show that deciding whether a given dataset, formed by a few Majorana correlation functions estimates, can be consistent with a free-fermionic state is an NP-complete problem.
quantum-journal.org/papers/q-202...
antonioannamele.bsky.social
Or for a very accessible summary of our work, you can also read this brief article physics.aps.org/articles/v18... .

For a less accessible summary, you can also read my previous X/Twitter-post: x.com/QuAntonioMel... .