Metrologically advantageous states: long-range entanglement and asymmetric error correction

• URL: http://arxiv.org/abs/2512.20426v1
• Date: Tue, 23 Dec 2025 15:10:53 GMT
• Title: Metrologically advantageous states: long-range entanglement and asymmetric error correction
• Authors: Junjie Chen, Rui Luo, Yuxuan Yan, You Zhou, Xiongfeng Ma,
• Abstract summary: We develop a framework that connects metrological performance to long-range entanglement, state-preparation complexity, and quantum error-correction properties.<n>We show that for two broad classes of quantum error-correcting codes, nondegenerate codes and Calderbank-Shor--Steane quantum low-density parity-check codes, a nonconstant code distance precludes super-linear QFI scaling.<n>In particular, we show that states associated with classical low-density parity-check codes, as well as asymmetric toric code states, both having asymmetric logical distances, can achieve Heisenberg-limited scaling.
• Score: 10.298522900896726
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum metrology aims to exploit many-body quantum states to achieve parameter-estimation precision beyond the standard quantum limit. For unitary parameter encoding generated by local Hamiltonians, such enhancement is characterized by superlinear scaling of the quantum Fisher information (QFI) with system size. Despite extensive progress, a systematic understanding of which many-body quantum states can exhibit this scaling has remained elusive. Here, we develop a general framework that connects metrological performance to long-range entanglement, state-preparation complexity, and quantum error-correction properties. We prove that super-linear QFI scaling necessarily requires long-range entanglement by deriving rigorous complexity-dependent upper bounds on the QFI. We further show that, for two broad classes of quantum error-correcting codes, nondegenerate codes and Calderbank--Shor--Steane quantum low-density parity-check codes, a nonconstant code distance precludes super-linear QFI scaling for a wide class of local Hamiltonians, revealing a fundamental incompatibility between metrological sensitivity and protection against local noise. Finally, we identify constructive routes that evade this obstruction by exploiting asymmetric code structures. In particular, we show that states associated with classical low-density parity-check codes, as well as asymmetric toric code states, both having asymmetric logical distances, can achieve Heisenberg-limited scaling. Together, our results establish long-range entanglement and asymmetric error correction as the essential resource underlying quantum metrology and clarify the interplay among state complexity, error correction, and metrological power.

Related papers

• Improving Generalization and Trainability of Quantum Eigensolvers via Graph Neural Encoding [0.5013248430919223]
  Ground state of a many-body Hamiltonian is a central problem across physics, chemistry, and optimization.<n>We propose an end-to-end representation learning framework that combines a graph autoencoder with a classical neural network.<n>We demonstrate improved generalization and trainability, manifested as reduced test error and a significantly milder decay of gradient variance.
  arXiv  Detail & Related papers  (2026-02-23T12:01:14Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Topological control of quantum speed limits [55.2480439325792]
  We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved.<n>We find bounds on quantum speed limit which scales as $sqrt|C|$ in a (dispersionless) topological phase.
  arXiv  Detail & Related papers  (2025-07-21T18:00:07Z)
• 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)
• Disorder-Free Localization for Benchmarking Quantum Computers [0.0]
  We show how a canonical model of Disorder-free localization can be efficiently implemented on gate-based quantum computers. We show that the simultaneous observation of the absence of correlation spreading and tunable entanglement growth to a volume law provides an ideal testbed for benchmarking the capabilities of quantum computers.
  arXiv  Detail & Related papers  (2024-10-10T18:00:00Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• How Much Entanglement Is Needed for Topological Codes and Mixed States with Anomalous Symmetry? [9.27220088595816]
  We provide quantitative characterizations of entanglement necessary for emergent anyons and fermions.<n>For systems with emergent fermions, despite that the ground state subspaces could be exponentially huge, we show that the GEM also scales linearly in the system size.<n>Our analysis establishes an intriguing link between quantum anomaly and entanglement.
  arXiv  Detail & Related papers  (2024-05-13T17:47:15Z)
• Error-tolerant quantum convolutional neural networks for symmetry-protected topological phases [0.0]
  Quantum neural networks based on parametrized quantum circuits, measurements and feed-forward can process large amounts of quantum data. We construct quantum convolutional neural networks (QCNNs) that can recognize different symmetry-protected topological phases. We show that the QCNN output is robust against symmetry-breaking errors below a threshold error probability.
  arXiv  Detail & Related papers  (2023-07-07T16:47:02Z)
• Stabilization of symmetry-protected long-range entanglement in stochastic quantum circuits [0.0]
  We consider quantum circuits in one and two dimensions comprising randomly applied unitary gates and local measurements. In the absence of randomness, the protocol generates a symmetry-protected long-range entangled state in a finite-depth circuit. We find two important time scales that we associate with the emergence of certain symmetry generators.
  arXiv  Detail & Related papers  (2023-06-22T16:09:12Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Vulnerability of fault-tolerant topological quantum error correction to quantum deviations in code space [0.0]
  We study the performance of the topological toric code in 2D under the dual influence of noise and quantum deviations.<n>We find two distinct error thresholds that demarcate varying efficacies in error correction.<n>For codes of finite or modest distance $d distances, it is revealed that maintaining the preparation error rate beneath a crossover scale, proportional to $1/log d, allows for the suppression of logical errors.
  arXiv  Detail & Related papers  (2023-01-30T13:12:41Z)
• Symmetric Pruning in Quantum Neural Networks [111.438286016951]
  Quantum neural networks (QNNs) exert the power of modern quantum machines. QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes. We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
  arXiv  Detail & Related papers  (2022-08-30T08:17:55Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.