Minimum quantum run-time characterization and calibration via restless measurements with dynamic repetition rates

• URL: http://arxiv.org/abs/2202.06981v2
• Date: Mon, 15 Aug 2022 11:18:58 GMT
• Title: Minimum quantum run-time characterization and calibration via restless measurements with dynamic repetition rates
• Authors: Caroline Tornow, Naoki Kanazawa, William E. Shanks, Daniel J. Egger
• Abstract summary: We show restless measurements with a dynamic repetition rate that speed-up calibration and characterization tasks. We also present a methodology to perform restless quantum process tomography that mitigates restless state preparation errors.
• Score: 0.716879432974126
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The performance of a quantum processor depends on the characteristics of the device and the quality of the control pulses. Characterizing cloud-based quantum computers and calibrating the pulses that control them is necessary for high-fidelity operations. However, this time intensive task eats into the availability of the device. Here, we show restless measurements with a dynamic repetition rate that speed-up calibration and characterization tasks. Randomized benchmarking is performed 5.3 times faster on the quantum device than when an active reset is used and without discarding any data. In addition, we calibrate a qubit with parameter scans and error-amplifying gate sequences and show speed-ups of up to a factor of forty on the quantum device over active reset. Finally, we present a methodology to perform restless quantum process tomography that mitigates restless state preparation errors. These results reduce the footprint of characterization and calibration tasks. Quantum computers can thus either spend more time running applications or run calibrations more often to maintain gate fidelity.

Related papers

• System Characterization of Dispersive Readout in Superconducting Qubits [37.940693612514984]
  We introduce a single protocol to measure the dispersive shift, resonator linewidth, and drive power used in the dispersive readout of superconducting qubits. We find that the resonator linewidth is poorly controlled with a factor of 2 between the maximum and minimum measured values. We also introduce a protocol for measuring the readout system efficiency using the same power levels as are used in typical qubit readout.
  arXiv  Detail & Related papers  (2024-02-01T08:15:16Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Optimal Qubit Reuse for Near-Term Quantum Computers [0.18188255328029254]
  Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse. We introduce a formal model for qubit reuse optimization that delivers provably optimal solutions. We show improvements in the number of qubits and swap gate insertions, estimated success probability, and Hellinger fidelity of the investigated quantum circuits.
  arXiv  Detail & Related papers  (2023-07-31T23:15:45Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Fast Quantum Calibration using Bayesian Optimization with State Parameter Estimator for Non-Markovian Environment [11.710177724383954]
  We propose a real-time optimal estimator of qubit states, which utilizes weak measurements and Bayesian optimization to find the optimal control pulses for gate design. Our numerical results demonstrate a significant reduction in the calibration process, obtaining a high gate fidelity.
  arXiv  Detail & Related papers  (2022-05-25T17:31:15Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• High-speed calibration and characterization of superconducting quantum processors without qubit reset [0.0]
  Active qubit reset increases the speed at which data can be gathered but requires additional hardware and/or calibration. In this case, the outcome of a first measurement serves as the initial state for the next experiment. We show how to efficiently analyze restless measurements and correct distortions to achieve an identical outcome and accuracy as compared to measurements in which the superconducting qubits are reset.
  arXiv  Detail & Related papers  (2020-10-13T17:50:09Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Variationally Scheduled Quantum Simulation [0.0]
  We investigate a variational method for determining the optimal scheduling procedure within the context of adiabatic state preparation. In the absence of quantum error correction, running a quantum device for any meaningful amount of time causes a system to become susceptible to the loss of relevant information. Our variational method is found to exhibit resilience against control errors, which are commonly encountered within the realm of quantum computing.
  arXiv  Detail & Related papers  (2020-03-22T14:47:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.