Efficient Verification of Stabilizer Code Subspaces with Local Measurements

• URL: http://arxiv.org/abs/2409.19699v2
• Date: Sat, 07 Dec 2024 11:32:30 GMT
• Title: Efficient Verification of Stabilizer Code Subspaces with Local Measurements
• Abstract summary: We present two efficient verification strategies for general stabilizer code subspaces.<n>New strategies require significantly fewer measurement settings and consume fewer state copies.<n>This work contributes to the first systematic study of efficient verification of stabilizer code subspaces with local measurements.
• Score: 14.494830101269677
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace verification and explore several stabilizer code subspaces of practical significance. First, we present two efficient verification strategies for general stabilizer code subspaces, utilizing measurements of their stabilizer generators and stabilizer groups, respectively. Then, building on the observation that certain tests can be conducted in parallel when the subspace exhibits specific structural properties, we propose a coloring strategy tailored to graph code subspaces and an XZ strategy tailored to Calderbank-Shor-Steane (CSS) code subspaces. Compared to stabilizer-based strategies, these new strategies require significantly fewer measurement settings and consume fewer state copies, approaching near-global optimality. Notably, all the strategies employ a limited number of Pauli measurements, are non-adaptive, and work on mixed states, enabling efficient experimental certification of both logical qubits and logical operations in noisy quantum computers. This work contributes to the first systematic study of efficient verification of stabilizer code subspaces with local measurements.

Related papers

• Controlling False Discovery in Arbitrarily Structured Hypothesis Spaces via Reproducing Kernels [47.16593717985932]
  We introduce a framework that unifies continuous domains, graphs, and hierarchies under a single algorithm through kernel choice alone.<n>We provide two decision rules which we prove to control the False Discovery Rate (FDR)<n>We validate our method on two sources: spatial locations derived from high-dimensional real-world datasets, and a differential gene expression task utilizing protein-protein interaction graphs.
  arXiv  Detail & Related papers  (2026-05-17T17:42:56Z)
• Mixed-register Stabilizer Codes: A Coding-theoretic Perspective [0.0]
  This work considers coding-theoretic constraints on devices constructed from locations which may vary in their local structures.<n>We construct coding-theoretically optimal mixed-register stabilizer codes from sets of codes defined on coprime local-dimensions.
  arXiv  Detail & Related papers  (2026-03-30T14:01:22Z)
• Rethinking Multi-Condition DiTs: Eliminating Redundant Attention via Position-Alignment and Keyword-Scoping [61.459927600301654]
  Multi-condition control is bottlenecked by the conventional concatenate-and-attend'' strategy.<n>Our analysis reveals that much of this cross-modal interaction is spatially or semantically redundant.<n>We propose Position-aligned and Keyword-scoped Attention (PKA), a highly efficient framework designed to eliminate these redundancies.
  arXiv  Detail & Related papers  (2026-02-06T16:39:10Z)
• Unitary fault-tolerant encoding of Pauli states in surface codes [0.8314040122511801]
  We present a unitary, scalable, distance-preserving encoding scheme for preparing Pauli eigenstates in surface codes.<n>Our work bridges the gap between measurement-based and unitary encodings of surface-code states.
  arXiv  Detail & Related papers  (2026-01-08T17:00:25Z)
• CoVeR: Conformal Calibration for Versatile and Reliable Autoregressive Next-Token Prediction [49.09876340754804]
  conformsctextCoVeR is a model-free decoding strategy that balances search efficiency with the need for versatile trajectories.<n>We show that conformsctextCoVeR simultaneously maintains a compact search space and ensures high coverage probability over desirable trajectories.
  arXiv  Detail & Related papers  (2025-09-05T01:07:12Z)
• Beyond Integral-Domain Stabilizer Codes [0.0]
  Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. This work lays out central methods for working with composite dimensional systems, enabling full use of the computational space of some systems.
  arXiv  Detail & Related papers  (2025-01-08T23:58:13Z)
• GHZ-W Genuinely Entangled Subspace Verification with Adaptive Local Measurements [15.550719829709962]
  We develop two adaptive verification strategies, the XZ strategy and the rotation strategy, for the three-qubit GHZ-W GES. We classify the two-dimensional two-qubit subspaces into three distinct types, including unverifiable entangled subspaces.
  arXiv  Detail & Related papers  (2024-12-27T09:07:44Z)
