Fig. 4: Binary-tree-like approach of linking nodes and possible placement of deterministic CNOTs. | npj Quantum Information

Fig. 4: Binary-tree-like approach of linking nodes and possible placement of deterministic CNOTs.

From: Resource-efficient simulation of noisy quantum circuits and application to network-enabled QRAM optimization

Fig. 4

a The arrows represent heralding signals for the subsequent step, and the dark nodes represent the selected nodes for attempting entanglement at each time step. b Randomly distributed deterministic nodes across the \(\log N\) distribution layers. c Intuitively distributed deterministic nodes with D deterministic distribution layers.

Back to article page