Problem with the definition of the Max-Cut Problem #4358
Description
URL to the relevant tutorial
https://quantum.cloud.ibm.com/docs/en/tutorials/quantum-approximate-optimization-algorithm
Select all that apply
- new content request
- typo
- code bug
- out-of-date content
- broken link
- other
Describe the fix or the content request.
In the initial "Background" section of the tutorial at https://quantum.cloud.ibm.com/docs/en/tutorials/quantum-approximate-optimization-algorithm, the Max-Cut problem is introduced as follows:
This tutorial considers a graph of nodes connected by edges, and aims to partition it into separate graphs such that they are both as large as possible.
I find this definition very confusing: what does it mean with "as large as possible"? The size of a graph is the number of its edges, but the Max-Cut problem does not amount to split a graph into separate graphs with the maximum number of edges. The same holds if we define "as large as possible" as "with the highest number of nodes". This definition in indeed rather unusual with respect to other sources.
Furthermore, it should be specifed that the goal is to partition the graph into two separate graphs.
After that sentence, the tutorial states that
Put another way, the goal of this problem is to partition the nodes of a graph into two sets such that the number of edges traversed by this cut is maximized.
This is, instead, rather clear to me. My suggestion is to simply eliminate the first quoted sentence, leaving the second as the defitinition.
For new content requests - if the request is accepted, do you want to write the content?
I will write (or already have written) a draft of the proposed content
Metadata
Metadata
Type
Projects
Status