Shadow tomography with noisy readouts

• URL: http://arxiv.org/abs/2310.17328v1
• Date: Thu, 26 Oct 2023 11:47:51 GMT
• Title: Shadow tomography with noisy readouts
• Authors: Hai-Chau Nguyen
• Abstract summary: Shadow tomography is a scalable technique to characterise the quantum state of a quantum computer or quantum simulator. By construction, classical shadows are intrinsically sensitive to readout noise. We show that classical shadows accept much more flexible constructions beyond the standard ones.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Shadow tomography is a scalable technique to characterise the quantum state of a quantum computer or quantum simulator. The protocol is based on the transformation of the outcomes of random measurements into the so-called classical shadows, which can later be transformed into samples of expectation values of the observables of interest. By construction, classical shadows are intrinsically sensitive to readout noise. In fact, the complicated structure of the readout noise due to crosstalk appears to be detrimental to its scalability. We show that classical shadows accept much more flexible constructions beyond the standard ones, which can eventually be made more conformable with readout noise. With this construction, we show that readout errors in classical shadows can be efficiently mitigated by randomly flipping the qubit before, and the classical outcome bit after the measurement, referred to as $X$-twirling. That a single $X$-gate is sufficient for mitigating readout noise for classical shadows is in contrast to Clifford-twirling, where the implementation of random Clifford gates is required.

Related papers

• Real classical shadows [0.0]
  We study the case where $mathcalU$ corresponds to either local or global Clifford gates, and $mathcalW$ consists of real-valued vectors. Our results show that for various situations of interest, this real'' classical shadow protocol improves the sample complexity over the standard scheme.
  arXiv  Detail & Related papers  (2024-10-30T22:15:39Z)
• Bootstrapping Classical Shadows for Neural Quantum State Tomography [0.0]
  We introduce a novel estimator for optimizing the cross-entropy loss function using classical shadows. We show that this loss function can be used to achieve stable reconstruction of GHZ states using a transformer-based neural network trained on classical shadow measurements.
  arXiv  Detail & Related papers  (2024-05-11T01:38:47Z)
• Stability of classical shadows under gate-dependent noise [0.4997673761305335]
  In realistic practice, it is crucial to understand the behavior of shadow estimators under noise bases. We identify average noise channels that affect shadow estimators and allow for a more fine-grained control of noise-induced biases.
  arXiv  Detail & Related papers  (2023-10-30T19:00:18Z)
• Latent Class-Conditional Noise Model [54.56899309997246]
  We introduce a Latent Class-Conditional Noise model (LCCN) to parameterize the noise transition under a Bayesian framework. We then deduce a dynamic label regression method for LCCN, whose Gibbs sampler allows us efficiently infer the latent true labels. Our approach safeguards the stable update of the noise transition, which avoids previous arbitrarily tuning from a mini-batch of samples.
  arXiv  Detail & Related papers  (2023-02-19T15:24:37Z)
• ShaDocNet: Learning Spatial-Aware Tokens in Transformer for Document Shadow Removal [53.01990632289937]
  We propose a Transformer-based model for document shadow removal. It uses shadow context encoding and decoding in both shadow and shadow-free regions.
  arXiv  Detail & Related papers  (2022-11-30T01:46:29Z)
• On Classical and Hybrid Shadows of Quantum States [0.0]
  Classical shadows are a computationally efficient approach to storing quantum states on a classical computer. We discuss the advantages and limitations of using classical shadows to simulate many-body dynamics. We introduce the notion of a hybrid shadow, constructed from measurements on a part of the system instead of the entirety.
  arXiv  Detail & Related papers  (2022-06-14T06:25:24Z)
• Arbitrary-Scale Image Synthesis [149.0290830305808]
  Positional encodings have enabled recent works to train a single adversarial network that can generate images of different scales. We propose the design of scale-consistent positional encodings invariant to our generator's transformations layers. We show competitive results for a continuum of scales on various commonly used datasets for image synthesis.
  arXiv  Detail & Related papers  (2022-04-05T15:10:43Z)
• ContourRender: Detecting Arbitrary Contour Shape For Instance Segmentation In One Pass [48.57232627854642]
  We argue that the difficulty in regressing the contour points in one pass is mainly due to the ambiguity when discretizing a smooth contour into a polygon. To address the ambiguity, we propose a novel differentiable rendering-based approach named textbfContourRender. It first predicts a contour generated by an invertible shape signature, and then optimize the contour with the more stable silhouette by converting it to a contour mesh and rendering the mesh to a 2D map.
  arXiv  Detail & Related papers  (2021-06-07T07:23:03Z)
• Classical Shadows With Noise [0.0]
  We study the effects of noise on the classical shadows protocol. We derive an analytical upper bound for the sample complexity in terms of a shadow seminorm for both local and global noise. Our results can be used to prove rigorous sample complexity upper bounds in the cases of depolarizing noise and amplitude damping.
  arXiv  Detail & Related papers  (2020-11-23T17:43:42Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)
• Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles [65.9694455739978]
  We study contextual linear bandit problems under feature uncertainty, where the features are noisy and have missing entries. Our analysis reveals that the optimal hypothesis can significantly deviate from the underlying realizability function, depending on the noise characteristics. This implies that classical approaches cannot guarantee a non-trivial regret bound.
  arXiv  Detail & Related papers  (2017-03-03T21:39:56Z)

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.