Related papers: Single snapshot non-Markovianity of Pauli channels
Noise forms a central obstacle to effective quantum information processing. Recent experimental advances have enabled the tailoring of noise properties through Pauli twirling, transforming arbitrary noise channels into Pauli channels. This…
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…
Non-Markovian noise, arising from the memory effect in the environment, poses substantial challenges to conventional quantum noise suppression protocols, including quantum error correction and mitigation. We introduce a channel…
As quantum computers approach the fault tolerance threshold, diagnosing and characterizing the noise on large scale quantum devices is increasingly important. One of the most important classes of noise channels is the class of Pauli…
Error-mitigation techniques such as probabilistic error cancellation and zero-noise extrapolation benefit from accurate noise models. The sparse Pauli-Lindblad noise model is one of the most successful models for those applications. In…
Noise is both ubiquitous and generally deleterious in settings where precision is required. This is especially true in the quantum technology sector where system utility typically decays rapidly under its influence. Understanding the noise…
It is by now well established that noise itself can be useful for performing quantum information processing tasks. We present results which show how one can effectively reduce the error rate associated with a noisy quantum channel, by…
Quantum non-Markovianity of channels can be produced by mixing Markovian channels, as observed recently by various authors. We consider an analogous question of whether singularities of the channel can be produced by mixing non-singular…
We analyze the performance of a quantum error correction code subject to physically motivated noise modeled by a Lindblad master equation. We consider dissipative and coherent single-qubit terms and two-qubit crosstalk, studying how…
The unavoidable presence of noise is a crucial roadblock for the development of large-scale quantum computers and the ability to characterize quantum noise reliably and efficiently with high precision is essential to scale quantum…
We present a noise deconvolution technique for obtaining noiseless expectation values of noisy observables at the output of multiqubit quantum channels. For any number of qubits or in the presence of correlations, our protocol applies to…
The eternally non-Markovian Pauli channel is an example of a unital channel characterized by a negative decay rate for all time $t>0$. Here we consider the problem of constructing an analogous non-unital channel, and show in particular that…
Motivated by estimation of quantum noise models, we study the problem of learning a Pauli channel, or more generally the Pauli error rates of an arbitrary channel. By employing a novel reduction to the "Population Recovery" problem, we give…
We study general ``normally'' distributed random unitary transformations. These distributions can be defined in terms of a diffusive random walk in the respective group manifold, formally underpinned by the concept of infinite divisibility.…
We use symmetric measurement operators to construct quantum channels that provide a further generalization of generalized Pauli channels. The resulting maps are bistochastic but in general no longer mixed unitary. We analyze their important…
We introduce a method to construct non-Markovian variants of completely positive (CP) dynamical maps, particularly, qubit Pauli channels. We identify non-Markovianity with the breakdown in CP-divisibility of the map, i.e., appearance of a…
Pauli channels are fundamental in the context of quantum computing as they model the simplest kind of noise in quantum devices. We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps…
Quantum algorithms for simulating quantum systems provide a clear and provable advantage over classical algorithms in fault-tolerant settings. There is also interest in quantum algorithms and their implementation in Noisy Intermediate Scale…
The promise of quantum computing with imperfect qubits relies on the ability of a quantum computing system to scale cheaply through error correction and fault-tolerance. While fault-tolerance requires relatively mild assumptions about the…
We explore the impact of non-Markovian channels on the quantum correlations (QCs) of Haar uniformly generated random two-qubit input states with different ranks -- either one of the qubits (single-sided) or both the qubits independently…