Augmented fidelities for single qubit gates

• URL: http://arxiv.org/abs/2006.03086v2
• Date: Thu, 12 Nov 2020 17:25:32 GMT
• Title: Augmented fidelities for single qubit gates
• Abstract summary: We analytically (single-qubit) and numerically (two-qubit) show how this average changes if the uniform distribution condition is relaxed. We demonstrate that Pauli channels with different noise rates along the three axes can be faithfully distinguished using these augmented fidelities.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An average gate fidelity is a standard performance metric to quantify deviation between an ideal unitary gate transformation and its realistic experimental implementation. The average is taken with respect to states uniformly distributed over the full Hilbert space. We analytically (single-qubit) and numerically (two-qubit) show how this average changes if the uniform distribution condition is relaxed, replaced by parametrized distributions - polar cap and von Mises-Fisher distributions - and how the resulting fidelities can differentiate certain noise models. In particular, we demonstrate that Pauli channels with different noise rates along the three axes can be faithfully distinguished using these augmented fidelities.

Related papers

• Augmented Inverse Hybrid Weighting: Robust Inference under Deterministic and Random Distribution Shifts [17.842727239557995]
  We introduce a new model that allows non-systematic changes between two population laws after systematic shifts are accounted for.<n>Such residual shift is modeled as random perturbations to the probability space that cannot be represented in a learnable way.<n>Under pure random perturbations, this principle yields Augmented Inverse Distance Weighting (AIDW), which uses regression augmentation and variance-optimal dataset-level pooling.<n>For mixed shifts, we develop Augmented Inverse Hybrid Weighting (AIHW), which interpolates between AIDW and standard augmented importance weighting.
  arXiv  Detail & Related papers  (2026-08-01T15:02:13Z)
• Markov Chain Monte Carlo with Diffusion Paths [16.16991829228785]
  Sampling from multimodal distributions is a longstanding challenge for local Markov chain Monte Carlo methods.<n>We propose interpolating along the diffusion path, the marginals of a noising diffusion process that carries the target toward a Gaussian.<n>We show that MAD-Path improves global exploration and mode-weight estimation relative to tempering-based MCMC methods and unadjusted diffusion samplers.
  arXiv  Detail & Related papers  (2026-07-13T14:48:19Z)
• Constrained Diffusion Models with Primal-Dual Inference [76.64466170898369]
  We develop constrained diffusion models with primal-dual inference (PDI)<n>PDI infers the optimal primal distribution and its parametrizing dual variable.<n>We evaluate PDI on constrained sampling from a mixture of Gaussians, wireless resource allocation, and portfolio management.
  arXiv  Detail & Related papers  (2026-06-15T18:32:33Z)
• Distributions of Noisy Expectation Values over Sets of Measurement Operators [0.39998518782208786]
  When quantum states are randomly distributed, their expectation values are also randomly distributed.<n>We construct empirical distributions of simulated Haar random quantum circuits with local depolarizing noise.<n>The fit effective model parameters are also shown to vary smoothly and consistently with circuit depth and noise scale.
  arXiv  Detail & Related papers  (2026-04-07T15:05:14Z)
• A Generative Sampler for distributions with possible discrete parameter based on Reversibility [9.349846971147256]
  We propose a unified, target-gradient-free generative sampling framework applicable across diverse state spaces.<n>We minimize the Maximum Mean Discrepancy (MMD) between the joint distributions of forward and backward Markov trajectories.<n> Experiments show that our framework accurately reproduces thermodynamic observables and captures mode-switching behavior across all regimes.
  arXiv  Detail & Related papers  (2026-03-10T06:32:51Z)
• Convergence Rates for Distribution Matching with Sliced Optimal Transport [10.117027375572627]
  We study the slice-matching scheme, an efficient iterative method for distribution matching based on sliced optimal transport.<n>A key challenge is to control along the trajectory the constants in these inequalities.<n>We show that this becomes tractable for Gaussian distributions.
  arXiv  Detail & Related papers  (2026-02-11T09:47:52Z)
• Exceptional points in Gaussian channels: diffusion gauging and drift-governed spectrum [0.0]
  We show that for linear open quantum systems the Liouvillian spectrum is independent of the noise strength.<n>We first make this noise-independence principle precise in continuous time for multimode bosonic Markov semigroups.
  arXiv  Detail & Related papers  (2026-01-22T17:16:06Z)
