A verifiable quantum advantage towards real world applications: Quantum Echoes 
Learn more
         
       
     
  
  
  
  
  
    
      cirq.pow_pauli_combination
  
      
    
  
  
  
  
  
    
  
  
    
    
Computes non-negative integer power of single-qubit Pauli combination.
cirq.pow_pauli_combination(
    ai: cirq.TParamValComplex,
    ax: cirq.TParamValComplex,
    ay: cirq.TParamValComplex,
    az: cirq.TParamValComplex,
    exponent: int
) -> tuple[cirq.TParamValComplex, cirq.TParamValComplex, cirq.TParamValComplex,
    cirq.TParamValComplex]
Returns scalar coefficients bi, bx, by, bz such that
bi I + bx X + by Y + bz Z = (ai I + ax X + ay Y + az Z)^exponent
Correctness of the formulas below follows from the binomial expansion
and the fact that for any real or complex vector (ax, ay, az) and any
non-negative integer k:
 [ax X + ay Y + az Z]^(2k) = (ax^2 + ay^2 + az^2)^k I
  
  
 
  
    
    
      
    
    
  
       
    
    
  
  
  Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
  Last updated 2025-08-14 UTC.
  
  
  
    
      [[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-08-14 UTC."],[],[]]