https://jakub-oprsal.info/bcm2024/ Recent content in Birmingham CSP Meeting 2024 on jakub opršal Hugo -- gohugo.io en-gb Thu, 25 Jan 2024 16:21:15 +0000 https://jakub-oprsal.info/bcm2024/shorttalks/ Fri, 03 May 2024 10:00:00 +0000 https://jakub-oprsal.info/bcm2024/shorttalks/ Jakub Opršal Two failures of gadget reductions arXiv:2301.05084 Alberto Larrauri Solving promise equations over monoids and groups arXiv:2402.08434 Riccardo Treglia A brief introduction to myself Kristina Asimi Model checking problems Silvia Butti Plurimorphisms, and how to use them arXiv:2401.15186 Standa Živný PTAS for Max-CSPs Each talk should take (at most) 6 minutes including some brief questions. If you plan to use pdf slides, please send them to me by this Friday (or latest Monday before the event); these will be concatenated to facilitate changes of speakers. https://jakub-oprsal.info/bcm2024/schedule/ Sun, 28 Apr 2024 12:51:50 +0000 https://jakub-oprsal.info/bcm2024/schedule/ Tuesday 7 May 12pm meet and greet (lunch buffet) 1pm Welcome 1.15pm–1.45pm Andrei Krokhin Introduction to Promise CSPs 2pm coffee break 2.30pm–3.30pm blitz session schedule and titles of short talks 3.30pm–4.30pm discussions 4.30pm–5pm Lorenzo Ciardo Quantum advantage and CSP complexity 7.30pm Dinner at The Indian Streatery ///dice.unless.atoms Wednesday 8 May 9.30am–10am Hubie Chen Surjective Constraint Satisfaction: A Personal Travelogue 10am–10.30am Benedikt Pago Limitations of affine consistency algorithms 10.30am coffee break https://jakub-oprsal.info/bcm2024/abstracts/ Thu, 11 Apr 2024 14:51:50 +0200 https://jakub-oprsal.info/bcm2024/abstracts/ Lorenzo Ciardo Quantum advantage and CSP complexity Information-processing tasks modelled by homomorphisms between relational structures can witness quantum advantage when entanglement is used as an extra computational resource. In this talk, I will show that the occurrence of quantum advantage is determined by the same type of algebraic structure (known as a minion) that captures the polymorphism identities of CSPs and, thus, CSP complexity. By studying the structure of the quantum minion and making use of classical results from the algebraic approach to CSPs, I will then show a characterisation of the graphs that have quantum advantage.