• Mapping quantum circuits to shallow-depth measurement patterns based on graph states

    Speaker: Dr. Matthias Heller, Fraunhofer Institute for Computer Graphics Research IGD Title: Mapping quantum circuits to shallow-depth measurement patterns based on graph states Abstract: The paradigm of measurement-based quantum computing (MBQC) starts from a highly entangled resource state on which unitary operations are executed through adaptive measurements and corrections ensuring determinism. This is set in […]

  • Comm. & Sec. Track meeting: Fault-tolerant coding for quantum communication

    Zoom

    Speaker: Alexander Mueller-Hermes Title: Fault-tolerant coding for quantum communication Location: Zoom (link in Google Group) Abstract:  Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error it is usually assumed that […]

  • Expressive and Constraint-Preserving QAOA for the Minimum Vertex Cover with Optimized Initializations

    Speaker: Finley Quinton, NTNU Title: Expressive and Constraint-Preserving QAOA for the Minimum Vertex Cover with Optimized Initializations Abstract: Our work investigates advanced Quantum Approximate Optimization Algorithm (QAOA) strategies for the Minimum Vertex Cover (MVC) problem on weighted graphs, emphasizing constraint-preserving mixers and their performance against traditional penalty-based approaches. We analyze both the standard constraint-preserving mixer […]

  • Communication and Security Track November Meeting

    Speaker: Hans Heum Title: Cryptographic Group Actions in a Quantum World Abstract: The Group Action formalism generalizes the familiar discrete-logarithm based hardness assumptions in such a way that post-quantum security can be recovered. In particular, post-quantum group actions have been shown to be instantiable from isogeny-based cryptography, such as CSIDH and more recently PEGASIS. Thus, many useful results from the […]