58 citations · 110 across the 4 of their papers we have counts for
5 papers
Bipartitioning of Graph States for Distributed Measurement-Based Quantum Computing
Kjell Fredrik Pettersen, Matthias Heller, Giorgio Sartor +1
Measurement-Based Quantum Computing (MBQC) is inherently well-suited for Distributed Quantum Computing (DQC): once a resource state is prepared and distributed across a network of…
DISPLIB: a library of train dispatching problems
Oddvar Kloster, Bjørnar Luteberget, Carlo Mannino +1
Optimization-based decision support systems have a significant potential to reduce delays, and thus improve efficiency on the railways, by automatically re-routing and re-schedulin…
An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem
Bjørnar Luteberget, Kjell Fredrik Pettersen, Giorgio Sartor +4
Quantum circuits are typically represented by a (ordered) sequence of gates over a set of virtual qubits. During compilation, the virtual qubits of the gates are assigned to the ph…
Constrained mixers for the quantum approximate optimization algorithm
Franz G. Fuchs, Kjetil Olsen Lye, Halvor Møll Nilsen +2
The quantum approximate optimization algorithm/quantum alternating operator ansatz (QAOA) is a heuristic to find approximate solutions of combinatorial optimization problems. Most…
Efficient encoding of the weighted MAX k-CUT on a quantum computer using QAOA
Franz Georg Fuchs, Herman Øie Kolden, Niels Henrik Aase +1
The weighted MAX k-CUT problem consists of finding a k-partition of a given weighted undirected graph G(V,E) such that the sum of the weights of the crossing edges is maximized. Th…