Efficient Estimation of Pauli Channels

@article{Flammia2020EfficientEO,
  title={Efficient Estimation of Pauli Channels},
  author={Steven T. Flammia and Joel J. Wallman},
  journal={ACM Transactions on Quantum Computing},
  year={2020},
  volume={1},
  pages={1 - 32}
}
  • S. Flammia, J. Wallman
  • Published 30 July 2019
  • Physics, Computer Science
  • ACM Transactions on Quantum Computing
Pauli channels are ubiquitous in quantum information, both as a dominant noise source in many computing architectures and as a practical model for analyzing error correction and fault tolerance. Here, we prove several results on efficiently learning Pauli channels and more generally the Pauli projection of a quantum channel. We first derive a procedure for learning a Pauli channel on n qubits with high probability to a relative precision ϵ using O(ϵ-2n2n) measurements, which is efficient in the… 
View on ACM
View With Semantic Reader
43 Citations
Highly Influential Citations
2
Background Citations
11
Methods Citations
9

Figures from this paper

43 Citations

Citation Type

Citation Type

Quantum advantages for Pauli channel estimation
We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for…
Pauli channels can be estimated from syndrome measurements in quantum error correction
TLDR
This work rigorously resolve the question for arbitrary stabilizer codes that a stabilizer code can be used to estimate Pauli channels with correlations across a number of qubits given by the pure distance, and applies even if high weight errors occur frequently.
Pauli Error Estimation via Population Recovery
TLDR
An extremely simple algorithm is given that learns the Pauli error rates of an n-qubit channel to precision ε in l∞ using just O(1/ε2) log(n/ε) applications of the channel, which is optimal up to the logarithmic factors.
Dual Map Framework for Noise Characterization of Quantum Computers
TLDR
This paper presents a method that faithfully reconstructs a marginal (local) approximation of the effective noise (MATEN) channel, that acts as a single layer at the end of the circuit, that justifies the MATEN, even in the presence of non-local errors that occur during a circuit.
Benchmarking near-term quantum computers via random circuit sampling
The increasing scale of near-term quantum hardware motivates the need for efficient noise characterization methods, since qubit and gate level techniques cannot capture crosstalk and correlated noise…
Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
TLDR
This work introduces a correlated measurement noise model that can be efficiently described and characterized, and which admits effective noise-mitigation on the level of marginal probability distributions, and finds that correlations in the measurement noise do not correspond to the physical layout of the device.
Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
TLDR
A practical protocol for learning a sparse noise model that scales to large quantum devices and is efficient to learn and invert is presented, thereby revealing a path to error-mitigated quantum computation with noise-free observables at larger circuit volumes.
Practical and Efficient Hamiltonian Learning
TLDR
This work presents a practical and efficient Hamiltonian learning method that can efficiently learn any Hamiltonian that is sparse on the Pauli basis using only short time dynamics and local operations without any information of the Hamiltonian or preparing any eigenstates or thermal states.
Conditionally Rigorous Mitigation of Multiqubit Measurement Errors.
TLDR
This work develops a measurement error mitigation technique, a conditionally rigorous TMEM, that is not sensitive to state-preparation errors and thus avoids this limitation and demonstrates the importance of the technique for high-precision measurement and for quantum foundations experiments by measuring Mermin polynomials on IBM Q superconducting qubits.
Mitigating Quantum Errors via Truncated Neumann Series
Quantum gates and measurements on quantum hardware are inevitably subject to hardware imperfections that lead to quantum errors. Mitigating such unavoidable errors is crucial to explore the power of…
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 197 REFERENCES
Efficient learning of quantum noise
TLDR
The results pave the way for noise metrology in next-generation quantum devices, calibration in the presence of crosstalk, bespoke quantum error-correcting codes 10 and customized fault-tolerance protocols 11 that can greatly reduce the overhead in a quantum computation.
Characterizing Noise in Quantum Systems
TLDR
A randomized benchmarking protocol is presented that provides a scalable method for determining important properties of the noise affecting the set of gates used on a quantum information processor and various properties ofThe quantum gate fidelity are proved, which is a useful state-dependent measure of the distance between two quantum operations.
Recovering quantum gates from few average gate fidelities
TLDR
This Letter provides a rigorously guaranteed and practical reconstruction method that works with an essentially optimal number of average gate fidelities measured with respect to random Clifford unitaries for characterizing multiqubit unitary gates.
Performance of quantum error correction with coherent errors
TLDR
This work analytically calculates the effective logical channel that results when the error correction steps are performed noiselessly in quantum error correcting codes and proves a bound on the performance of any stabilizer code when the noise at the physical level is unitary.
Randomized Benchmarking of Quantum Gates
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate…
Noise tailoring for scalable quantum computation via randomized compiling
TLDR
This work proposes a method for introducing independent random single-qubit gates into the logical circuit in such a way that the effective logical circuit remains unchanged and proves that this randomization tailors the noise into stochastic Pauli errors, which can dramatically reduce error rates while introducing little or no experimental overhead.
Analysing correlated noise on the surface code using adaptive decoding algorithms
TLDR
New methods to analyse blue a particular class of spatially correlated errors by making use of parametrised families of decoding algorithms and it is shown that information can be learnt about the parameters of the noise model, and additionally that the logical error rates can be improved.
Efficient Simulation of Random Quantum States and Operators
We investigate the generation of quantum states and unitary operations that are ``random'' in certain respects. We show how to use such states to estimate the average fidelity, an important measure…
Statistical mechanical models for quantum codes with correlated noise
TLDR
This mapping connects the error correction threshold of the quantum code to a phase transition in the statistical mechanical model, and allows any existing method for finding phase transitions, such as Monte Carlo simulations, to be applied to approximate the threshold of any such code, without having to perform optimal decoding.
Experimental demonstration of Pauli-frame randomization on a superconducting qubit.
TLDR
This work uses high-accuracy gate-set tomography to demonstrate that without randomization the natural errors experienced by this experiment have coherent character, and that with randomization these errors are rendered incoherent, and demonstrates how noise models can be shaped into more benign forms for improved performance.
...
1
2
3
4
5
...