Armando Bellante
@ikiga1.bsky.social
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.
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
October 9, 2025 at 12:21 PM
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
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
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
October 9, 2025 at 12:21 PM
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
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