Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks

Abstract

Quantum compilation is the problem of translating an input quantum circuit into the most efficient equivalent of itself, taking into account the characteristics of the device that will execute the computation. Compilation strategies are composed of sequential passes that perform placement, routing and optimization tasks. Noise-adaptive compilers do take the noise statistics of the device into account, for some or all passes. The noise statics can be obtained from calibration data, and updated after each device calibration. In this paper, we propose a novel noise-adaptive compilation strategy that is computationally efficient. The proposed strategy assumes that the quantum device coupling map uses a heavy-hexagon lattice. Moreover, we present the application-motivated benchmarking of the proposed noise-adaptive compilation strategy, compared with some of the most advanced state-of-art approaches. The presented results seem to indicate that our compilation strategy is particularly effective for deep circuits and for square circuits.

References in corpus (15)

• Characterizing Quantum Supremacy in Near-Term Devices
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Towards a Distributed Quantum Computing Ecosystem
• Local and Distributed Quantum Computation
• Challenges and Opportunities of Near-Term Quantum Computing Systems
• Topological and subsystem codes on low-degree graphs with flag qubits
• Instantaneous Quantum Computation
• Compiler Design for Distributed Quantum Computing
• Phase Gadget Synthesis for Shallow Circuits
• A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
• A volumetric framework for quantum computer benchmarks
• Extracting Success from IBM's 20-Qubit Machines Using Error-Aware Compilation
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns

Cited by in corpus (2)

• A Modular Quantum Compilation Framework for Distributed Quantum Computing
• Optimized compiler for Distributed Quantum Computing