Applying the Quantum Alternating Operator Ansatz to the Graph Matching Problem

by   Sagnik Chatterjee, et al.

The Quantum Alternating Operator Ansatz (QAOA+) framework has recently gained attention due to its ability to solve discrete optimization problems on noisy intermediate-scale quantum (NISQ) devices in a manner that is amenable to derivation of worst-case guarantees. We design a technique in this framework to tackle a few problems over maximal matchings in graphs. Even though maximum matching is polynomial-time solvable, most counting and sampling versions are #P-hard. We design a few algorithms that generates superpositions over matchings allowing us to sample from them. In particular, we get a superposition over all possible matchings when given the empty state as input and a superposition over all maximal matchings when given the W -states as input. Our main result is that the expected size of the matchings corresponding to the output states of our QAOA+ algorithm when ran on a 2-regular graph is greater than the expected matching size obtained from a uniform distribution over all matchings. This algorithm uses a W -state as input and we prove that this input state is better compared to using the empty matching as the input state.



page 9


Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering

We show polynomial-time quantum algorithms for the following problems: ...

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width

In this paper, we provide polynomial-time algorithms for different exten...

Minimum maximal matchings in cubic graphs

We prove that every connected cubic graph with n vertices has a maximal ...

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms

We present a simple randomized reduction from fully-dynamic integral mat...

Counting single-qubit Clifford equivalent graph states is #P-Complete

Graph states, which include for example Bell states, GHZ states and clus...

The average size of maximal matchings in graphs

We investigate the ratio I(G) of the average size of a maximal matching ...

Classical computation of quantum guesswork

The guesswork quantifies the minimum number of queries needed to guess t...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.