We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

quant-ph

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Quantum Physics

Title: Quantum Error Mitigation by Pauli Check Sandwiching

Abstract: We describe and analyze an error mitigation technique that uses multiple pairs of parity checks to detect the presence of errors. Each pair of checks uses one ancilla qubit to detect a component of the error operator and represents one layer of the technique. We build on the results on extended flag gadgets and put it on a firm theoretical foundation. We prove that this technique can recover the noiseless state under the assumption of noise not affecting the checks. The method does not incur any encoding overhead and instead chooses the checks based on the input circuit. We provide an algorithm for obtaining such checks for an arbitrary target circuit. Since the method applies to any circuit and input state, it can be easily combined with other error mitigation techniques. We evaluate the performance of the proposed methods using extensive numerical simulations on 1,850 random input circuits composed of Clifford gates and non-Clifford single-qubit rotations, a class of circuits encompassing most commonly considered variational algorithm circuits. We observe average improvements in fidelity of 34 percentage points with six layers of checks.
Comments: Comments are welcome
Subjects: Quantum Physics (quant-ph); Emerging Technologies (cs.ET)
Journal reference: Sci Rep 13, 2122 (2023)
DOI: 10.1038/s41598-023-28109-x
Cite as: arXiv:2206.00215 [quant-ph]
  (or arXiv:2206.00215v3 [quant-ph] for this version)

Submission history

From: Alvin Gonzales [view email]
[v1] Wed, 1 Jun 2022 03:48:50 GMT (3465kb,D)
[v2] Sat, 11 Jun 2022 22:56:32 GMT (3851kb,D)
[v3] Fri, 13 Jan 2023 08:25:23 GMT (1961kb,D)

Link back to: arXiv, form interface, contact.