Table 1 Comparison of the graph representation capabilities of various EGC and QGC approaches

EGC (Euclidean)

Nanowire network

Incapable

Fully capable

No

Limited

N

^8,10,11

Thermal interaction

Incapable

Partially capable

No

Limited

N²

¹⁸

EGC (Non-Euclidean)

Shorted diagonal CBA (metal)

Incapable

Fully capable

Partially capable

All-to-all

N²

¹⁴

Shorted diagonal CBA (memristor)

Fully capable

Fully capable

Yes

All-to-all

N²

¹⁷

Cross-wired CBA

Fully capable

Fully capable

Partially capable

All-to-all

N²

¹⁵

Multi-CBA (probabilistic graph)

Incapable

Fully capable

Partially capable

All-to-all

N²

²¹

QGC

Probabilistic computing

Fully capable

Fully capable

Yes

All-to-all

N

^{26,27,28,29,30,31,32,33,34,35,36,37,38,39}

ONN (Electrical impedance)

Fully capable

Incapable

No

Limited

N²

^48,49,50,51

ONN (Acoustic and magnetic)

Partially capable

Fully capable

No

Limited

N

⁵⁴

HNN

Fully capable

Fully capable

Yes

All-to-all

N²

^56,57,58