• 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 […]

  • 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 […]

  • Novel methods for quantum information processing

    In this talk I present a way to transfer methods from signal processing, like the short-time Fourier transform or the wavelet transform and the respective reconstruction formulae, to the quantum setting. This approach works for discrete variables and continuous variables quantum systems. The focus is going to be on the operator short-time Fourier transform and the polarized Cohen’s class of an operator. This is joint work with Monika Doerfler, Henry McNulty and Eirik Skrettingland.

  • A Novel Mathematical Formulation of Density Functional Theory

    In this talk, I present my recent work with Simen Kvaal, where we developed a novel mathematical framework for density functional theory (DFT), the “gold standard method” used in large-scale many-particle quantum chemistry calculations. I present some preliminary results, where we address some open mathematical questions in DFT using our framework. 

  • Encoding Combinatorial Problems with Integer Variables into Qubits

    Speaker:Franz G. Fuchs Title: Encoding Combinatorial Problems with Integer Variables into Qubits: An application to the MAX k-CUT  problem Abstract: The weighted MAX k-CUT problem involves partitioning a weighted undirected graph into k subsets, or colors, to maximize the sum of the weights of edges between vertices in different subsets. This problem has significant applications […]