Martin Elsman - Deriving a Kronecker-Free Functional Quantum Simulator

See the paper Deriving a Kronecker-Free Functional Quantum Simulator. 

 
17:22 How hard it is to find comprehensible surveys in this field. Reply by Samson Abramsky.
 
There was also a talk by Martin at ICFP 2026 (7:41:22) but they forgot to charge the microphone or something. However it's audible from 7:55:13.

Samson Abramsky on Quantum Monads

8:00 On relations and graph isomorphisms: the Heisenberg-Weyl algebra is a special case of generic graph rewriting.  See The algebras of graph rewriting by Nicolas Behr, Vincent Danos, Ilias Garnier and Tobias Heindel. I wonder how much proof theory can fit into this framework of isomorphism classes of graph-rewriting systems. See for example Sequent calculi for a unity of logic by Norihiro Yamada..: "Classical logic is the logic that permits unrestricted premise consumptions and reasoning do-overs, and is unaware of either". 

See The Sheaf-Theoretic Structure Of Non-Locality and Contextuality by Samson Abramsky and Adam Brandenburger and A Participatory Universe in the Realist Mode: On the Separation of Observational and Agentive Perspectives in Classical and Quantum Mechanics by Jenann Ismael.

Why in God's name is it so hard to find out about the really brilliant work some people do? It gets drowned in the flood of mediocrity promoted by people trying to make money? Is that all?

See also Amr Sabry - What is "Quantum" about Quantum Computing?

Subscribe to ACM SIGPLAN. 

Samson Abramsky gave a talk at a Semantics and Syntax Seminar in 2012 entitled Propositional calculus and the nature of reality:

The inadmissible step at 14:00:

22:05 On autopoiesis in biological systems and the mathematical biology of Robert Rosen. See A computable expression of closure to efficient causation by Matteo Mossio, Giuseppe Longo and John Stewart.

25:08 On the types determined by the functional equations, see Hyperfunctions: 

33:10 Question on the difference between intensional and extensional recursion theorems: See Kleene’s Amazing Second Recursion Theorem (2010) by Yiannis Moschovakis (available from the author's web page) and some Slides freely available here. See also my recent post Intensional and Extensional Semantics in Programming Languages and Type Theory.

Subscribe to The INI Seminar Room 2 to see other fascinating talks twelve years after they were delivered.

Comments

Post a Comment

Popular posts from this blog

How Could One Unify CMU and MIT

Image
I mean, how to get the best of the two different philosophies of computation. One is based on typed programming languages and the other on engineering with diagrams . This is about practical computing and the cost and feasibility of software development in general. Here is the problem: We have a lot of algorithms which can all be described abstractly using some sort of pseudocode, or perhaps using some particular language (usually Python!). These algorithms are often well-studied and a lot is known about them in terms of their computational complexity in time and space. Substantive practical software systems invariably employ many such algorithms, often implemented in libraries with more or less well-specified APIs. But very few of these libraries are capable of interoperating because they are either packages written in some specific programming language like Java or Haskell, say, or they are written in C and used as object code, or they are written in an interpreted language like Sc...
Read more

Tensor Fields and Simplicial Complexes

Image
Listening to Freya Holmér last night I started to get glimmers of an idea I had long ago about how to represent vector spaces in computational processes using this recursive abstract type :  abstype 'a point = POINT   of {getx :  'a vector,       diff :  'a point -> 'a point,       move :  'a point -> 'a point,       scale : 'a -> 'a point,       proj :  'a point -> 'a} with    fun new i (op +) (op -) (op * ) dot =    let fun self x =  POINT       {getx = x,        move = fn (POINT pr) =>           (self (x + (#getx pr))),        diff = fn (POINT pr) =>          self (x - (#getx pr)),        scale = fn i =>          (self (x * i)),        proj = fn (POINT pr) =>     ...
Read more

HTML in Blog Posts

Just testing stuff: SVG You can click on the blue circle: MathML There is not much you can do with this. See Mathematical Markup Language 1.01 Specification   7.1.5 Mixing and Linking MathML and HTML . It's the big problem  of how you compose languages.   a x 2 + b x + c = 0 You can click on the discriminant: x = − b ± b 2 − 4 ⁢ a ⁢ c 2 ⁢ a 2D Canvas Sound  Beep! WebGPU Next level Parser expression grammar compiler:  https://peggyjs.org/online.html Devine Lu Linvega's unxtal assembler/debugger:  https://wiki.xxi...
Read more