Tight bounds on Pauli channel learning without entanglement

Abstract

Quantum entanglement is a crucial resource for learning properties from nature, but a precise characterization of its advantage can be challenging. In this work, we consider learning algorithms without entanglement to be those that only utilize states, measurements, and operations that are separable between the main system of interest and an ancillary system. Interestingly, we show that these algorithms are equivalent to those that apply quantum circuits on the main system interleaved with mid-circuit measurements and classical feedforward. Within this setting, we prove a tight lower bound for Pauli channel learning without entanglement that closes the gap between the best-known upper and lower bound. In particular, we show that $\Theta (2^n{\epsilon }^{-2})$ rounds of measurements are required to estimate each eigenvalue of an $n$-qubit Pauli channel to $\epsilon$ error with high probability when learning without entanglement. In contrast, a learning algorithm with entanglement only needs $\Theta ({\epsilon }^{-2})$ copies of the Pauli channel. The tight lower bound strengthens the foundation for an experimental demonstration of entanglement-enhanced advantages for Pauli noise characterization.

20 pages, 2 figure; v2: add Fig.2 comparing our lower bound with noisy-entanglement-assisted upper bound, close to accepted version; v3: correct a typo in Notes added

References in corpus (28)

• The Quantum Internet
• Mixed State Entanglement and Quantum Error Correction
• Advances in Quantum Metrology
• Concentrating Partial Entanglement by Local Operations
• Quantum metrology
• Quantifying Entanglement
• Quantum Resource Theories
• Randomized Benchmarking of Quantum Gates
• A Theory of Fault-Tolerant Quantum Computation
• Quantum advantage in learning from experiments
• Noise tailoring for scalable quantum computation via randomized compiling
• Scalable Noise Estimation with Random Unitary Operators
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Information-theoretic bounds on quantum advantage in machine learning
• Characterizing large-scale quantum computers via cycle benchmarking
• Entangling operations and their implementation using a small amount of entanglement
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Efficient learning of quantum noise
• Gate Set Tomography
• Robust shadow estimation
• Mid-circuit correction of correlated phase errors using an array of spectator qubits
• What randomized benchmarking actually measures
• Efficient estimation of Pauli channels
• Quantum advantages for Pauli channel estimation
• The learnability of Pauli noise
• Pauli error estimation via Population Recovery
• Averaged circuit eigenvalue sampling

Cited by in corpus (8)

• Entanglement-enabled advantage for learning a bosonic random displacement channel
• Limits of noisy quantum metrology with restricted quantum controls
• Certifying Quantum Temporal Correlation via Randomized Measurements: Theory and Experiment
• Efficient self-consistent learning of gate set Pauli noise
• Agnostic Process Tomography
• Adaptivity is not helpful for Pauli channel learning
• On the query complexity of unitary channel certification
• On the Fundamental Resource for Exponential Advantage in Quantum Channel Learning