Curve-Fitted QPE: Extending Quantum Phase Estimation Results for a Higher Precision using Classical Post-Processing

• URL: http://arxiv.org/abs/2409.15752v1
• Date: Tue, 24 Sep 2024 05:15:35 GMT
• Title: Curve-Fitted QPE: Extending Quantum Phase Estimation Results for a Higher Precision using Classical Post-Processing
• Authors: S. M. Lim, C. E. Susa, R. Cohen,
• Abstract summary: We present a hybrid quantum-classical approach that consists of the standard QPE circuit and classical post-processing using curve-fitting. We show that our approach achieves high precision with optimal Cram'er-Rao lower bound performance and is comparable in error resolution with the Variational Quantum Eigensolver and Maximum Likelihood Amplitude Estimation algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Phase Estimation is a crucial component of several front-running quantum algorithms. Improving the efficiency and accuracy of QPE is currently a very active field of research. In this work, we present a hybrid quantum-classical approach that consists of the standard QPE circuit and classical post-processing using curve-fitting, where special attention is given to the latter. We show that our approach achieves high precision with optimal Cram\'er-Rao lower bound performance and is comparable in error resolution with the Variational Quantum Eigensolver and Maximum Likelihood Amplitude Estimation algorithms. Our method could potentially be further extended to the case of estimating multiple phases.

Related papers

• 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. Unlike variational methods, QPE-QITE employs additional ancillae to project the quantum register into low-energy eigenstates. 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)
• Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms [4.525216077859531]
  We introduce a new framework for optimizing parameterized quantum circuits (PQCs) that employs a classical, inspired by Model-Agnostic Meta-Learning (MAML) technique. Our framework features a classical neural network, called Learner, which interacts with a PQC using the output of Learner as an initial parameter. In the adaptation phase, the framework requires only a few PQC updates to converge to a more accurate value, while the learner remains unchanged.
  arXiv  Detail & Related papers  (2025-01-10T12:07:00Z)
• A Parameter-Efficient Quantum Anomaly Detection Method on a Superconducting Quantum Processor [0.0]
  We propose a novel quantum machine learning method, called. the-Efficient Quantum Anomaly Detection (PEQAD), for practical image anomaly detection. PEQAD aims to achieve both parameter efficiency and superior accuracy compared to classical models. We demonstrate the first implementation of a quantum anomaly detection method for general image datasets on a superconducting quantum processor.
  arXiv  Detail & Related papers  (2024-12-22T05:36:51Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• 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)
• Compressed-sensing Lindbladian quantum tomography with trapped ions [44.99833362998488]
  Characterizing the dynamics of quantum systems is a central task for the development of quantum information processors. We propose two different improvements of Lindbladian quantum tomography (LQT) that alleviate previous shortcomings.
  arXiv  Detail & Related papers  (2024-03-12T09:58:37Z)
• Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
  In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
  arXiv  Detail & Related papers  (2023-11-06T18:53:50Z)
• Variational Quantum Approximate Spectral Clustering for Binary Clustering Problems [0.7550566004119158]
  We introduce the Variational Quantum Approximate Spectral Clustering (VQASC) algorithm. VQASC requires optimization of fewer parameters than the system size, N, traditionally required in classical problems. We present numerical results from both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2023-09-08T17:54:42Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• 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)
• Identification of topological phases using classically-optimized variational quantum eigensolver [0.6181093777643575]
  Variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithm for quantum computers. We propose classically-optimized VQE (co-VQE), where the whole process of the optimization is efficiently conducted on a classical computer. In co-VQE, we only use quantum computers to measure nonlocal quantities after the parameters are optimized.
  arXiv  Detail & Related papers  (2022-02-07T02:26:58Z)
• Efficient Classical Computation of Quantum Mean Values for Shallow QAOA Circuits [15.279642278652654]
  We present a novel graph decomposition based classical algorithm that scales linearly with the number of qubits for the shallow QAOA circuits. Our results are not only important for the exploration of quantum advantages with QAOA, but also useful for the benchmarking of NISQ processors.
  arXiv  Detail & Related papers  (2021-12-21T12:41:31Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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.