Split a weighted graph into two groups to maximize the total weight of edges between them (network partitioning, clustering, circuit layout)
regular-3-weighted-20
20 qubits
100%0.01 cr · 20 h ago
regular-3-weighted-18
18 qubits
weighted-petersen-10
10 qubits
complete-graph-8
8 qubits
ring-6-with-chord
6 qubits
noise-model-ring-6
6 qubits · depth 32 · 28 two-qubit gates
100%Fidelity 98.0% · kept 100%0.01 cr · 20 h ago
hardware-petersen-10
10 qubits · depth 38 · 60 two-qubit gates
100%Fidelity 78.6% · kept 100%IBM Fez5.46 cr · 12 h ago
hardware-ring-6
100%Fidelity 98.1% · kept 100%IBM Fez5.46 cr · 12 h ago