• Corpus ID: 245650588

Noise-aware qubit assignment on NISQ hardware using simulated annealing and Loschmidt Echoes

  title={Noise-aware qubit assignment on NISQ hardware using simulated annealing and Loschmidt Echoes},
  author={Evan Peters and Prasanth Shyamsundar and Andy C. Y. Li and Gabriel N. Perdue},
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… 
1 Citations
Vehicle Routing Problems Based on Harris Hawks Optimization
The Harris hawks optimization (HHO) algorithm was used to attempt to solve the vehicle routing problem and revealed that the HHO had a strong ability to check for and find the best route as compared to other metaheuristic algorithms, namely, simulated annealing and artificial bee colony optimization.


A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
Evaluation results on IBM quantum hardware show that the proposed hardware-aware (HA) mapping transition algorithm can outperform the state of the art, both in terms of the number of additional gates and circuit fidelity.
Not All Qubits Are Created Equal: A Case for Variability-Aware Policies for NISQ-Era Quantum Computers
This paper proposes Variation-Aware Qubit Movement (VQM), policies that optimize the movement and allocation of qubits to avoid the weaker qubits and links, and guide more operations towards the stronger qu bits and links.
Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search
The experimental results on extensive realistic circuits confirm that the proposed method is efficient and the number of added gates of the algorithm is, on average, only 57% of that of state-of-the-art algorithms on IBM Q20 (Tokyo), the most recent IBM quantum device.
Randomized Benchmarking of Quantum Gates
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate
Qubit Allocation for Noisy Intermediate-Scale Quantum Computers
In the era of noisy-intermediate-scale quantum computers, we expect to see quantum devices with increasing numbers of qubits emerge in the foreseeable future. To practically run quantum programs,
Extracting Success from IBM’s 20-Qubit Machines Using Error-Aware Compilation
This work begins by establishing a metric for choosing among possible paths and circuit alternatives for executing gates between variables placed far apart within the processor, and finds that a single-number metric describing the fidelity of individual gates is a useful but imperfect guide.
Noise tailoring for scalable quantum computation via randomized compiling
This work proposes a method for introducing independent random single-qubit gates into the logical circuit in such a way that the effective logical circuit remains unchanged and proves that this randomization tailors the noise into stochastic Pauli errors, which can dramatically reduce error rates while introducing little or no experimental overhead.
A blueprint for demonstrating quantum supremacy with superconducting qubits
Nine superconducting qubits are used to demonstrate a promising path toward quantum supremacy and the scaling of errors and output with the number of qubits is explored in a five- to nine-qubit device.
Impact of qubit connectivity on quantum algorithm performance
This work maps and schedule representative algorithmic workloads - the Quantum Fourier Transform relevant to factoring, the Grover diffusion operator relevant to quantum search, and Jordan-Wigner parity rotations relevant to simulations of quantum chemistry and materials science - to qubit arrays with varying connectivity and investigates the impact of restricting the ideal all-to-all connectivity to a square grid, a ladder and a linear array of qubits.
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
It is shown that fine grained spatial and temporal variations in hardware parameters can be exploited to obtain an average 2.9x (and up to 18x) improvement in program success rate over the industry standard IBM Qiskit compiler.