Quantum Error Mitigation for Non-Clifford Gates Using Multi-Type QP Bases
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing quantum error mitigation methods require non-unitary operations or non-optimal compilation strategies, especially for non-Clifford 2-qubit gates, leading to resource inefficiencies and limitations in error reduction.
Innovation Solution
Introduce multi-type QP bases defined by a restricted set of mitigation operations, allowing for efficient error mitigation in quantum circuits using 2-qubit non-Clifford gates without non-unitary operations, and provide a scalable algorithm for constructing these bases.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing quantum error mitigation methods are used for non-Clifford 2-qubit gates, then error mitigation can be achieved, but non-unitary operations or non-optimal compilation strategies are required, leading to resource inefficiencies
Solution Approach 1:
The patent changes the parameter space by introducing multi-type QP bases that combine unitary and non-unitary operations with different properties. By parameterizing the decomposition in terms of operation types and their coefficients, the method achieves error mitigation for non-Clifford gates while maintaining resource efficiency through optimized parameter selection and linear programming.
Solution Approach 2:
The patent creates a composite operational framework by combining multiple types of quantum operations (unitary and non-unitary) into a unified QP decomposition. This composite approach allows the system to leverage the advantages of both operation types—unitary operations for resource efficiency and non-unitary operations for error mitigation—without requiring either alone to solve the full problem.
2Reliability
If non-unitary operations are used for error mitigation, then error reduction is achieved, but the compilation becomes non-optimal and resource utilization decreases
Solution Approach 1:
The patent applies partial action by using non-unitary operations only where necessary in the QP decomposition, rather than universally. By selectively applying different operation types based on the specific error characteristics and circuit requirements, the method achieves sufficient error reduction while minimizing the impact on resource utilization and maintaining near-optimal compilation.
Solution Approach 2:
The method optimizes resource utilization by parameterizing the mix of unitary and non-unitary operations and using linear programming to find the optimal parameter values. This allows the system to adjust the balance between error reduction and resource efficiency dynamically, achieving the minimum necessary use of non-unitary operations for the required error mitigation level.
3Reliability
If quantum error mitigation is applied to circuits with non-Clifford gates, then error mitigation is achieved, but existing methods require non-optimal compilation strategies
Solution Approach 1:
The patent creates a universal QP decomposition framework that handles both Clifford and non-Clifford gates through a unified multi-type basis approach. This universal method eliminates the need for separate compilation strategies for different gate types, providing optimal compilation across all quantum circuits while maintaining error mitigation capabilities through the structured combination of operation types.
Data Source
AI summary
A computer implemented method, for mitigating errors in a quantum circuit comprising at least one occurrence of a quantum logic operation G. The method includes computing a set of coefficients {cp}, associated with a set of basis operations ={Bp}, to obtain a quasi-probability decomposition G0≈ΣpcpBp on the set of basis operations . The quasi-probability decomposition is of a target version of the quantum logic operation G, denoted G0. The set of basis operations {Bp} forms a multi-type basis, constructed from the quantum logic operation G and elements of a set of mitigation operations . The decomposition is computed so as to reach a decomposition target, being based on at least one of a decomposition accuracy target, and a decomposition sampling overhead target. The method includes implementing the quasi-probability decomposition on the quantum processor.