New paper with @MCrichigno at @Phasecraft. AI agents optimize quantum circuits, and an exact verifier checks every result. https://t.co/haFEoS9CIP
The challenge itself is automated too. An agent works with a researcher to build the verifier, tests it, and freezes it. Then the agents compete.
We observed large gains on every problem we tried, from fermion-to-qubit encodings to qubit routing and unitary synthesis. The method applies to any problem with an exact checker.
It's great to see others working in the same direction this week. Excellent papers from Google Quantum AI and Harvard/QuEra/Anthropic:
https://t.co/eiFwH9kPgU
https://t.co/wFQb4hhfCT
and the inverse square root challenge:
https://t.co/WZLXv9pRWN
How many samples from an unknown n-mode η-particle fermionic state are needed to power a shadows scheme? In a new paper we substantially reduce SOTA estimates, check https://t.co/a8FIIOrsk7
Finally, we note the scheme is computationally efficient, with post-processing costs O(n η²) and O(n² η) for generic dense Slaters and quadratic observables, respectively.
Thanks to my wonderful collaborators @MvsCerezo@dmitry_grinko@fredericsauv Nathan Killoran, David Wierichs, Roy Forestano, Aniruddha Sen, and Max West! 11/11
Although the results presented here constitute a signifi-
cant step towards a unified understanding of group-based shadows, the story is not yet complete. Some reps fail to admit NDCEs (e.g. many Sn irreps), and an open question remains: do centralizing bases always exist? 10/11
New paper out!! 🥳😄
Last Friday we uploaded our latest preprint to the arXiv:
"The commutant of fermionic Gaussian unitaries"
Amazing collaboration with @TheImPolster@Nahuel_L_Diaz@MartinLaroo and @DiegoGM_quantum !
Thread 👇
https://t.co/oLDJfptumO