Virtual Distillation for Quantum Error Mitigation

• URL: http://arxiv.org/abs/2011.07064v3
• Date: Mon, 2 Aug 2021 05:32:22 GMT
• Title: Virtual Distillation for Quantum Error Mitigation
• Authors: William J. Huggins, Sam McArdle, Thomas E. O'Brien, Joonho Lee, Nicholas C. Rubin, Sergio Boixo, K. Birgitta Whaley, Ryan Babbush, Jarrod R. McClean
• Abstract summary: 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.
• Score: 0.6745502291821955
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Contemporary quantum computers have relatively high levels of noise, making it difficult to use them to perform useful calculations, even with a large number of qubits. Quantum error correction is expected to eventually enable fault-tolerant quantum computation at large scales, but until then it will be necessary to use alternative strategies to mitigate the impact of errors. We propose a near-term friendly strategy to mitigate errors by entangling and measuring $M$ copies of a noisy state $\rho$. This enables us to estimate expectation values with respect to a state with dramatically reduced error, $\rho^M/ \mathrm{Tr}(\rho^M)$, without explicitly preparing it, hence the name "virtual distillation". As $M$ increases, this state approaches the closest pure state to $\rho$, exponentially quickly. We analyze the effectiveness of virtual distillation and find that it is governed in many regimes by the behavior of this pure state (corresponding to the dominant eigenvector of $\rho$). We numerically 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. Finally, we show that this technique can improve the convergence of randomized quantum algorithms, even in the absence of device noise.

Related papers

• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• 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)
• Study of noise in virtual distillation circuits for quantum error mitigation [0.0]
  We study the effect of uncorrelated, identical noise in the cyclic permutation circuit. We find that the estimation of expectation value of observables are robust against dephasing noise. Our results imply that a broad class of quantum algorithms can be implemented with higher accuracy in the near-term.
  arXiv  Detail & Related papers  (2022-10-27T10:56:35Z)
• Logical shadow tomography: Efficient estimation of error-mitigated observables [11.659279774157255]
  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.
  arXiv  Detail & Related papers  (2022-03-14T16:42:22Z)
• Qubit-efficient exponential suppression of errors [0.8258451067861933]
  Recent breakthroughs have introduced methods capable of exponentially suppressing errors. We present an alternative method that adapts this breakthrough to much fewer qubits by making use of active qubit resets. We find that REQUEST can reproduce the exponential suppression of errors of the virtual distillation approach, while out-performing virtual distillation when fewer than $3N+1$ qubits are available.
  arXiv  Detail & Related papers  (2021-02-11T15:01:32Z)
• 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)
• 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)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Differentially Quantized Gradient Methods [53.3186247068836]
  We show that Differentially Quantized Gradient Descent (DQ-GD) attains a linear contraction factor of $maxsigma_mathrmGD, rhon 2-R$. No algorithm within a certain class can converge faster than $maxsigma_mathrmGD, 2-R$.
  arXiv  Detail & Related papers  (2020-02-06T20:40:53Z)

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.