Qubit assignment using time reversal
arXiv:2201.00445 · doi:10.1103/PRXQuantum.3.040333
Abstract
As the number of qubits available on noisy quantum computers grows, it will become necessary to efficiently select a subset of physical qubits to use in a quantum computation. For any given quantum program and device there are many ways to assign physical qubits for execution of the program, and assignments will differ in performance due to the variability in quality across qubits and entangling operations on a single device. Evaluating the performance of each assignment using fidelity estimation introduces significant experimental overhead and will be infeasible for many applications, while relying on standard device benchmarks provides incomplete information about the performance of any specific program. Furthermore, the number of possible assignments grows combinatorially in the number of qubits on the device and in the program, motivating the use of heuristic optimization techniques. We approach this problem using simulated annealing with a cost function based on the Loschmidt Echo, a diagnostic that measures the reversibility of a quantum process. We provide theoretical justification for this choice of cost function by demonstrating that the optimal qubit assignment coincides with the optimal qubit assignment based on state fidelity in the weak error limit, and we provide experimental justification using diagnostics performed on Google's superconducting qubit devices. We then establish the performance of simulated annealing for qubit assignment using classical simulations of noisy devices as well as optimization experiments performed on a quantum processor. Our results demonstrate that the use of Loschmidt Echoes and simulated annealing provides a scalable and flexible approach to optimizing qubit assignment on near-term hardware.
arXiv comment27 pages, 12 figures
References in corpus (50)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Dynamical Decoupling of Open Quantum Systems
- Improved Simulation of Stabilizer Circuits
- Error mitigation for short-depth quantum circuits
- Characterizing Quantum Supremacy in Near-Term Devices
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Randomized Benchmarking of Quantum Gates
- Extending the computational reach of a noisy superconducting quantum processor
- Robust randomized benchmarking of quantum processes
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Efficient variational quantum simulator incorporating active error minimisation
- Noise tailoring for scalable quantum computation via randomized compiling
- Scalable Noise Estimation with Random Unitary Operators
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Direct Fidelity Estimation from Few Pauli Measurements
- Characterizing Quantum Gates via Randomized Benchmarking
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Generation of Three-Qubit Entangled States using Superconducting Phase Qubits
- Exponential suppression of bit or phase flip errors with repetitive error correction
- Quantum-assisted quantum compiling
- Mitigating measurement errors in multi-qubit experiments
- Realization of an Error-Correcting Surface Code with Superconducting Qubits
- Practical characterization of quantum devices without tomography
- Information Scrambling in Computationally Complex Quantum Circuits
- Scalable mitigation of measurement errors on quantum computers
- Efficient learning of quantum noise
- Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
- Measuring the Capabilities of Quantum Computers
- Toolbox for entanglement detection and fidelity estimation
- Quantum computation with universal error mitigation on superconducting quantum processor
- Characterization of a two-transmon processor with individual single-shot qubit readout
- Removing leakage-induced correlated errors in superconducting quantum error correction
- Quantum Circuit Placement
- Optimal Layout Synthesis for Quantum Computing
- A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
- Calibrated decoders for experimental quantum error correction
- Extracting Success from IBM's 20-Qubit Machines Using Error-Aware Compilation
- Scalable randomized benchmarking of quantum computers using mirror circuits
- Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search
- Accurately computing electronic properties of a quantum ring
- Probing context-dependent errors in quantum processors
- Impact of qubit connectivity on quantum algorithm performance
- Full-Stack, Real-System Quantum Computer Studies: Architectural Comparisons and Design Insights
- Benchmarking near-term quantum computers via random circuit sampling
- Averaged circuit eigenvalue sampling
- Qubit Allocation for Noisy Intermediate-Scale Quantum Computers
- On the learnability of quantum neural networks
- Qubit assignment using time reversal