• Stabilizer configuration interaction: Finding molecular subspaces with error detection properties [2.1438108757511958]
  We find the best stabilizer approximations to the true ground states of molecules up to 36 qubits in size. Our work represents a promising step toward designing algorithms for early fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2024-10-28T15:28:15Z)
• Quantum subspace verification for error correction codes [13.856955493134908]
  We introduce a framework of quantum subspace verification, employing the knowledge of quantum error correction code subspaces to reduce the potential measurement budgets. For certain codes like the notable Calderbank-Shor-Steane codes and QLDPC stabilizer codes, the setting number and sample complexity can be significantly reduced. By combining the proposed subspace verification and direct fidelity estimation, we construct a protocol to verify the fidelity of general magic logical states.
  arXiv  Detail & Related papers  (2024-10-16T13:28:33Z)
• A Novel Stabilizer-based Entanglement Distillation Protocol for Qudits [0.016385815610837167]
  Entanglement distillation is pivotal for robust quantum information processing in error-prone environments. A construction based on stabilizer codes offers an effective method for designing such protocols. We present a novel two-copy distillation protocol that maximizes the fidelity increase per iteration for Bell-diagonal states in any prime dimension.
  arXiv  Detail & Related papers  (2024-08-05T11:14:28Z)
• Semi-DETR: Semi-Supervised Object Detection with Detection Transformers [105.45018934087076]
  We analyze the DETR-based framework on semi-supervised object detection (SSOD) We present Semi-DETR, the first transformer-based end-to-end semi-supervised object detector. Our method outperforms all state-of-the-art methods by clear margins.
  arXiv  Detail & Related papers  (2023-07-16T16:32:14Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Stabilization of approximate GHZ state with quasi-local couplings [0.0]
  The main idea is to work out how a previously proposed sequence of two stabilization steps can be applied instead in appropriate (probabilistic) superposition. We examine alternatives to synchronize the superposition using local couplings only, thanks to a chain of "clock" ancillas or to additional levels on the data subsystems.
  arXiv  Detail & Related papers  (2023-06-08T09:39:49Z)
• Near-optimal Policy Identification in Active Reinforcement Learning [84.27592560211909]
  AE-LSVI is a novel variant of the kernelized least-squares value RL (LSVI) algorithm that combines optimism with pessimism for active exploration. We show that AE-LSVI outperforms other algorithms in a variety of environments when robustness to the initial state is required.
  arXiv  Detail & Related papers  (2022-12-19T14:46:57Z)
• Actor-Critic based Improper Reinforcement Learning [61.430513757337486]
  We consider an improper reinforcement learning setting where a learner is given $M$ base controllers for an unknown Markov decision process. We propose two algorithms: (1) a Policy Gradient-based approach; and (2) an algorithm that can switch between a simple Actor-Critic scheme and a Natural Actor-Critic scheme.
  arXiv  Detail & Related papers  (2022-07-19T05:55:02Z)
• Sparsity in Partially Controllable Linear Systems [56.142264865866636]
  We study partially controllable linear dynamical systems specified by an underlying sparsity pattern. Our results characterize those state variables which are irrelevant for optimal control.
  arXiv  Detail & Related papers  (2021-10-12T16:41:47Z)
• On the Stability of Nonlinear Receding Horizon Control: A Geometric Perspective [72.7951562665449]
  widespread adoption of nonlinear Receding Control (RHC) strategies by industry has to more than 30 years. This paper takes the first step towards understanding the role of global geometry in the role of global-based control.
  arXiv  Detail & Related papers  (2021-03-27T22:59:37Z)
• Optimal verification of stabilizer states [0.0]
  We investigate systematically optimal verification of entangled stabilizer states using Pauli measurements. For experimentalists, optimal protocols and protocols with the minimum number of settings are explicitly provided for all equivalent classes of stabilizer states up to seven qubits.
  arXiv  Detail & Related papers  (2020-07-19T16:49:01Z)
• Learning Stabilizing Controllers for Unstable Linear Quadratic Regulators from a Single Trajectory [85.29718245299341]
  We study linear controllers under quadratic costs model also known as linear quadratic regulators (LQR) We present two different semi-definite programs (SDP) which results in a controller that stabilizes all systems within an ellipsoid uncertainty set. We propose an efficient data dependent algorithm -- textsceXploration -- that with high probability quickly identifies a stabilizing controller.
  arXiv  Detail & Related papers  (2020-06-19T08:58:57Z)

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.