Quantum memory assisted observable estimation

• URL: http://arxiv.org/abs/2212.07710v3
• Date: Tue, 12 Dec 2023 14:25:09 GMT
• Title: Quantum memory assisted observable estimation
• Authors: Liubov A. Markovich, Attaallah Almasi, Sina Zeytino\u{g}lu and Johannes Borregaard
• Abstract summary: estimation of many-qubit observables is an essential task of quantum information processing. We introduce a novel method, dubbed Coherent Pauli Summation, that exploits access to a single-qubit quantum memory. Our work demonstrates how a single long-coherence qubit memory can assist the operation of noisy many-qubit quantum devices in a cardinal task.
• Score: 0.40964539027092906
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The estimation of many-qubit observables is an essential task of quantum information processing. The generally applicable approach is to decompose the observables into weighted sums of multi-qubit Pauli strings, i.e., tensor products of single-qubit Pauli matrices, which can readily be measured with single qubit rotations. The accumulation of shot noise in this approach, however, severely limits the achievable variance for a finite number of measurements. We introduce a novel method, dubbed Coherent Pauli Summation (CPS) that circumvents this limitation by exploiting access to a single-qubit quantum memory in which measurement information can be stored and accumulated. Our algorithm offers a reduction in the required number of measurements for a given variance that scales linearly with the number of Pauli strings of the decomposed observable. Our work demonstrates how a single long-coherence qubit memory can assist the operation of noisy many-qubit quantum devices in a cardinal task.

Related papers

• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Towards enhancing quantum expectation estimation of matrices through partial Pauli decomposition techniques and post-processing [7.532969638222725]
  We introduce an approach for estimating the expectation values of arbitrary $n$-qubit matrices $M in mathbbC2ntimes 2n$ on a quantum computer.
  arXiv  Detail & Related papers  (2024-01-31T07:48:00Z)
• 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)
• High-Precision Observable Estimation with Single Qubit Quantum Memory [0.0]
  The estimation of multi-qubit observables is a key task in quantum information science. Here, we describe a many-qubit observable estimation approach to achieve this with a much lower number of interactions between the multi-qubit device and the single qubit memory.
  arXiv  Detail & Related papers  (2023-08-31T11:32:32Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Universal cost bound of quantum error mitigation based on quantum estimation theory [0.0]
  We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory. We derive for a generic layered quantum circuit under a wide class of Markovian noise that, unbiased estimation of an observable encounters an exponential growth with the circuit depth in the lower bound on the measurement cost. Our results contribute to the understanding of the physical limitations of quantum error mitigation and offer a new criterion for evaluating the performance of quantum error mitigation techniques.
  arXiv  Detail & Related papers  (2022-08-19T15:04:36Z)
• Decision Diagrams for Quantum Measurements with Shallow Circuits [5.68103962078559]
  We introduce estimators based on randomised measurements, which use decision diagrams to sample from probability distributions on measurement bases. We show numerically that the estimators introduced here can produce more precise estimates on some quantum chemistry Hamiltonians.
  arXiv  Detail & Related papers  (2021-05-14T16:23:08Z)
• Efficient estimation of Pauli observables by derandomization [4.157415305926584]
  We propose an efficient derandomization procedure that iteratively replaces random single-qubit measurements with fixed Pauli measurements. For estimating any $L$ low-weight Pauli observables, a deterministic measurement on only of order $log(L)$ copies of a quantum state suffices.
  arXiv  Detail & Related papers  (2021-03-12T20:09:57Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Statistical Limits of Supervised Quantum Learning [90.0289160657379]
  We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension. We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
  arXiv  Detail & Related papers  (2020-01-28T17:35:32Z)

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.