Matt

quantum, ece @purdue

[Matt @mech2code]

SF next week

[Matt @mech2code]

The world of math extends far beyond math. Its static patterns are behavioral science for general dynamic patterns (non-physical, competencies, types of minds). Physical interfaces between ecology of patterns, à la Mind-Body and Math-Physics

[Matt @mech2code]

@amypretzel Bicycle

[Matt @mech2code]

The quantum wizards are preparing and distilling magic and you’re bearish

[Matt @mech2code]

@RomiLifshitz @CraigGidney None since the exactness is more expensive: https://t.co/pRrgOZDmuf

[Abe Asfaw @abe_asfaw]

OK did 1 pass. Looks like the novelty here is replacing the QFT box which rotates phases in a circle with another magic box which rotates phases in a 4-corner square, and that + Grover amplification = exact probabilities. So I made a visual to see it in action.

[Matt @mech2code]

@junyuliu4 @Isaac__kim What’s the QAOA result, link? Thank you

[Matt @mech2code]

@ivanidze404 Nope only in between

[Matt @mech2code]

High performance clocks and synchronization hardware for a PICOSECOND level timing network

[Matt @mech2code]

@jazzloaf @deepfates @lfschiavo @grove_research @georgeing Haha wonderful thank you

[Matt @mech2code]

@ctjlewis Why is this commentary on the timeline? It’s too Lindy

[Matt @mech2code]

@apruden08 @dallairedemers It’s true

[Matt @mech2code]

I found an improved algorithm for unitary synthesis! This is a fundamental step in compiling quantum programs, and pushes state-of-the-art closer towards the theoretical lower bound.

This problem has been on my mind for the past 2 years and I'm happy to make progress.

[Matt @mech2code]

@letonyo Indeed, AI helped with this

[Matt @mech2code]

I found an improved algorithm for unitary synthesis! This is a fundamental step in compiling quantum programs, and pushes state-of-the-art closer towards the theoretical lower bound.

This problem has been on my mind for the past 2 years and I'm happy to make progress.

[Matt @mech2code]

I found an improved algorithm for unitary synthesis! This is a fundamental step in compiling quantum programs, and pushes state-of-the-art closer towards the theoretical lower bound.

This problem has been on my mind for the past 2 years and I'm happy to make progress.

[Matt @mech2code]

@johnsmithyson0 Controlled-NOT (CNOT) gates are fundamental ops in quantum computing. This problem involves compiling an arbitrary quantum op (unitary matrix) to primitive ops to run on the hardware

[Matt @mech2code]

The new algorithm isn't completely analytical but nonetheless, progress! I'll put out paper and numerical experiments soon once verified, but I am happy

[Matt @mech2code]

I'll be at Harvard tomorrow working on auto-formalizing some maths, hopefully optimal unitary synthesis.

[Matt @mech2code]

@faintlimits Ising machines, mainly their annealing theory instead of hardware. Should be the first application of the friction tensor to Kuramoto, I think.

[Matt @mech2code]

@indefeasible_ Extending geometric landscape annealing [0] to Kuramoto oscillators, as proposed in the future work. Viewing them as Langevin diffusion, I think some minimum dissipation bounds could apply in the slow-driving case using the friction metric tensor

[0] https://t.co/7KG1qZca4J

[Matt @mech2code]

@thmorriss Yeah cloudflare is goated but I should probably move on from the default hugo theme

[Matt @mech2code]

I'll be at Harvard tomorrow working on auto-formalizing some maths, hopefully optimal unitary synthesis.