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 (34)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Error mitigation for short-depth quantum circuits
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Parameterized quantum circuits as machine learning models
• Quantum algorithms: an overview
• Extending the computational reach of a noisy superconducting quantum processor
• Efficient variational quantum simulator incorporating active error minimisation
• Practical Quantum Error Mitigation for Near-Future Applications
• Positive Wigner functions render classical simulation of quantum computation efficient
• Reconstructing quantum states with generative models
• Trading classical and quantum computational resources
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• A positive tensor network approach for simulating open quantum many-body systems
• Quasi-probability representations of quantum theory with applications to quantum information science
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Efficient variational simulation of non-trivial quantum states
• 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
• Constructing a virtual two-qubit gate by sampling single-qubit operations
• Easing the Monte Carlo sign problem
• Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation
• Quantum Circuit Cutting with Maximum Likelihood Tomography
• On the Computational Complexity of Curing the Sign Problem
• Probabilistic Simulation of Quantum Circuits with the Transformer
• Computational speedups using small quantum devices