Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unifying non-Markovian characterisation with an efficient and self-consistent framework

Published 13 Dec 2023 in quant-ph | (2312.08454v2)

Abstract: Noise on quantum devices is much more complex than it is commonly given credit. Far from usual models of decoherence, nearly all quantum devices are plagued both by a continuum of environments and temporal instabilities. These induce noisy quantum and classical correlations at the level of the circuit. The relevant spatiotemporal effects are difficult enough to understand, let alone combat. There is presently a lack of either scalable or complete methods to address the phenomena responsible for scrambling and loss of quantum information. Here, we make deep strides to remedy this problem. We establish a theoretical framework that uniformly incorporates and classifies all non-Markovian phenomena. Our framework is universal, assumes no parameters values, and is written entirely in terms of experimentally accessible circuit-level quantities. We formulate an efficient reconstruction using tensor network learning, allowing also for easy modularisation and simplification based on the expected physics of the system. This is then demonstrated through both extensive numerical studies and implementations on IBM Quantum devices, estimating a comprehensive set of spacetime correlations. Finally, we conclude our analysis with applications thereof to the efficacy of control techniques to counteract these effects -- including noise-aware circuit compilation and optimised dynamical decoupling. We find significant improvements are possible in the diamond norm and average gate fidelity of arbitrary $SU(4)$ operations, as well as related decoupling improvements in contrast to off-the-shelf schemes.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.