Circuit connectivity boosts by quantum-classical-quantum interfaces

Abstract

High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. As main technical tool, we introduce quantum-classical-quantum interfaces. These replace an experimentally problematic gate (e.g. a long-range one) by single-qubit random measurements followed by state-preparations sampled according to a classical quasi-probability simulation of the noiseless gate. Each interface introduces a multiplicative statistical overhead which is remarkably independent of the on-chip qubit distance. Hence, by applying interfaces to the longest range gates in a target circuit, significant reductions in circuit depth and gate infidelity can be attained. We numerically show the efficacy of our method for a Bell-state circuit for two increasingly distant qubits and a variational ground-state solver for the transverse-field Ising model on a ring. Our findings provide a versatile toolbox for error-mitigation and circuit boosts tailored for noisy, intermediate-scale quantum computation.

References in corpus (8)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Frame representations of quantum mechanics and the necessity of negativity in quasi-probability representations
• The Random Walk Metropolis: Linking Theory and Practice Through a Case Study
• Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation