Reducing quantum resources for observable estimation with window-assisted coherent QPE

• URL: http://arxiv.org/abs/2508.06677v1
• Date: Fri, 08 Aug 2025 20:00:19 GMT
• Title: Reducing quantum resources for observable estimation with window-assisted coherent QPE
• Authors: Harriet Apel, Cristian L. Cortes, Jessica Lemieux, Mark Steudtner,
• Abstract summary: This paper focuses on how windowing a coherent QPE used as a subroutine can improve the accuracy of the overall algorithm.<n>We study the quantum task of estimating observables where window-assisted coherent QPE is used as a subroutine.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Phase Estimation (QPE) routines are known to fail probabilistically even with perfect gates and input states. This effect stems from an incompatibility of finite-sized quantum registers to capture a phase within QPE with phase angles of infinite precision, and the effect extend even beyond what would be reasonably expected from rounding. This effect can be partially mitigated by biasing the phase register with a window, or taper state, from classical signal processing. This paper focuses on how windowing a coherent QPE used as a subroutine can improve the accuracy of the overall algorithm. Specifically we study the quantum task of estimating observables where window-assisted coherent QPE is used as a subroutine to implement a reflection about an eigenstate. Quantum resource estimates show over 2-orders-of-magnitude reduction in Toffoli counts over the previous costed techniques -- also assisted by the use of improved block encoding techniques -- demonstrating an encouraging decrease in resources for quantum computation of molecular observables. Since QPE, as one of only a few quantum building blocks, appears as a subroutine in many algorithms; this analysis also provides a model for understanding how window functions propagate to an improved error in composite algorithms.

Related papers

• Towards Practical Quantum Phase Estimation: A Modular, Scalable, and Adaptive Approach [0.0]
  We introduce the Adaptive Windowed Quantum Phase Estimation (AWQPE) algorithm.<n>AWQPE significantly reduces the number of iterations required to achieve a desired precision.<n>Our numerical simulations demonstrate AWQPE's accuracy and robustness, showcasing a distinct balance between resource efficiency and computational speed.
  arXiv  Detail & Related papers  (2025-07-30T08:06:28Z)
• Post-Variational Ground State Estimation via QPE-Based Quantum Imaginary Time Evolution [0.0]
  We present the QPE-based quantum imaginary time evolution (QPE-QITE) algorithm, designed for post-variational ground state estimation.<n>Unlike variational methods, QPE-QITE employs additional ancillae to project the quantum register into low-energy eigenstates.<n>We demonstrate the capabilities of QPE-QITE by applying it to the low-autocorrelation binary sequences (LABS) problem.
  arXiv  Detail & Related papers  (2025-04-15T18:44:14Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• A case study against QSVT: assessment of quantum phase estimation improved by signal processing techniques [0.0]
  In recent years, quantum algorithms have been proposed which use quantum phase estimation coherently as a subroutine without measurement. We show that the use of the Kaiser window function is currently the most practical choice for realizing QPE with high success probability.
  arXiv  Detail & Related papers  (2024-04-01T18:08:10Z)
• On the feasibility of performing quantum chemistry calculations on quantum computers [0.0]
  We propose two criteria for evaluating two leading quantum approaches for finding the ground state of molecules. The first criterion applies to the variational quantum eigensolver (VQE) algorithm. The second criterion applies to the quantum phase estimation (QPE) algorithm.
  arXiv  Detail & Related papers  (2023-06-05T06:41:22Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Mitigating algorithmic errors in quantum optimization through energy extrapolation [4.426846282723645]
  We present a scalable extrapolation approach to mitigating a non-negligible error in estimates of the ground state energy. We have verified the validity of these approaches through both numerical simulation and experiments on an IBM quantum computer.
  arXiv  Detail & Related papers  (2021-09-16T17:39:11Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.