Presentation Videos and Slides

The preliminary schedule is listed below, and is subject to change.

January 8th –

18:40 -20:40 Welcome Reception (Hotel Fort Canning)

January 9th –

9:45 -10:00 Mile Gu Opening and Welcome
10:00-11:00 James Crutchfield The Complexity of Simplicity [slides] [video
11:00-11:30 Coffee
11:30-12:20 Geoff Pryde Experimental quantum-enhanced memory use in modelling stochastic processes [video]
12:20-12:45 Farzad Ghafari Jouneghani Experimental realization of a quantum epsilon machine for a 1D Ising spin chain
12:45 – 2:15 Lunch
2:15 -3:05 Chew Lock Yue Quantum versus Classical Measures of Complexity on Classical Information  [slides] [video]
3:05 – 3:30 Jayne Thompson Causal Irreversibility
3:30 – 3:55 Dax Koh Further extensions of Clifford circuits and their classical simulation complexities [slides] [video
3:55-4:25 Coffee
4:25-6:00 Poster Session

January 10th –

9:45 – 10:35 Howard Wiseman Fully quantum epsilon machines
10:35 – 11:00 Tingting Gao A quantum approach to the modeling of stock markets
11:00-11:30 Coffee
11:30-12:20 Otfried Guehne Sequential Measurements in Quantum Mechanics [video]
12:20-12:45 Andrew Garner Unbounded memory advantage in stochastic simulation using quantum mechanics [slides][video
12:45 – 2:15 Lunch
2:15 -3:05 John Mahoney On Prediction and Generation in Classical and Quantum Models of Stochastic Processes
3:05-3:55 Vlatko Vedral A Survey of Quantum Complexity [slides][video]
3:55-4:25 Coffee
4:25-6:00 Discussion Session
8 pm Conference Dinner  Palm Beach Seafood

January 11th

9:45 – 10:35 Daniel Terno Complexity of the entropy problem [video]
10:35 – 11:00 Yu Cai Tree size complexity and quantum computation  [video]
11:00-11:30 Coffee
11:30-12:20 Cheong Siew Ann Information Processing in Classical Complex Networks and [Highly Speculative] How It Might Be Different in Quantum Complex Networks [video]
12:20-12:45 Valentina Parigi Simulation of complex quantum networks with quantum multimode resources based on optical frequency combs
12:45 – 2:15 Lunch
2:15 -3:05 Dagomir Kaszlikowski Algorithmic Complexity and Quantum Contextuality  [video]
3:05-3:55 Adan Cabello Thermodynamical cost of quantum contextuality: A new way of device-independent quantum information [slides] [video]
3:55-4:25 Coffee
4:25-6:00 Discussion session 2
7 pm Public Talk by Howard Wiseman, “Are we in the Matrix?”

Singapore Science Centre


January 12th

9:45-10:35 Tomasz Paterek Communication Complexity of Quantum Correlations
10:35 -11:00 Simon Milz General characterisation framework for complex processes with memory
11:00-11:30 Coffee
11:30-12:20 Chiara Marletto Constructor Theory and Complexity  [slides]
12:20-12:45 Tiago Batalhao Experimental rectification of entropy production by a Maxwell’s Demon in a quantum system [slides] [video]
12:45 – 2:15 Lunch
2:15-3:05 Kwek Leong Chong TBA
3:05-3:55 Man-Hong Yung Universal Bound on Sampling Bosons in Linear Optics and Its Implications on Computation
3:55-4:25 Coffee
Discussion Session 3
5:40-6:00 Closing Remarks