Python Robust Phase Estimation (PyRPE)

Antonio Russo, Kennith Rudinger

Published Jan 1, 2020• 0 citations

Abstract

Robust Phase Estimation (RPE) is a quantum algorithm to determine the relative phases of eigenstates of a unitary operator. This code implements the classical portion of the RPE algorithm, useful both in simulation (e.g., Sandia's pyGSTi or IBM's Qiskit simulators) and on actual quantum hardware (e.g., IBM's Qiskit Quantum Experience). It additionally implements improvements in these dependent software packages, for both required core function of the RPE and improved usability. SAND2020-12547 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

DOI: 10.11578/dc.20240807.15

Related papers

Testing the robustness of robust phase estimation

Adam M. Meier, Jan‐Karl Burkhardt, Brian J. McMahon +1 more

The robust phase estimation (RPE) protocol was designed to be an efficient and robust way to calibrate quantum operations. The robustness of RPE refers to its ability to estimate a single parameter, usually gate amplitude, even when other parameters are poorly calibrated or when the gate experiences significant errors. Here we demonstrate the robustness of RPE to errors that affect initialization, measurement, and gates. In each case, the error threshold at which RPE begins to fail matches quantitatively with theoretical bounds. We conclude that RPE is an effective and reliable tool for calibration of one-qubit rotations and that it is particularly useful for automated calibration routines and sensor tasks.

arXiv:1907.11766Physical Review ANov 11, 20199 citations

Few-Shot, Robust Calibration of Single Qubit Gates Using Bayesian Robust Phase Estimation

Travis Hurant, Ke Sun, Zhubing Jia +2 more

Accurate calibration of control parameters in quan-tum gates is crucial for high-fidelity operations, yet it represents a significant time and resource challenge, necessitating periods of downtime for quantum computers. Robust Phase Estimation (RPE) [8] has emerged as a practical and effective calibration technique aimed at tackling this challenge. It combines a provably efficient number of control pulses with a classical post-processing algorithm to estimate the phase accumulated by a quantum gate. We introduce Bayesian Robust Phase Estimation (BRPE), an in-novative approach that integrates Bayesian parameter estimation into the classical post-processing phase to reduce the sampling overhead. Our numerical analysis shows that BRPE markedly reduces phase estimation errors, requiring approximately 50% fewer samples than standard RPE. Specifically, in an ideal, noise-free setting, it achieves up to a 96% reduction in average absolute estimation error for a fixed sample cost of 88 shots when compared to RPE. Under a depolarizing noise model, it attains up to a 47% reduction for a fixed cost of 1 76 shots. Additionally, we adapt BRPE for Ramsey spectroscopy applications and successfully implement it experimentally in a trapped ion system.

arXiv:2407.18339IEEE International Conference on Quantum Computing and Engineering (QCE)Sep 15, 20240 citations

Applications of the Quantum Phase Difference Estimation Algorithm to the Excitation Energies in Spin Systems on a NISQ Device

Paul, Boni, Sudhindu Bikash Mandal, Kenji Sugisaki +1 more

The Quantum Phase Difference Estimation (QPDE) algorithm, as an extension of the Quantum Phase Estimation (QPE), is a quantum algorithm designed to compute the differences of two eigenvalues of a unitary operator by exploiting the quantum superposition of two eigenstates. Unlike QPE, QPDE is free of controlled-unitary operations, and is suitable for calculations on noisy intermediate-scale quantum (NISQ) devices. We present the implementation and verification of a novel early fault-tolerant QPDE algorithm for determining energy gaps across diverse spin system configurations using NISQ devices. The algorithm is applied to the systems described by two and three-spin Heisenberg Hamiltonians with different geometric arrangements and coupling strengths, including symmetric, asymmetric, spin-frustrated, and non-frustrated configurations. By leveraging the match gate-like structure of the time evolution operator of Heisenberg Hamiltonian, we achieve constant-depth quantum circuits suitable for NISQ hardware implementation. Our results on IBM quantum processors show remarkable accuracy ranging from 85\% to 93\%, demonstrating excellent agreement with classical calculations even in the presence of hardware noise. The methodology incorporates sophisticated quantum noise suppression techniques, including Pauli Twirling and Dynamical Decoupling, and employs an adaptive framework. Our findings demonstrate the practical viability of the QPDE algorithm for quantum many-body simulations on current NISQ hardware, establishing a robust framework for future applications.

arXiv:2502.19809Feb 27, 20250 citations

An Improved Implementation Approach for Quantum Phase Estimation on Quantum Computers

Hamed Mohammadbagherpoor, Young-Hyun Oh, Patrick Dreher +3 more

Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. The QPE algorithm has been combined with Kitaev's algorithm and the inverse quantum Fourier transform (IQFT) which are utilized as a fundamental component of such quantum algorithms. In this paper, we explore the computational challenges of implementing QPE algorithms on noisy intermediate-scale quantum (NISQ) machines using the IBM Q Experience (e.g., the IBMQX4, 5-qubit quantum computing hardware platform). Our experimental results indicate that the accuracy of finding the phase using these QPE algorithms is severely constrained by the NISQ computer's physical characteristics such as coherence time and error rates. To mitigate these physical limitations, we propose implementing a modified solution by reducing the number of controlled rotation gates and phase shift operations, thereby increasing the accuracy of the finding phase in near-term quantum computers.

arXiv:1910.11696IEEE International Conference on Rebooting Computing (ICRC)Nov 1, 201951 citations

Numerical Analysis of Robust Phase Estimation

Kenneth Rudinger, Shelby Kimmel

SNL), Shelby Kimmel (QuICS) SAND2016-1639C Main question  You want to characterize single-qubit operations: G x (α), G y (ε), θ=arccos(XY)  Desire self-consistently, efficiently (Heisenberg-limited accuracy)). There are (at least!) two good options:  Robust Phase Estimation (RPE)  Gate Set Tomography (GST) When should you use RPE and when should you use GST?

Bulletin of the American Physical SocietyMar 15, 20160 citations

Control Free Quantum Phase Estimation for Efficient Eigenphase and Energy Estimation without Quantum Fourier Transform

Yalla Jnan Devi Satya Prasad

Quantum phase estimation (QPE) is fundamental to quantum algorithms for eigenvalue problems, chemistry simulation, and number-theoretic applications. However, canonical QPE implementations employ controlled unitary operations and quantum Fourier transform, incurring substantial circuit depth and control overhead that severely limit applicability on nearterm quantum hardware. This work develops a novel class of control-free phase estimation algorithms that eliminate both controlled unitaries and QFT by leveraging signal processing principles. Our approach applies uncontrolled powers of the unitary U = e −iHτ to an eigenstate or eigenstate-rich state, measures in multiple bases to capture interference patterns, and reconstructs eigenphases via classical post-processing techniques including Prony's method, compressed sensing, and harmonic inversion. We establish that for eigenstates or states with sparse eigendecomposition, our algorithms achieve phase estimation precision ϵ using Õ(1/ϵ) applications of U , matching standard QPE query complexity up to logarithmic factors while dramatically reducing circuit depth and eliminating control overhead. We provide detailed error analysis characterizing robustness to measurement noise, finite sampling, and state preparation errors. Applications to electronic structure estimation in small molecules and variational quantum eigensolvers demonstrate the practical viability of control-free QPE on both NISQ and early fault-tolerant quantum computers. Our results suggest that signal-processing-based phase estimation may offer more efficient implementations of quantum algorithms on realistic hardware.

Feb 5, 20260 citations