Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques

Abstract

To execute quantum circuits on a quantum processor, they must be modified to meet the physical constraints of the quantum device. This process, called quantum circuit mapping, results in a gate/circuit depth overhead that depends on both the circuit properties and the hardware constraints, being the limited qubit connectivity a crucial restriction. In this paper, we propose to extend the characterization of quantum circuits by including qubit interaction graph properties using graph theory-based metrics in addition to previously used circuit-describing parameters. This approach allows for in-depth analysis and clustering of quantum circuits and a comparison of performance when run on different quantum processors, aiding in developing better mapping techniques. Our study reveals a correlation between interaction graph-based parameters and mapping performance metrics for various existing configurations of quantum devices. We also provide a comprehensive collection of quantum circuits and algorithms for benchmarking future compilation techniques and quantum devices.

References in corpus (4)

• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures
• Mapping quantum circuits to modular architectures with QUBO
• 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms

Cited by in corpus (11)

• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future Directions
• Networked Quantum Services
• SpinQ: Compilation strategies for scalable spin-qubit architectures
• A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• beSnake: A routing algorithm for scalable spin-qubit architectures
• Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity
• Improving Figures of Merit for Quantum Circuit Compilation
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• Compilation Techniques for Spin Qubits in a Shuttling Bus Architecture