Fidelity measurement of a multiqubit cluster state with minimal effort

• URL: http://arxiv.org/abs/2107.10386v3
• Date: Sun, 24 Jul 2022 18:55:32 GMT
• Title: Fidelity measurement of a multiqubit cluster state with minimal effort
• Abstract summary: We propose a method for experimentally assessing the fidelity of an important class of entangled states known as cluster states. The proposed method always yields a lower bound of the fidelity with a number of measurement settings scaling only linearly with the system size. The scheme also performs very well for higher-dimensional cluster states, including correctly the majority of experimentally relevant errors.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The size of the Hilbert space for a multiqubit state scales exponentially with the number of constituent qubits. Often this leads to a similar exponential scaling of the experimental resources required to characterize the state. Contrary to this, we propose a physically-motivated method for experimentally assessing the fidelity of an important class of entangled states known as cluster states. The proposed method always yields a lower bound of the fidelity with a number of measurement settings scaling only linearly with the system size, and is tailored to correctly account for the errors most likely to occur in experiments. For one-dimensional cluster states, the constructed fidelity measure is tight to lowest order in the error probability for experimentally realistic noise sources and thus closely matches the true fidelity. Furthermore, it is tight for the majority of higher-order errors, except for a small subset of certain non-local multiqubit errors irrelevant in typical experimental situations. The scheme also performs very well for higher-dimensional cluster states, including correctly the majority of experimentally relevant errors.

Related papers

• Quantifying and Probing Multipartite Entanglement via Minimum Entanglement Drop [2.9273378452263876]
  We propose a multipartite entanglement monotone defined by the minimum entanglement drop.<n>We rigorously prove it is a valid monotone under local operations and classical communication.<n>We derive exact analytical solutions for n-qubit W states under environmental noise.
  arXiv  Detail & Related papers  (2026-06-20T08:38:37Z)
• The Exponential Deviation Induced by Quantum Readout Error Mitigation [10.028952822683252]
  We show that the conventional measurement error mitigation methods will introduce systematic errors that grow exponentially with the increase of qubit number.<n>We demonstrated that the fidelity of large-scale entangled states will be significantly overestimated at presence of the state preparation error.<n>We also showed that the outcome results of prevalent quantum algorithms such as variational quantum eigensolver and time evolution methods severe deviate from the ideal results as the system scale grows.
  arXiv  Detail & Related papers  (2025-10-09T18:00:05Z)
• Robust Self-Testing of Multiqudit Supersinglet Slater States via Constant Number of Binary Measurements [0.0]
  Self-testing is a powerful technique that enables one to deduce the forms of both the quantum state and the measurements involved in a physical experiment based solely on observed correlations.<n>We introduce the first self-testing scheme of a relevant class of multiqudit genuinely entangled states that exploits only a constant number of binary measurements per observer.
  arXiv  Detail & Related papers  (2025-08-21T13:27:20Z)
• Simplest fidelity-estimation method for graph states with depolarizing noise [0.0]
  We show that a single measurement is sufficient if the noise can be modeled as the phase-flip error. We also numerically evaluate our simplest method for noise models interpolating between the phase-flip and depolarizing noises.
  arXiv  Detail & Related papers  (2023-04-21T13:46:41Z)
• Multi-Label Quantification [78.83284164605473]
  Quantification, variously called "labelled prevalence estimation" or "learning to quantify", is the supervised learning task of generating predictors of the relative frequencies of the classes of interest in unsupervised data samples. We propose methods for inferring estimators of class prevalence values that strive to leverage the dependencies among the classes of interest in order to predict their relative frequencies more accurately.
  arXiv  Detail & Related papers  (2022-11-15T11:29:59Z)
• Correcting non-independent and non-identically distributed errors with surface codes [0.8039067099377079]
  We develop and investigate the properties of topological surface codes adapted to a known noise structure by Clifford conjugations. We show that the surface code locally tailored to non-uniform single-qubit noise in conjunction with a scalable matching decoder yields an increase in error thresholds and exponential suppression of sub-threshold failure rates.
  arXiv  Detail & Related papers  (2022-08-03T16:21:44Z)
• Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors [2.3339135709418817]
  Mitigating errors in quantum information processing devices is especially important in the absence of fault tolerance. Here, we use classical shadows and randomized measurements to circumvent the need for coherent access to multiple copies at an exponential cost. We optimize measurement resources under realistic experimental constraints and apply our method to an experiment preparing Greenberger-Horne-Zeilinger (GHZ) state with trapped ions.
  arXiv  Detail & Related papers  (2022-03-14T17:14:56Z)
• Information-Theoretic Generalization Bounds for Iterative Semi-Supervised Learning [81.1071978288003]
  In particular, we seek to understand the behaviour of the em generalization error of iterative SSL algorithms using information-theoretic principles. Our theoretical results suggest that when the class conditional variances are not too large, the upper bound on the generalization error decreases monotonically with the number of iterations, but quickly saturates.
  arXiv  Detail & Related papers  (2021-10-03T05:38:49Z)
• Predicting Unreliable Predictions by Shattering a Neural Network [145.3823991041987]
  Piecewise linear neural networks can be split into subfunctions. Subfunctions have their own activation pattern, domain, and empirical error. Empirical error for the full network can be written as an expectation over subfunctions.
  arXiv  Detail & Related papers  (2021-06-15T18:34:41Z)
• Learning with Gradient Descent and Weakly Convex Losses [14.145079120746614]
  We study the learning performance of gradient descent when the empirical risk is weakly convex. In the case of a two layer neural network, we demonstrate that the empirical risk can satisfy a notion of local weak convexity.
  arXiv  Detail & Related papers  (2021-01-13T09:58:06Z)
• Entanglement purification by counting and locating errors with entangling measurements [62.997667081978825]
  We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
  arXiv  Detail & Related papers  (2020-11-13T19:02:33Z)
• One-Bit Compressed Sensing via One-Shot Hard Thresholding [7.594050968868919]
  A problem of 1-bit compressed sensing is to estimate a sparse signal from a few binary measurements. We present a novel and concise analysis that moves away from the widely used non-constrained notion of width.
  arXiv  Detail & Related papers  (2020-07-07T17:28:03Z)
• Interpolation and Learning with Scale Dependent Kernels [91.41836461193488]
  We study the learning properties of nonparametric ridge-less least squares. We consider the common case of estimators defined by scale dependent kernels.
  arXiv  Detail & Related papers  (2020-06-17T16:43:37Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)

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.