A Bounded-error Quantum Polynomial Time Algorithm for Two Graph Bisection Problems · HackerPapers discussions

A Bounded-error Quantum Polynomial Time Algorithm for Two Graph Bisection Problems — mentioned by sanxiyn

Wed, 22 Jul 2015 13:22:09 GMT

Sure. May 2015 paper is http://arxiv.org/abs/1505.06284, as easily found by reading the paper. (It is reference 13.) As for "but this somehow completely failed to make waves in the community", I think "but life is too short to give my full attention to a dubious paper for more than 15 minutes" is an enough explanation.

Paper and discussion history. A mention is not an endorsement.

A Bounded-error Quantum Polynomial Time Algorithm for Two Graph Bisection Problems — mentioned by yk

Wed, 22 Jul 2015 13:21:43 GMT

I think he means this one: http://arxiv.org/abs/1505.06284

Paper and discussion history. A mention is not an endorsement.

A Bounded-error Quantum Polynomial Time Algorithm for Two Graph Bisection Problems — mentioned by danbruc

Wed, 22 Jul 2015 12:36:43 GMT

1. The presented construction is pretty simple and falls in the category of computing the output for all possible inputs in parallel and then extract the correct or best input. 2. This is exactly the type of construction that is often(?) believed not to work, i.e. even on a quantum computer you have to exploit the structure of the problem and can not just throw quantum parallelism at the problem. 3. They already published a paper in May [1] in which they applied the same techniques to graph partitioning problems. 4. Which option is true? The algorithm is wrong, the believe that quantum…

Paper and discussion history. A mention is not an endorsement.