Towards Practical Quantum Phase Estimation: A Modular, Scalable, and Adaptive Approach

• URL: http://arxiv.org/abs/2507.22460v1
• Date: Wed, 30 Jul 2025 08:06:28 GMT
• Title: Towards Practical Quantum Phase Estimation: A Modular, Scalable, and Adaptive Approach
• Authors: Alok Shukla, Prakash Vedula,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Phase Estimation (QPE) is a cornerstone algorithm in quantum computing, with applications ranging from integer factorization to quantum chemistry simulations. However, the resource demands of standard QPE, which require a large number of coherent qubits and deep circuits, pose significant challenges for current Noisy Intermediate Scale Quantum (NISQ) devices. In this work, we introduce the Adaptive Windowed Quantum Phase Estimation (AWQPE) algorithm, a novel method designed to address the limitations of standard QPE. AWQPE utilizes small, independent blocks of $m > 1$ control qubits to estimate multiple phase bits simultaneously within a "window,'' thereby significantly reducing the number of iterations required to achieve a desired precision. These independent blocks are amenable to parallelization and, when combined with a robust least-significant-bit (LSB) to most-significant-bit (MSB) ambiguity resolution mechanism, enhance the algorithm's accuracy while mitigating the risk of error propagation. Our numerical simulations demonstrate AWQPE's accuracy and robustness, showcasing a distinct balance between resource efficiency and computational speed. This makes AWQPE particularly well-suited for near-term quantum platforms.

Related papers

• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• 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)
• 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)
• Efficient Classical Computation of Single-Qubit Marginal Measurement Probabilities to Simulate Certain Classes of Quantum Algorithms [0.0]
  We introduce a novel CNOT "functional" that leverages neural networks to generate unitary transformations.<n>For random circuit simulations, our modified QC-DFT enables efficient computation of single-qubit marginal measurement probabilities.
  arXiv  Detail & Related papers  (2024-11-11T09:30:33Z)
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation [0.0]
  This paper proposes a hybrid quantum-classical algorithm for compiling the time-evolution operator. It achieves a 95% reduction in circuit depth compared to Trotterization while maintaining accuracy. We estimate the gate count needed to execute the quantum simulations using the LSVQC on near-term quantum computing architectures.
  arXiv  Detail & Related papers  (2024-07-19T09:50:01Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Quantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm [1.439946676159516]
  In this work, we investigate the verification of ReLU networks, which involves solving a robustness many-variable mixed-integer programs (MIPs) To alleviate this issue, we propose to use QC for neural network verification and introduce a hybrid quantum procedure to compute provable certificates. We show that, in a simulated environment, our certificate is sound, and provide bounds on the minimum number of qubits necessary to approximate the problem.
  arXiv  Detail & Related papers  (2022-05-02T13:23:56Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• 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)
• Minimizing estimation runtime on noisy quantum computers [0.0]
  "engineered likelihood function" (ELF) is used for carrying out Bayesian inference. We show how the ELF formalism enhances the rate of information gain in sampling as the physical hardware transitions from the regime of noisy quantum computers. This technique speeds up a central component of many quantum algorithms, with applications including chemistry, materials, finance, and beyond.
  arXiv  Detail & Related papers  (2020-06-16T17:46:18Z)

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.