Quantum error mitigation by hidden inverses protocol in superconducting
quantum devices
- URL: http://arxiv.org/abs/2204.12407v1
- Date: Tue, 26 Apr 2022 16:05:34 GMT
- Title: Quantum error mitigation by hidden inverses protocol in superconducting
quantum devices
- Authors: Vicente Leyton-Ortega, Swarnadeep Majumder, and Raphael C. Pooser
- Abstract summary: We present a method to improve the convergence of variational algorithms based on hidden inverses to mitigate coherent errors.
This approach improves performance in a variety of two-qubit error models where the noise operator also inverts with the gate inversion.
We apply the mitigation scheme on superconducting quantum processors running the variational quantum eigensolver (VQE) algorithm.
- Score: 0.2867517731896504
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present a method to improve the convergence of variational algorithms
based on hidden inverses to mitigate coherent errors. In the context of error
mitigation, this means replacing the on hardware implementation of certain
Hermitian gates with their inverses. Doing so results in noise cancellation and
a more resilient quantum circuit. This approach improves performance in a
variety of two-qubit error models where the noise operator also inverts with
the gate inversion. We apply the mitigation scheme on superconducting quantum
processors running the variational quantum eigensolver (VQE) algorithm to find
the H$_{\rm 2}$ ground-state energy. When implemented on superconducting
hardware we find that the mitigation scheme effectively reduces the energy
fluctuations in the parameter learning path in VQE, reducing the number of
iterations for a converged value. We also provide a detailed numerical
simulation of VQE performance under different noise models and explore how
hidden inverses \& randomized compiling affect the underlying loss landscape of
the learning problem. These simulations help explain our experimental hardware
outcomes, helping to connect lower-level gate performance to
application-specific behavior in contrast to metrics like fidelity which often
do not provide an intuitive insight into observed high-level performance.
Related papers
- Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations.
We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes.
Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
arXiv Detail & Related papers (2023-12-21T17:40:18Z) - 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) - Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation [0.0]
We develop a recipe for mitigating quantum gate errors for variational algorithms using zero-noise extrapolation.
We utilize the fact that gate errors in a physical quantum device are distributed inhomogeneously over different qubits and qubit pairs.
We find that the estimated energy in the variational approach is approximately linear with respect to the circuit error sum.
arXiv Detail & Related papers (2023-07-20T18:00:03Z) - TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser
circuit ans\"atze [0.0]
We introduce an algorithm called TETRIS-ADAPT-VQE, which iteratively builds up variational ans"atze a few operators at a time.
It results in denser but significantly shallower circuits, without increasing the number of CNOT gates or variational parameters.
These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware.
arXiv Detail & Related papers (2022-09-21T18:00:02Z) - The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation
Using Monte Carlo-Based Channel Inversion [84.66087478797475]
Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms.
We consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error.
We show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates.
arXiv Detail & Related papers (2022-01-20T00:05:01Z) - 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) - Freedom of mixer rotation-axis improves performance in the quantum
approximate optimization algorithm [0.0]
Variational quantum algorithms such as the quantum approximate optimization algorithm (QAOA) are attractive candidates for implementation on near-term quantum processors.
We present a modification to QAOA that adds additional variational parameters in the form of freedom of the rotation-axis in the $XY$-plane of the mixer Hamiltonian.
We show that this leads to a drastic performance improvement over standard QAOA at finding solutions to the MAXCUT problem on graphs of up to 7 qubits.
arXiv Detail & Related papers (2021-07-28T02:13:01Z) - Accurate methods for the analysis of strong-drive effects in parametric
gates [94.70553167084388]
We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach.
We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
arXiv Detail & Related papers (2021-07-06T02:02:54Z) - 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) - Characterizing the loss landscape of variational quantum circuits [77.34726150561087]
We introduce a way to compute the Hessian of the loss function of VQCs.
We show how this information can be interpreted and compared to classical neural networks.
arXiv Detail & Related papers (2020-08-06T17:48:12Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z)
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.