Enhanced Precision in Entangled Quantum Clocks with Phase Estimation Algorithm

• URL: http://arxiv.org/abs/2604.06606v1
• Date: Wed, 08 Apr 2026 02:39:46 GMT
• Title: Enhanced Precision in Entangled Quantum Clocks with Phase Estimation Algorithm
• Abstract summary: We present an enhanced entangled quantum clock protocol that incorporates a quantum phase estimation algorithm.<n>By employing highly entangled multi-clock states, the achievable uncertainty scales inversely with the total number of quantum clocks, surpassing the standard projection-noise limit.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: We present an enhanced entangled quantum clock protocol that incorporates a quantum phase estimation algorithm to directly estimate proper-time differences as an unknown phase. By employing highly entangled multi-clock states, the achievable uncertainty scales inversely with the total number of quantum clocks, surpassing the standard projection-noise limit. This approach extends the original EQC framework and provides a systematic method for high-precision relativistic time comparison.

Related papers

• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approach [36.05085942729295]
  This paper introduces a Quantum Natural Policy Gradient (QNPG) algorithm, which replaces the random sampling used in classicalNPG estimators with a deterministic gradient estimation approach.<n>The proposed QNPG algorithm achieves a sample complexity of $tildemathcalO(epsilon-1.5)$ for queries to the quantum oracle, significantly improving the classical lower bound of $tildemathcalO(epsilon-2)$ for queries to the Markov Decision Process (MDP)
  arXiv  Detail & Related papers  (2025-01-27T17:38:30Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Curve-Fitted QPE: Extending Quantum Phase Estimation Results for a Higher Precision using Classical Post-Processing [0.0]
  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.
  arXiv  Detail & Related papers  (2024-09-24T05:15:35Z)
• Optimal Low-Depth Quantum Signal-Processing Phase Estimation [0.029541734875307393]
  Quantum effects like entanglement can be used to drastically enhance the accuracy of quantum parameter estimation beyond classical limits.<n>We introduce Quantum Signal-Processing Phase Estimation algorithms that are robust against these challenges.<n>Our approach achieves a standard deviation accuracy of $10-4$ radians for estimating unwanted swap angles in superconducting two-qubit experiments.
  arXiv  Detail & Related papers  (2024-06-17T10:33:52Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Lindblad-like quantum tomography for non-Markovian quantum dynamical maps [46.350147604946095]
  We introduce Lindblad-like quantum tomography (L$ell$QT) as a quantum characterization technique of time-correlated noise in quantum information processors.<n>We discuss L$ell$QT for the dephasing dynamics of single qubits in detail, which allows for a neat understanding of the importance of including multiple snapshots of the quantum evolution in the likelihood function.
  arXiv  Detail & Related papers  (2024-03-28T19:29:12Z)
• An Iterative Method to Improve the Precision of Quantum Phase Estimation Algorithm [0.0]
  We devise an iterative method to improve the precision of QPE with propagators over a variety of time spans. Our work provides a feasible and promising means toward precise estimations of eigenvalue on noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2024-02-22T00:33:08Z)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• Multistate Transition Dynamics by Strong Time-Dependent Perturbation in NISQ era [0.0]
  We develop a quantum computing scheme utilizing McLachlan variational principle in a hybrid quantum-classical algorithm. Results for transition probabilities are obtained with accuracy better than 1%, as established by comparison to the benchmark data.
  arXiv  Detail & Related papers  (2021-12-13T00:49:15Z)
• 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)
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing [0.0]
  We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup. We argue for continued exploration and interest in the QA framework on the basis that improved coherence times and control capabilities will enable the near-term exploration of several quantum optimization algorithms. We argue that all of these protocols can be explored in a state-of-the-art manner by embracing the full range of novel out-of-equilibrium quantum dynamics generated by time-dependent effective transverse-field Ising Hamiltonians.
  arXiv  Detail & Related papers  (2020-08-22T21:25:51Z)

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.