20240054375. CIRCUIT REDUCTION FOR EXPONENTIALS OF PAULI OPERATORS simplified abstract (International Business Machines Corporation)

From WikiPatents
Jump to navigation Jump to search

CIRCUIT REDUCTION FOR EXPONENTIALS OF PAULI OPERATORS

Organization Name

International Business Machines Corporation

Inventor(s)

Tanvi Pradeep Gujarati of San Jose CA (US)

Mario Motta of San Jose CA (US)

Julia Elizabeth Rice of Sunnyvale CA (US)

Nam Hoang Nguyen of Anaheim CA (US)

CIRCUIT REDUCTION FOR EXPONENTIALS OF PAULI OPERATORS - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240054375 titled 'CIRCUIT REDUCTION FOR EXPONENTIALS OF PAULI OPERATORS

Simplified Explanation

The abstract describes systems, computer-implemented methods, and/or computer program products that facilitate the reduction of a quantum circuit. The method involves decomposing exponential of a first Pauli operator into 1 to n Pauli operators of the quantum circuit and performing a first Clifford transformation of a primary operator of the quantum circuit, which is a linear combination of primary Pauli operators.

  • Decomposition of exponential of a first Pauli operator into 1 to n Pauli operators of the quantum circuit
  • Performing a first Clifford transformation of a primary operator of the quantum circuit
  • Iteratively decomposing all exponentials of the 1 to n Pauli operators until completion

---

      1. Potential Applications
  • Quantum computing
  • Quantum information processing
  • Quantum algorithm development
      1. Problems Solved
  • Reduction of quantum circuits
  • Efficient quantum circuit optimization
  • Simplification of quantum operations
      1. Benefits
  • Improved efficiency in quantum computing
  • Reduction of computational resources needed
  • Enhanced performance of quantum algorithms


Original Abstract Submitted

systems, computer-implemented methods, and/or computer program products to facilitate reduction of a quantum circuit are provided. a computer-implemented method can comprise performing, by a system operatively coupled to at least one processor, decomposition of an exponential of a first pauli operator of 1 to n pauli operators of the quantum circuit, and performing, by the system, a first clifford transformation of a primary operator of the quantum circuit, where the primary operator can comprise a linear combination of primary pauli operators, and where the first clifford transformation can employ a result of the decomposition. performing the decomposition can comprise decomposing the exponential of the first pauli operator into a first non-clifford operator and a first clifford operator, with the first clifford operator being employed for the first clifford transformation. additional decompositions and respective transformations can be performed iteratively until decomposition of all exponentials of the 1 to n pauli operators.