Adaptive Genetic Algorithms for Pulse-Level Quantum Error Mitigation
- URL: http://arxiv.org/abs/2501.14007v1
- Date: Thu, 23 Jan 2025 15:28:22 GMT
- Title: Adaptive Genetic Algorithms for Pulse-Level Quantum Error Mitigation
- Authors: William Aguilar-Calvo, Santiago Núñez-Corrales,
- Abstract summary: Noise remains a fundamental challenge in quantum computing, significantly affecting pulse fidelity and overall circuit performance.
This paper introduces an adaptive algorithm for pulse-level quantum error mitigation, designed to enhance fidelity by dynamically responding to noise conditions without modifying circuit gates.
- Score: 0.0
- License:
- Abstract: Noise remains a fundamental challenge in quantum computing, significantly affecting pulse fidelity and overall circuit performance. This paper introduces an adaptive algorithm for pulse-level quantum error mitigation, designed to enhance fidelity by dynamically responding to noise conditions without modifying circuit gates. By targeting pulse parameters directly, this method reduces the impact of various noise sources, improving algorithm resilience in quantum circuits. We show the latter by applying our protocol to Grover's and Deutsch-Jozsa algorithms. Experimental results show that this pulse-level strategy provides a flexible and efficient solution for increasing fidelity during the noisy execution of quantum circuits. Our work contributes to advancements in error mitigation techniques, essential for robust quantum computing.
Related papers
- Optimal Quantum Purity Amplification [2.05170973574812]
Quantum purity amplification (QPA) offers a novel approach to counteract the pervasive noise that degrades quantum states.
We present the optimal QPA protocol for general quantum systems against global depolarizing noise.
Our findings suggest that QPA could improve the performance of quantum information processing tasks.
arXiv Detail & Related papers (2024-09-26T17:46:00Z) - 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) - Layering and subpool exploration for adaptive Variational Quantum
Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise [0.0]
Adaptive variational quantum eigensolvers (ADAPT-VQEs) are promising candidates for simulations of strongly correlated systems.
Recent efforts have been directed towards compactifying, or layering, their ansatz circuits.
We show that layering leads to an improved noise resilience with respect to amplitude-damping and dephasing noise.
arXiv Detail & Related papers (2023-08-22T18:00:02Z) - Hybrid Gate-Pulse Model for Variational Quantum Algorithms [33.73469431747376]
Current quantum programs are mostly compiled on the gate-level, where quantum circuits are composed of quantum gates.
pulse-level optimization has gained more attention from researchers due to their advantages in terms of circuit duration.
We present a hybrid gate-pulse model that can mitigate these problems.
arXiv Detail & Related papers (2022-12-01T17:06:35Z) - Pulse-efficient quantum machine learning [0.0]
We investigate the impact of pulse-efficient circuits on quantum machine learning algorithms.
We find that pulse-efficient transpilation vastly reduces average circuit durations.
We conclude by applying pulse-efficient transpilation to the Hamiltonian Variational Ansatz and show that it delays the onset of noise-induced barren plateaus.
arXiv Detail & Related papers (2022-11-02T18:00:01Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - 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) - Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
We introduce new tools in qutip-qip, QuTiP's quantum information processing package.
These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features.
We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
arXiv Detail & Related papers (2021-05-20T17:06:52Z) - Universal Dephasing Noise Injection via Schrodinger Wave Autoregressive
Moving Average Models [0.619788266425984]
We present and validate a novel method for noise injection of arbitrary spectra in quantum circuits.
This method can be applied to any system capable of executing arbitrary single qubit rotations, including cloud-based quantum processors.
arXiv Detail & Related papers (2021-02-05T19:00:08Z) - 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)
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.