Quantum outage probability for time-varying quantum channels

• URL: http://arxiv.org/abs/2108.13701v1
• Date: Tue, 31 Aug 2021 09:29:26 GMT
• Title: Quantum outage probability for time-varying quantum channels
• Authors: Josu Etxezarreta Martinez, Patricio Fuentes, Pedro Crespo and Javier Garcia-Frias
• Abstract summary: Time-varying quantum channels cause degradation of quantum error correction codes. We quantify the impact of time-variation as a function of the relative variation of $T_Q$ around its mean. We conclude that the performance of QECCs is limited in many cases by the inherent fluctuations of their decoherence parameters.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent experimental studies have shown that the relaxation time, $T_1$, and the dephasing time, $T_2$, of superconducting qubits fluctuate considerably over time. Time-varying quantum channel (TVQC) models have been proposed in order to consider the time varying nature of the parameters that define qubit decoherence. This dynamic nature of quantum channels causes a degradation of the performance of quantum error correction codes (QECC) that is portrayed as a flattening of their error rate curves. In this article, we introduce the concepts of quantum outage probability and quantum hashing outage probability as asymptotically achievable error rates by a QECC with quantum rate $R_Q$ operating over a TVQC. We derive closed-form expressions for the family of time-varying amplitude damping channels (TVAD) and study their behaviour for different scenarios. We quantify the impact of time-variation as a function of the relative variation of $T_1$ around its mean. We conclude that the performance of QECCs is limited in many cases by the inherent fluctuations of their decoherence parameters and corroborate that parameter stability is crucial to maintain the excellent performance observed over static quantum channels.

Related papers

• 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)
• Non-Markovian noise sources for quantum error mitigation [0.0]
  We present a non-Markovian model of quantum state evolution and a quantum error mitigation cost function tailored for NISQ devices. Our findings reveal that the cost function for quantum error mitigation increases as the coupling strength between the quantum system and its environment intensifies.
  arXiv  Detail & Related papers  (2023-02-10T05:10:27Z)
• Robustness of Variational Quantum Algorithms against stochastic parameter perturbation [0.0]
  Variational quantum algorithms are tailored to perform within the constraints of current quantum devices. We consider a noise model that reflects realistic gate errors inherent to variational quantum algorithms. We show that certain gate errors have a significantly smaller impact on the coherence of the state, allowing us to reduce the execution time without compromising performance.
  arXiv  Detail & Related papers  (2022-12-30T20:36:29Z)
• Multi-qubit time-varying quantum channels for NISQ-era superconducting quantum processors [0.24466725954625884]
  We study the fluctuations of the relaxation times of multi-qubit quantum processors ibmq_quito, ibmq_belem, ibmq_lima, ibmq_santiago and ibmq_santiago.
  arXiv  Detail & Related papers  (2022-07-14T11:50:37Z)
• Error-mitigated deep-circuit quantum simulation: steady state and relaxation rate problems [4.762232147934851]
  We show that digital quantum simulation of closed quantum systems are robust against the accumulation of Trotter errors. We propose a new error-mitigation technique based on the scaling behavior in the vicinity of the critical point of a quantum phase transition.
  arXiv  Detail & Related papers  (2021-11-18T11:01:45Z)
• 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)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Quantum computed moments correction to variational estimates [0.0]
  We present an approach in which problem complexity is transferred to dynamic quantities computed on the quantum processor. With system dynamics encoded in the moments the burden on the trial-state quantum circuit depth is eased.
  arXiv  Detail & Related papers  (2020-09-28T08:39:05Z)
• 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)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.