Papers
Topics
Authors
Recent
Search
2000 character limit reached

Certifying localizable quantum properties with constant sample complexity

Published 22 Sep 2025 in quant-ph | (2509.17580v1)

Abstract: Characterizing increasingly complex quantum systems is a central task in quantum information science, yet experimental costs often scale prohibitively with system size. Certifying key properties -- such as entanglement, circuit complexity, and quantum magic -- using simple local measurements is highly desirable but challenging. In this work, we introduce a highly general certification framework based on a physical phenomenon that we call localizable quantumness: for generic many-body states, essential quantum properties are robustly preserved within the projected ensembles on small subsystems after performing local projective measurements on the rest of the system. Leveraging this insight, we develop certification protocols that certify global properties by witnessing them on a small, accessible subsystem. Our method dramatically reduces experimental cost by relying solely on local Pauli measurements, while achieving constant sample complexity, constant-level noise robustness, and soundness for mixed states -- exponentially improving the sample complexity and overcoming major limitations of previous methods. We further present a random-basis variant to certify state fidelity, with numerical evidence strongly suggesting it maintains constant sample complexity and robustness for generic states, representing a substantial improvement over existing methods. Our results provide a practical, scalable toolkit for certifying large-scale quantum processors and offer a novel lens for understanding complex many-body quantum systems.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.