Logical shadow tomography: Efficient estimation of error-mitigated observables

• URL: http://arxiv.org/abs/2203.07263v1
• Date: Mon, 14 Mar 2022 16:42:22 GMT
• Title: Logical shadow tomography: Efficient estimation of error-mitigated observables
• Authors: Hong-Ye Hu and Ryan LaRose and Yi-Zhuang You and Eleanor Rieffel and Zhihui Wang
• Abstract summary: We introduce a technique to estimate error-mitigated expectation values on noisy quantum computers. Our technique performs shadow tomography on a logical state to produce a memory-efficient classical reconstruction of the noisy density matrix. Relative to virtual distillation, our technique can compute powers of the density matrix without additional copies of quantum states or quantum memory.
• Score: 11.659279774157255
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a technique to estimate error-mitigated expectation values on noisy quantum computers. Our technique performs shadow tomography on a logical state to produce a memory-efficient classical reconstruction of the noisy density matrix. Using efficient classical post-processing, one can mitigate errors by projecting a general nonlinear function of the noisy density matrix into the codespace. The subspace expansion and virtual distillation can be viewed as special cases of the new framekwork. We show our method is favorable in the quantum and classical resources overhead. Relative to subspace expansion which requires $O\left(2^{N} \right)$ samples to estimate a logical Pauli observable with $[[N, k]]$ error correction code, our technique requires only $O\left(4^{k} \right)$ samples. Relative to virtual distillation, our technique can compute powers of the density matrix without additional copies of quantum states or quantum memory. We present numerical evidence using logical states encoded with up to sixty physical qubits and show fast convergence to error-free expectation values with only $10^5$ samples under 1% depolarizing noise.

Related papers

• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Maximum expectation of observables with restricted purity states [2.7624021966289605]
  Assessment of practical quantum information processing (QIP) remains partial without understanding limits imposed by noise. We fulfill the need for estimates on performing noisy quantum state preparation, verification, and observation. We also give a simple but fundamental insight, noisy systems always give higher ground-state energy than their noiseless counterparts.
  arXiv  Detail & Related papers  (2023-11-13T19:02:35Z)
• Quantum state tomography with tensor train cross approximation [84.59270977313619]
  We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements.
  arXiv  Detail & Related papers  (2022-07-13T17:56:28Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Minimax Optimal Quantization of Linear Models: Information-Theoretic Limits and Efficient Algorithms [59.724977092582535]
  We consider the problem of quantizing a linear model learned from measurements. We derive an information-theoretic lower bound for the minimax risk under this setting. We show that our method and upper-bounds can be extended for two-layer ReLU neural networks.
  arXiv  Detail & Related papers  (2022-02-23T02:39:04Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• How to simulate quantum measurement without computing marginals [3.222802562733787]
  We describe and analyze algorithms for classically computation measurement of an $n$-qubit quantum state $psi$ in the standard basis. Our algorithms reduce the sampling task to computing poly(n)$ amplitudes of $n$-qubit states.
  arXiv  Detail & Related papers  (2021-12-15T21:44:05Z)
• Efficient Verification of Anticoncentrated Quantum States [0.38073142980733]
  I present a novel method for estimating the fidelity $F(mu,tau)$ between a preparable quantum state $mu$ and a classically specified target state $tau$. I also present a more sophisticated version of the method, which uses any efficiently preparable and well-characterized quantum state as an importance sampler.
  arXiv  Detail & Related papers  (2020-12-15T18:01:11Z)
• Virtual Distillation for Quantum Error Mitigation [0.6745502291821955]
  Quantum computers have relatively high levels of noise, making it difficult to use them to perform useful calculations. We propose a near-term friendly strategy to mitigate errors by entangling and measuring $M$ copies of a noisy state. We demonstrate that virtual distillation is capable of suppressing errors by multiple orders of magnitude and explain how this effect is enhanced as the system size grows.
  arXiv  Detail & Related papers  (2020-11-13T18:58:31Z)
• Describing quantum metrology with erasure errors using weight distributions of classical codes [9.391375268580806]
  We consider using quantum probe states with a structure that corresponds to classical $[n,k,d]$ binary block codes of minimum distance. We obtain bounds on the ultimate precision that these probe states can give for estimating the unknown magnitude of a classical field.
  arXiv  Detail & Related papers  (2020-07-06T16:22:40Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.