Generalized quantum subspace expansion

• URL: http://arxiv.org/abs/2107.02611v3
• Date: Tue, 15 Feb 2022 02:03:43 GMT
• Title: Generalized quantum subspace expansion
• Authors: Nobuyuki Yoshioka, Hideaki Hakoshima, Yuichiro Matsuzaki, Yuuki Tokunaga, Yasunari Suzuki, Suguru Endo
• Abstract summary: We propose a novel quantum subspace method which can handle, coherent, and algorithmic errors in quantum computers. By fully exploiting the substantially extended subspace, we can efficiently mitigate the noise present in the spectra of a given Hamiltonian. We show that out protocol inherits the advantages of previous error-agnostic QEM techniques as well as overcoming their drawbacks.
• Score: 0.2936007114555107
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One of the major challenges for erroneous quantum computers is undoubtedly the control over the effect of noise. Considering the rapid growth of available quantum resources that are not fully fault-tolerant, it is crucial to develop practical hardware-friendly quantum error mitigation (QEM) techniques to suppress unwanted errors. Here, we propose a novel generalized quantum subspace expansion method which can handle stochastic, coherent, and algorithmic errors in quantum computers. By fully exploiting the substantially extended subspace, we can efficiently mitigate the noise present in the spectra of a given Hamiltonian, without relying on any information of noise. The performance of our method is discussed under two highly practical setups: the quantum subspaces are mainly spanned by powers of the noisy state $\rho^m$ and a set of error-boosted states, respectively. We numerically demonstrate in both situations that we can suppress errors by orders of magnitude, and show that out protocol inherits the advantages of previous error-agnostic QEM techniques as well as overcoming their drawbacks.

Related papers

• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Quantum error mitigation for Fourier moment computation [49.1574468325115]
  This paper focuses on the computation of Fourier moments within the context of a nuclear effective field theory on superconducting quantum hardware. The study integrates echo verification and noise renormalization into Hadamard tests using control reversal gates. The analysis, conducted using noise models, reveals a significant reduction in noise strength by two orders of magnitude.
  arXiv  Detail & Related papers  (2024-01-23T19:10:24Z)
• Dual-GSE: Resource-efficient Generalized Quantum Subspace Expansion [2.3847436897240453]
  A generalized quantum subspace expansion (GSE) has been proposed that is significantly robust against coherent errors. We propose a resource-efficient implementation of GSE, which we name "Dual-GSE" Remarkably, Dual-GSE can further simulate larger quantum systems beyond the size of available quantum hardware.
  arXiv  Detail & Related papers  (2023-09-25T14:28:40Z)
• Leveraging hardware-control imperfections for error mitigation via generalized quantum subspace [0.8399688944263843]
  In the era of quantum computing without full fault-tolerance, it is essential to suppress noise effects via the quantum error mitigation techniques to enhance the computational power of the quantum devices. One of the most effective noise-agnostic error mitigation schemes is the generalized quantum subspace expansion (GSE) method. We propose the fault-subspace method, which constructs an error-mitigated quantum state with copies of quantum states with different noise levels.
  arXiv  Detail & Related papers  (2023-03-14T07:01:30Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Universal robust quantum gates by geometric correspondence of noisy quantum dynamics [0.0]
  We develop a theory to capture quantum dynamics due to various noises graphically, obtaining the quantum erroneous evolution diagrams (QEED) We then develop a protocol to engineer a universal set of single- and two-qubit robust gates that correct the generic errors. Our approach offers new insights into the geometric aspects of noisy quantum dynamics and several advantages over existing methods.
  arXiv  Detail & Related papers  (2022-10-26T07:21:02Z)
• Fundamental limits of quantum error mitigation [0.0]
  We show how error-mitigation algorithms can reduce the computation error as a function of their sampling overhead. Our results provide a means to identify when a given quantum error-mitigation strategy is optimal and when there is potential room for improvement.
  arXiv  Detail & Related papers  (2021-09-09T17:56:14Z)
• Achieving fault tolerance against amplitude-damping noise [1.7289359743609742]
  We develop a protocol for fault-tolerant encoded quantum computing components in the presence of amplitude-damping noise. We describe a universal set of fault-tolerant encoded gadgets and compute the pseudothreshold for the noise. Our work demonstrates the possibility of applying the ideas of quantum fault tolerance to targeted noise models.
  arXiv  Detail & Related papers  (2021-07-12T14:59:54Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• 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)

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.