Space-time tradeoff in networked virtual distillation

In contrast to monolithic devices, modular, networked quantum architectures are based on interconnecting smaller quantum hardware nodes using quantum communication links, and offer a promising approach to scalability. Virtual distillation (VD) is a technique that can, under ideal conditions, suppress errors exponentially as the number of quantum state copies increases. However, additional gate operations required for VD introduce further errors, which may limit its practical effectiveness. In this work, we analyse three practical implementations of VD that correspond to edge cases that maximise space-time tradeoffs. Specifically, we consider an implementation that minimises the number of qubits but introduces significantly deeper quantum circuits, and contrast it with implementations that parallelise the preparation of copies using additional qubits, including a constant-depth implementation. We rigorously characterise their circuit depth and gate count requirements, and develop explicit architectures for implementing them in networked quantum systems – while also detailing implementations in early fault-tolerant quantum architectures. We numerically compare the performance of the three implementations under realistic noise characteristics of networked ion trap systems and conclude the following. Firstly, VD effectively suppresses errors even for very noisy states. Secondly, the constant-depth implementation consistently outperforms the implementation that minimises the number of qubits. Finally, the approach is highly robust to errors in remote entangling operations, with noise in local gates being the main limiting factor to its performance.

💡 Research Summary

This paper investigates the practical deployment of Virtual Distillation (VD) – a powerful error‑mitigation technique that can suppress incoherent noise exponentially with the number of state copies – within modular, networked quantum architectures. The authors focus on three concrete implementations that occupy opposite corners of the space‑time trade‑off spectrum: (i) a qubit‑efficient serial approach that reuses a minimal number of physical qubits but incurs a deep circuit due to repeated preparation, resetting, and sequential C‑SWAP operations; (ii) a parallel approach that allocates additional qubits to prepare all copies simultaneously, thereby reducing circuit depth at the cost of roughly doubling the qubit count; and (iii) a constant‑depth implementation that leverages GHZ‑type entanglement across the network so that the depth remains independent of the number of copies, again requiring extra qubits but achieving the shallowest possible circuit.

The authors first review the theoretical basis of VD: by preparing n noisy copies of a state ρ, applying a controlled “derangement” operator Dₙ, and measuring an ancilla in the X‑basis, one obtains an estimator of Tr