REVIEW 9 cited by
Quantum Computing Enhanced Sensing
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Quantum computing and quantum sensing represent two distinct frontiers of quantum information science. In this work, we harness quantum computing to solve a fundamental and practically important sensing problem: the detection of weak oscillating fields with unknown strength and frequency. We present a quantum computing enhanced sensing protocol that outperforms all existing approaches. Furthermore, we prove our approach is optimal by establishing the Grover-Heisenberg limit -- a fundamental lower bound on the minimum sensing time. The key idea is to robustly digitize the continuous, analog signal into a discrete operation, which is then integrated into a quantum algorithm. Our metrological gain originates from quantum computation, distinguishing our protocol from conventional sensing approaches. Indeed, we prove that broad classes of protocols based on quantum Fisher information, finite-lifetime quantum memory, or classical signal processing are strictly less powerful. Our protocol is compatible with multiple experimental platforms. We propose and analyze a proof-of-principle experiment using nitrogen-vacancy centers, where meaningful improvements are achievable using current technology. This work establishes quantum computation as a powerful new resource for advancing sensing capabilities.
Forward citations
Cited by 9 Pith papers
-
High-rate qLDPC processors
Non-abelian "mitten" qLDPC codes achieve 20% encoding rate with distances 10-24 on 150-975 qubits, and simulations indicate fault-tolerant processors sustaining ~10^10 logical operations at 0.1% physical error rate.
-
Measurement incompatibility in Bayesian multiparameter quantum estimation
Measurement incompatibility at most doubles the minimum mean-square loss in Bayesian multiparameter quantum estimation, relative to the symmetric-posterior-mean bound.
-
Dual-use quantum hardware for quantum resource generation and energy storage
Quantum resource generation and quantum battery charging can be achieved with the same protocols, enabling integrated dual-use hardware on superconducting circuits.
-
Simple broadband signal detection at the fundamental limit
Broadband AC-field detection at the Grover-like limit can be achieved by a single analog experiment using a randomized SSH control Hamiltonian and a GHZ probe, with the lower bound derived from an integrated-quantum-F...
-
Extending the dynamic range in quantum frequency estimation with sequential weak measurements
Sequential weak measurements followed by a final projective measurement extend the dynamic range of coherent-spin-state frequency estimation and asymptotically saturate the noiseless quantum Fisher information bound.
-
Remote entanglement need not be the bottleneck for modular trapped-ion quantum computing
A projected architecture for trapped-ion quantum modules combines single-photon heralding, integrated photonics, recoil correction, and one distillation round to deliver 99.9%-fidelity remote Bell pairs at 10^5 s^-1 cm^-2.
-
Data-Driven Learnability Transition of Measurement-Induced Entanglement
A transformer trained only on measurement outcomes estimates measurement-induced entanglement with polynomial resources below a critical circuit depth; above it the estimate saturates at maximal uncertainty — a learna...
-
Exact and Fixed-Point Grover Search with Qudits
A hardware-oriented framework implements standard, deterministic, and fixed-point Grover search on homogeneous and heterogeneous qudit registers via explicit oracles, diffusion operators, and phase matching.
-
The vast world of quantum advantage
Assuming quantum computers are strictly more powerful than classical ones, the problem of deciding whether a given quantum circuit beats a specific classical simulation heuristic is solvable by quantum computers but n...
Discussion (0). Continue with ORCID to comment.