Armando Bellante's Avatar

Armando Bellante

@ikiga1

Postdoctoral researcher in quantum algorithms at the Max Planck Institute of Quantum Optics, Munich. PhD from Politecnico di Milano. Reverse engineering and binary exploitation with Tower of Hanoi and mhackeroni.

93
Followers
201
Following
8
Posts
06.02.2025
Joined
Posts Following

Latest posts by Armando Bellante @ikiga1

Preview
Quantum Sparse Recovery and Quantum Orthogonal Matching Pursuit We study quantum sparse recovery in non-orthogonal, overcomplete dictionaries: given coherent quantum access to a state and a dictionary of vectors, the goal is to reconstruct the state up to $\ell_2$...

This mirrors the classical #CompressedSensing vs. #ShannonNyquist setting: lower bounds for dense objects stay intact, but sparsity in the right dictionary changes the sample/query complexity.

A huge thanks to Stefano Vanerio, @raistolo.bsky.social, and to everyone who discussed this with me. 6/6

09.10.2025 12:21 πŸ‘ 1 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

In favorable regimes (e.g., mβ‰ˆN dictionary vectors, K=Γ•(1) sparsity, and well-conditioned support), QOMP lowers the query cost of pure-state #quantum tomography from Ξ˜Μƒ(N/Ξ΅) to Ō(√N/Ξ΅), breaking known tight lower bounds thanks to the sparsity assumptions. 5/n

09.10.2025 12:21 πŸ‘ 1 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

We prove that under standard dictionary mutual incoherence and well-conditioning assumptions, QOMP recovers the optimal support in polynomial time! 4/n

09.10.2025 12:21 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

To overcome this, we introduce #QOMP: a greedy, iterative #quantumalgorithm that applies block-encoded projections to isolate the residual, estimates overlaps, and identifies one dictionary vector per round, using an error-resetting strategy to prevent error propagation across iterations. 3/n

09.10.2025 12:21 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Post image

We formalize and study the problem of #QuantumSparseRecovery: given coherent access to a state and a dictionary, reconstruct the state up to Ξ΅ β„“ error using as few dictionary vectors as possible. We prove the general problem is #NP-hard, showing that efficiency needs structure. 2/n

09.10.2025 12:21 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Post image

I’m happy to announce a new #preprint! πŸ§‘β€πŸ’»πŸ“πŸŽ‰

Quantum states often show up with hidden structure. What if a state is built from just a few elements of a larger, #non-orthogonal, #overcomplete dictionary? Can we exploit that sparsity to beat standard #tomography costs?

πŸ§΅β¬‡οΈ /n

09.10.2025 12:21 πŸ‘ 3 πŸ” 1 πŸ’¬ 1 πŸ“Œ 0

CC: @mplavala.bsky.social @scinawa.bsky.social

30.05.2025 12:07 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0
Preview
The Generalized Skew Spectrum of Graphs This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our metho...

πŸŽ‰ Our paper β€œThe Generalized Skew Spectrum of Graphs” was accepted to ICML 2025!

We applied deep math - group theory, rep theory & Fourier analysis - to graph ML (no quantum this time!πŸ˜„)

πŸ“ See you in Vancouver in July!
πŸ“„ arxiv.org/abs/2505.23609

#ICML2025 #GraphML #AI #ML

30.05.2025 12:07 πŸ‘ 4 πŸ” 0 πŸ’¬ 2 πŸ“Œ 0
Preview
Evaluating the potential of quantum machine learning in cybersecurity: A case-study on PCA-based intrusion detection systems Quantum computing promises to revolutionize our understanding of the limits of computation, and its implications in cryptography have long been eviden…

Finally, after a very long review process, our new paper (with @ikiga1.bsky.social, @scinawa.bsky.social and @johnmc88.bsky.social) is out!

We explore how promising is Quantum Machine Learning for cybersecurity applications.

www.sciencedirect.com/science/arti...

06.02.2025 15:06 πŸ‘ 28 πŸ” 5 πŸ’¬ 2 πŸ“Œ 0