Mitigating Non-Markovian and Coherent Errors Using Quantum Process Tomography of Proxy States

• URL: http://arxiv.org/abs/2411.03458v1
• Date: Tue, 05 Nov 2024 19:18:30 GMT
• Title: Mitigating Non-Markovian and Coherent Errors Using Quantum Process Tomography of Proxy States
• Authors: I-Chi Chen, Bharath Hebbe Madhusudhana,
• Abstract summary: We consider three of the most common bosonic error correction codes -- the CLY, binomial and dual rail. We find that the dual rail code shows the best performance. We also develop a new technique for error mitigation in quantum control.
• Score: 0.0
• License:
• Abstract: Detecting mitigating and correcting errors in quantum control is among the most pertinent contemporary problems in quantum technologies. We consider three of the most common bosonic error correction codes -- the CLY, binomial and dual rail and compare their performance under typical errors in bosonic systems. We find that the dual rail code shows the best performance. We also develop a new technique for error mitigation in quantum control. We consider a quantum system with large Hilbert space dimension, e.g., a qudit or a multi-qubit system and construct two $2- $ dimensional subspaces -- a code space, $\mathcal C = \text{span}\{|\bar{0}\rangle, |\bar{1}\rangle\}$ where the logical qubit is encoded and a ``proxy'' space $\mathcal P = \text{span}\{|\bar{0}'\rangle, |\bar{1}'\rangle\}$. While the qubit (i.e., $\mathcal C$) can be a part of a quantum circuit, the proxy (i.e., $\mathcal P$) remains idle. In the absence of errors, the quantum state of the proxy qubit does not evolve in time. If $\mathcal E$ is an error channel acting on the full system, we consider its projections on $\mathcal C$ and $\mathcal P$ represented as pauli transfer matrices $T_{\mathcal E}$ and $T'_{\mathcal E}$ respectively. Under reasonable assumptions regarding the origin of the errors, $T_{\mathcal E}$ can be inferred from $T'_{\mathcal E}$ acting on the proxy qubit and the latter can be measured without affecting the qubit. The latter can be measured while the qubit is a part of a quantum circuit because, one can perform simultaneous measurements on the logical and the proxy qubits. We use numerical data to learn an \textit{affine map} $\phi$ such that $T_{\mathcal E} \approx \phi(T'_{\mathcal E})$. We also show that the inversion of a suitable proxy space's logical pauli transfer matrix can effectively mitigate the noise on the two modes bosonic system or two qudits system.

Related papers

• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• On encoded quantum gate generation by iterative Lyapunov-based methods [0.0]
  The problem of encoded quantum gate generation is studied in this paper. The emphReference Input Generation Algorithm (RIGA) is generalized in this work.
  arXiv  Detail & Related papers  (2024-09-02T10:41:15Z)
• Quantum State Learning Implies Circuit Lower Bounds [2.2667044928324747]
  We establish connections between state tomography, pseudorandomness, quantum state, circuit lower bounds. We show that even slightly non-trivial quantum state tomography algorithms would lead to new statements about quantum state synthesis.
  arXiv  Detail & Related papers  (2024-05-16T16:46:27Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Quantum Depth in the Random Oracle Model [57.663890114335736]
  We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. For some problems, the ability to perform adaptive measurements in a single shallow quantum circuit is more useful than the ability to perform many shallow quantum circuits without adaptive measurements.
  arXiv  Detail & Related papers  (2022-10-12T17:54:02Z)
• Learning Distributions over Quantum Measurement Outcomes [4.467248776406005]
  Shadow tomography for quantum states provides a sample efficient approach for predicting the properties of quantum systems. We develop an online shadow tomography procedure that solves this problem with high success probability.
  arXiv  Detail & Related papers  (2022-09-07T09:08:58Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• Threshold Phenomena in Learning Halfspaces with Massart Noise [56.01192577666607]
  We study the problem of PAC learning halfspaces on $mathbbRd$ with Massart noise under Gaussian marginals. Our results qualitatively characterize the complexity of learning halfspaces in the Massart model.
  arXiv  Detail & Related papers  (2021-08-19T16:16:48Z)
• Hardness of Learning Halfspaces with Massart Noise [56.98280399449707]
  We study the complexity of PAC learning halfspaces in the presence of Massart (bounded) noise. We show that there an exponential gap between the information-theoretically optimal error and the best error that can be achieved by a SQ algorithm.
  arXiv  Detail & Related papers  (2020-12-17T16:43:11Z)
• Quantum learning algorithms imply circuit lower bounds [7.970954821067043]
  We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Our proof builds on several works in learning theory, pseudorandomness, and computational complexity.
  arXiv  Detail & Related papers  (2020-12-03T14:03:20Z)
• What limits the simulation of quantum computers? [5.22339562024796]
  We demonstrate that real quantum computers can be simulated at a tiny fraction of the cost that would be needed for a perfect quantum computer. Our algorithms compress the representations of quantum wavefunctions using matrix product states (MPS), which capture states with low to moderate entanglement very accurately. For a two dimensional array of $N=54$ qubits and a circuit with Control-Z gates, error rates better than state-of-the-art devices can be obtained on a laptop in a few hours.
  arXiv  Detail & Related papers  (2020-02-18T17:00:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.