Quantum memory assisted observable estimation
arXiv:2212.07710 · doi:10.22331/q-2025-03-06-1655
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.
21 pages, 2 figures
References in corpus (37)
- A variational eigenvalue solver on a quantum processor
- Quantum information with Rydberg atoms
- Quantum computational chemistry
- Dipole Blockade and Quantum Information Processing in Mesoscopic Atomic Ensembles
- Fast quantum gates for neutral atoms
- Superconducting Qubits: Current State of Play
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Quantum computing with atomic qubits and Rydberg interactions: Progress and challenges
- Parallel implementation of high-fidelity multi-qubit gates with neutral atoms
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum computing with neutral atoms
- Hamiltonian simulation with nearly optimal dependence on all parameters
- Fast quantum logic gates with trapped-ion qubits
- Low Depth Quantum Simulation of Electronic Structure
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- Accelerated Variational Quantum Eigensolver
- Robust multi-qubit quantum network node with integrated error detection
- Optimal Quantum Measurements of Expectation Values of Observables
- Efficient Bayesian Phase Estimation
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Efficient quantum measurement of Pauli operators in the presence of finite sampling error
- Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
- The methodology of resonant equiangular composite quantum gates
- Exploiting locality in quantum computation for quantum chemistry
- Demonstrating Heisenberg-limited unambiguous phase estimation without adaptive measurements
- Robust Calibration of a Universal Single-Qubit Gate-Set via Robust Phase Estimation
- A Compact Fermion to Qubit Mapping
- Efficient evaluation of quantum observables using entangled measurements
- Heralded quantum gates with integrated error detection in optical cavities
- Asymmetric blockade and multi-qubit gates via dipole-dipole interactions
- Efficient Grover search with Rydberg blockade
- Nearly Optimal Quantum Algorithm for Estimating Multiple Expectation Values
- Monitoring Quantum Simulators via Quantum Non-Demolition Couplings to Atomic Clock Qubits
- Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits
- Quantum Non-demolition Measurement of a Many-Body Hamiltonian
- Practical sampling schemes for quantum phase estimation
- Quantum circuits for solving local fermion-to-qubit mappings