• Noisy Cyclic Quantum Random Walk [0.0]
  We explore static noise in a discrete quantum random walk over a homogeneous cyclic graph. We control the spectral properties of the noiseless step operator on the unit circle in the complex plane. We observe a transition from super-diffusive to sub-diffusive behavior for uniformly distributed noise.
  arXiv  Detail & Related papers  (2024-11-30T17:02:38Z)
• Theory on Score-Mismatched Diffusion Models and Zero-Shot Conditional Samplers [49.97755400231656]
  We present the first performance guarantee with explicit dimensional general score-mismatched diffusion samplers. We show that score mismatches result in an distributional bias between the target and sampling distributions, proportional to the accumulated mismatch between the target and training distributions. This result can be directly applied to zero-shot conditional samplers for any conditional model, irrespective of measurement noise.
  arXiv  Detail & Related papers  (2024-10-17T16:42:12Z)
• SoftCVI: Contrastive variational inference with self-generated soft labels [2.5398014196797614]
  Variational inference and Markov chain Monte Carlo methods are the predominant tools for this task. We introduce Soft Contrastive Variational Inference (SoftCVI), which allows a family of variational objectives to be derived through a contrastive estimation framework. We find that SoftCVI can be used to form objectives which are stable to train and mass-covering, frequently outperforming inference with other variational approaches.
  arXiv  Detail & Related papers  (2024-07-22T14:54:12Z)
• GLAD: Towards Better Reconstruction with Global and Local Adaptive Diffusion Models for Unsupervised Anomaly Detection [60.78684630040313]
  Diffusion models tend to reconstruct normal counterparts of test images with certain noises added. From the global perspective, the difficulty of reconstructing images with different anomalies is uneven. We propose a global and local adaptive diffusion model (abbreviated to GLAD) for unsupervised anomaly detection.
  arXiv  Detail & Related papers  (2024-06-11T17:27:23Z)
• Collaborative Heterogeneous Causal Inference Beyond Meta-analysis [68.4474531911361]
  We propose a collaborative inverse propensity score estimator for causal inference with heterogeneous data. Our method shows significant improvements over the methods based on meta-analysis when heterogeneity increases.
  arXiv  Detail & Related papers  (2024-04-24T09:04:36Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Flow Away your Differences: Conditional Normalizing Flows as an Improvement to Reweighting [0.0]
  We present an alternative to reweighting techniques for modifying distributions to account for a desired change in an underlying conditional distribution. We employ conditional normalizing flows to learn the full conditional probability distribution. In our examples, this leads to a statistical precision up to three times greater than using reweighting techniques with identical sample sizes for the source and target distributions.
  arXiv  Detail & Related papers  (2023-04-28T16:33:50Z)
• Resampling Base Distributions of Normalizing Flows [0.0]
  We introduce a base distribution for normalizing flows based on learned rejection sampling. We develop suitable learning algorithms using both maximizing the log-likelihood and the optimization of the reverse Kullback-Leibler divergence.
  arXiv  Detail & Related papers  (2021-10-29T14:44:44Z)
• Improving application performance with biased distributions of quantum states [0.0]
  We analyze mixtures of Haar-random pure states with Dirichlet-distributed coefficients. We analytically derive the concentration parameters required to match the mean purity of the Bures and Hilbert--Schmidt distributions. We demonstrate how substituting these Dirichlet-weighted Haar mixtures in place of the Bures and Hilbert--Schmidt distributions results in measurable performance advantages.
  arXiv  Detail & Related papers  (2021-07-15T23:29:10Z)
• GANs with Variational Entropy Regularizers: Applications in Mitigating the Mode-Collapse Issue [95.23775347605923]
  Building on the success of deep learning, Generative Adversarial Networks (GANs) provide a modern approach to learn a probability distribution from observed samples. GANs often suffer from the mode collapse issue where the generator fails to capture all existing modes of the input distribution. We take an information-theoretic approach and maximize a variational lower bound on the entropy of the generated samples to increase their diversity.
  arXiv  Detail & Related papers  (2020-09-24T19:34:37Z)

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.