A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1505.06284 / rank | |||
Normal rank | |||
Revision as of 17:33, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bounded-error quantum polynomial-time algorithm for two graph bisection problems |
scientific article |
Statements
A bounded-error quantum polynomial-time algorithm for two graph bisection problems (English)
0 references
19 October 2015
0 references
quantum algorithm
0 references
graph bisection
0 references
MAX-bisection
0 references
MIN-bisection
0 references
amplitude amplification
0 references
BQP
0 references
NP-hard
0 references
