Division of Applied Mathematics

Distributed Quantum Computing Via Circuit Cutting

Near-term quantum computers are inherently noisy. One obvious approach is to decrease the size of the (logical) quantum circuit, which is naturally less prone to error as it uses fewer physical qubits and/or can allocate more resources to error correction. In this talk, I will survey the idea of circuit cutting---dividing a large quantum circuit into smaller, reliably-executable fragments, then classically combining measurement outcomes. Circuit cutting can be generically applied to any quantum circuit at hefty computational costs. To circumvent this, I will demonstrate a few attempts at using randomized algorithms to work towards scalable quantum circuit cutting.