Fig. 5: Compilation overhead of Case I. | npj Quantum Information

Fig. 5: Compilation overhead of Case I.

From: Compilation and scaling strategies for a silicon quantum processor with sparse two-dimensional connectivity

Fig. 5

This is expressed via a average and b maximum shortest path as a function of the number of qubits for different layouts—a (1D) linear layout, a (2D) rectangular device with nearest neighbor connectivity with lx = ly and the proposed architecture in a square arrangement dx = dy with m = 4, 8, and 16. Lines indicate the scaling and dots indicate qubit numbers which can be realized by an actual device.

Back to article page