Randomised benchmarking for characterizing and forecasting correlated processes
arXiv:2312.06062 · doi:10.1038/s42005-025-01944-2
Abstract
The development of fault-tolerant quantum processors relies on the ability to control noise. A particularly insidious form of noise is temporally correlated or non-Markovian noise. By combining randomized benchmarking with supervised machine learning algorithms, we develop a method to learn the details of temporally correlated noise. In particular, we can learn the time-independent evolution operator of system plus bath and this leads to (i) the ability to characterize the degree of non-Markovianity of the dynamics and (ii) the ability to predict the dynamics of the system even beyond the times we have used to train our model. We exemplify this by implementing our method on a superconducting quantum processor. Our experimental results show a drastic change between the Markovian and non-Markovian regimes for the learning accuracies.
4 pages, 3 figures
References in corpus (14)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- The density-matrix renormalization group in the age of matrix product states
- Matrix Product Density Operators: Simulation of finite-T and dissipative systems
- Strong quantum computational advantage using a superconducting quantum processor
- Suppressing quantum errors by scaling a surface code logical qubit
- Randomized Benchmarking of Quantum Gates
- Robust randomized benchmarking of quantum processes
- Hybrid quantum-classical algorithms and quantum error mitigation
- Realization of an Error-Correcting Surface Code with Superconducting Qubits
- Operational Markov condition for quantum processes
- Operator Space Entanglement Entropy in XY Spin Chains
- Filtering crosstalk from bath non-Markovianity via spacetime classical shadows
- Quantifying Non-Markovianity in Open Quantum Dynamics
- Reconstructing Non-Markovian Open Quantum Evolution From Multi-time Measurements