Superposed Quantum Error Mitigation

• URL: http://arxiv.org/abs/2304.08528v2
• Date: Mon, 15 Jan 2024 17:39:32 GMT
• Title: Superposed Quantum Error Mitigation
• Authors: Jorge Miguel-Ramiro, Zheng Shi, Luca Dellantonio, Albie Chan, Christine A. Muschik and Wolfgang D\"ur
• Abstract summary: Overcoming the influence of noise and imperfections is a major challenge in quantum computing. We present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary states. We demonstrate, numerically and on the IBM Quantum Platform, that parallel applications of the same operation lead to significant noise mitigation.
• Score: 1.732837834702512
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Overcoming the influence of noise and imperfections is a major challenge in quantum computing. Here, we present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary states. We demonstrate, numerically and on the IBM Quantum Platform, that parallel applications of the same operation lead to significant noise mitigation when arbitrary noise processes are considered. We first design probabilistic implementations of our scheme that are plug and play, independent of the noise characteristic and require no postprocessing. We then enhance the success probability (up to deterministic) using adaptive corrections. We provide an analysis of our protocol performance and demonstrate that unit fidelity can be achieved asymptotically. Our approaches are suitable to both standard gate-based and measurement-based computational models.

Related papers

• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Volumetric Benchmarking of Quantum Computing Noise Models [3.0098885383612104]
  We present a systematic approach to benchmark noise models for quantum computing applications. It compares the results of hardware experiments to predictions of noise models for a representative set of quantum circuits. We also construct a noise model and optimize its parameters with a series of training circuits.
  arXiv  Detail & Related papers  (2023-06-14T10:49:01Z)
• Enhancing Quantum Computation via Superposition of Quantum Gates [1.732837834702512]
  We present different protocols, which we denote as "superposed quantum error mitigation" We show that significant noise suppression can be achieved for most kinds of decoherence and standard experimental parameter regimes. We analyze our approach for gate-based, measurement-based and interferometric-based models.
  arXiv  Detail & Related papers  (2023-04-17T18:01:05Z)
• Adaptive quantum error mitigation using pulse-based inverse evolutions [0.0]
  We introduce a QEM method termed Adaptive KIK' that adapts to the noise level of the target device. The implementation of the method is experimentally simple -- it does not involve any tomographic information or machine-learning stage. We demonstrate our findings in the IBM quantum computers and through numerical simulations.
  arXiv  Detail & Related papers  (2023-03-09T02:50:53Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise [59.47042225257565]
  We present a novel planning method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states. We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
  arXiv  Detail & Related papers  (2021-10-25T06:18:55Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm [0.0]
  Noise mitigation can be performed up to some error for which we derive upper bounds. Experiments on 15 (23) qubits using IBM's devices to test both the noise model and the error-mitigation scheme. We show that similar effects are expected for Haar-random quantum states and states generated by shallow-depth random circuits.
  arXiv  Detail & Related papers  (2021-01-07T02:19:58Z)
• 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)
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis [0.0]
  We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models. We apply our methods to ansatz circuits that appear in the Variational Quantum Eigensolver.
  arXiv  Detail & Related papers  (2020-08-27T16:46:12Z)

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.