Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits
arXiv:2209.05648 · doi:10.1088/2058-9565/accbe6
Abstract
Quantum annealing is a type of analog computation that aims to use quantum mechanical fluctuations in search of optimal solutions of QUBO (quadratic unconstrained binary optimization) or, equivalently, Ising problems. Since NP-hard problems can in general be mapped to Ising and QUBO formulations, the quantum annealing paradigm has the potential to help solve various NP-hard problems. Current quantum annealers, such as those manufactured by D-Wave Systems, Inc., have various practical limitations including the size (number of qubits) of the problem that can be solved, the qubit connectivity, and error due to the environment or system calibration, which can reduce the quality of the solutions. Typically, for an arbitrary problem instance, the corresponding QUBO (or Ising) structure will not natively embed onto the available qubit architecture on the quantum chip. Thus, in these cases, a minor embedding of the problem structure onto the device is necessary. However, minor embeddings on these devices do not always make use of the full sparse chip hardware graph, and a large portion of the available qubits stay unused during quantum annealing. In this work, we embed a disjoint random QUBO on the unused parts of the chip alongside the QUBO to be solved, which acts as an indicator of the solution quality of the device over time. Using experiments on three different D-Wave quantum annealers, we demonstrate that (i) long term trends in solution quality exist on the D-Wave device, and (ii) the unused qubits can be used to measure the current level of noise of the quantum system.
References in corpus (41)
- Quantum Computing in the NISQ era and beyond
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- Quantum Error Correction for Beginners
- Quantum Annealing and Analog Quantum Computation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Perspectives of quantum annealing: Methods and implementations
- Mathematical Foundation of Quantum Annealing
- Quantum Error Correction: An Introductory Guide
- Quantum Annealing for Industry Applications: Introduction and Review
- What is the Computational Value of Finite Range Tunneling?
- A practical heuristic for finding graph minors
- Efficient learning of quantum noise
- Error corrected quantum annealing with hundreds of qubits
- Entanglement in a quantum annealing processor
- Qiskit Pulse: Programming Quantum Computers Through the Cloud with Pulses
- State-of-the-Art in Sequential Change-Point Detection
- Bounding quantum gate error rate based on reported average fidelity
- Reverse annealing for the fully connected -spin model
- Quantum annealing correction for random Ising problems
- Quantum Annealing Correction with Minor Embedding
- Detecting and tracking drift in quantum information processors
- Pegasus: The second connectivity graph for large-scale quantum annealing hardware
- Simultaneous execution of quantum circuits on current and near-future NISQ systems
- Benchmarking Hamiltonian Noise in the D-Wave Quantum Annealer
- Global warming: Temperature estimation in annealers
- Parallel Quantum Annealing
- Enabling Multi-programming Mechanism for Quantum Computing in the NISQ Era
- Nested Quantum Annealing Correction
- Solving large Maximum Clique problems on a quantum annealer
- Mean Field Analysis of Quantum Annealing Correction
- Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing
- Comparing relaxation mechanisms in quantum and classical transverse-field annealing
- Quantum Circuit Engineering for Correcting Coherent Noise
- Accelerating the variational quantum eigensolver using parallelism
- Stability of noisy quantum computing devices
- Quantum Annealing Algorithms for Boolean Tensor Networks
- Fast clique minor generation in Chimera qubit connectivity graphs
- A proposal of noise suppression for quantum annealing
- Efficient Noise Mitigation Technique for Quantum Computing
- Analog Errors in Quantum Annealing: Doom and Hope
Cited by in corpus (5)
- Probing Quantum Telecloning on Superconducting Quantum Processors
- Analysis of a Programmable Quantum Annealer as a Random Number Generator
- Posiform Planting: Generating QUBO Instances for Benchmarking
- Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking
- Boltzmann Sampling of Frustrated J1 - J2 Ising Models with Programmable Quantum Annealers