Certifying localizable quantum properties with constant sample complexity

• URL: http://arxiv.org/abs/2509.17580v1
• Date: Mon, 22 Sep 2025 11:06:20 GMT
• Title: Certifying localizable quantum properties with constant sample complexity
• Authors: Zhenyu Du, Jinchang Liu, Elias X. Huber, Zi-Wen Liu, Xiongfeng Ma,
• Abstract summary: We introduce a highly general certification framework based on a physical phenomenon that we call localizable quantumness.<n>We develop certification protocols that certify global properties by witnessing them on a small, accessible subsystem.<n>Our method dramatically reduces experimental cost by relying solely on local Pauli measurements.
• Score: 1.5334952984692285
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Hybrid of Gradient Descent And Semidefinite Programming for Certifying Multipartite Entanglement Structure [7.236334007028333]
  Multipartite entanglement is a crucial resource for a wide range of quantum information processing tasks.<n>We develop an efficient algorithm that combines semidefinite programming with a descent gradient method.<n>Our method improves entanglement detection and provides deeper insights into the complex structures of many-body quantum systems.
  arXiv  Detail & Related papers  (2024-12-21T04:20:44Z)
• An efficient quantum state verification framework and its application to bosonic systems [0.0]
  We introduce a general framework for the efficient verification of large quantum systems. Our framework combines robust fidelity witnesses with efficient classical post-processing to implement measurement back-propagation.
  arXiv  Detail & Related papers  (2024-11-07T13:19:22Z)
• High-dimentional Multipartite Entanglement Structure Detection with Low Cost [18.876952671920133]
  We propose a neural network model to generate representations suitable for entanglement structure detection. Our method achieves over 95% detection accuracy for up to 19 qubits systems.
  arXiv  Detail & Related papers  (2024-08-23T12:09:26Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Enhanced Entanglement in the Measurement-Altered Quantum Ising Chain [43.80709028066351]
  Local quantum measurements do not simply disentangle degrees of freedom, but may actually strengthen the entanglement in the system.<n>This paper explores how a finite density of local measurement modifies a given state's entanglement structure.
  arXiv  Detail & Related papers  (2023-10-04T09:51:00Z)
• Measuring Arbitrary Physical Properties in Analog Quantum Simulation [0.5999777817331317]
  A central challenge in analog quantum simulation is to characterize desirable physical properties of quantum states produced in experiments. We propose and analyze a scalable protocol that leverages the ergodic nature of generic quantum dynamics. Our protocol excitingly promises to overcome limited controllability and, thus, enhance the versatility and utility of near-term quantum technologies.
  arXiv  Detail & Related papers  (2022-12-05T19:00:01Z)
• High-dimensional entanglement certification: bounding relative entropy of entanglement in $2d+1$ experiment-friendly measurements [77.34726150561087]
  Entanglement -- the coherent correlations between parties in a quantum system -- is well-understood and quantifiable. Despite the utility of such systems, methods for quantifying high-dimensional entanglement are more limited and experimentally challenging. We present a novel certification method whose measurement requirements scale linearly with dimension subsystem.
  arXiv  Detail & Related papers  (2022-10-19T16:52:21Z)
• 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)
• The randomized measurement toolbox [3.2095357952052854]
  We review recently developed protocols for probing the properties of complex many-qubit systems. In all these protocols, a quantum state is repeatedly prepared and measured in a randomly chosen basis. We discuss a range of use cases that have already been realized in quantum devices.
  arXiv  Detail & Related papers  (2022-03-21T22:33:18Z)
• Quantum verification and estimation with few copies [63.669642197519934]
  The verification and estimation of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity) and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography.
  arXiv  Detail & Related papers  (2021-09-08T18:20:07Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)

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.