Dual-state purification for practical quantum error mitigation

• URL: http://arxiv.org/abs/2105.01239v1
• Date: Tue, 4 May 2021 01:33:35 GMT
• Title: Dual-state purification for practical quantum error mitigation
• Authors: Mingxia Huo, Ying Li
• Abstract summary: Quantum error mitigation is essential for computing on the noisy quantum computer with a limited number of qubits. We propose a practical protocol of error mitigation by virtually purifying the quantum state without qubit overhead. We successfully demonstrate the reduced error with a quantum variational eigensolver circuit.
• Score: 5.625946422295428
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error mitigation is essential for computing on the noisy quantum computer with a limited number of qubits. In this paper, we propose a practical protocol of error mitigation by virtually purifying the quantum state without qubit overhead or requiring only one ancillary qubit. In dual-state purification, we effectively generate a purified state with increased fidelity using the erroneous state and its dual state, respectively, prepared with the noisy quantum circuit and the dual map of its inverse circuit. Combined with tomography purification, we can make sure that the final estimate of an observable is obtained from a pure state. The numerical result suggests that our protocol reduces the error by a rescaling factor decreasing with the qubit number and circuit depth, i.e. the performance of purification is better for larger circuits. On a cloud quantum computer, we successfully demonstrate the reduced error with a quantum variational eigensolver circuit.

Related papers

• Maximum Likelihood Quantum Error Mitigation for Algorithms with a Single Correct Output [5.601537787608725]
  Quantum error mitigation is an important technique to reduce the impact of noise in quantum computers. We propose a simple and effective mitigation scheme, qubit-wise majority vote, for quantum algorithms with a single correct output.
  arXiv  Detail & Related papers  (2024-02-19T04:44:33Z)
• Streaming quantum state purification [4.189670490218164]
  Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices. We derive an efficient purification procedure based on the swap test for qudits of any dimension.
  arXiv  Detail & Related papers  (2023-09-28T12:33:09Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Quantum Circuit Distillation and Compression [0.33363717210853483]
  When long quantum calculation is run on a quantum processor without error correction, the noise often causes fatal errors. We propose quantum-circuit distillation to generate quantum circuits that are short but have enough functions to produce an output almost identical to that of the original circuits.
  arXiv  Detail & Related papers  (2023-09-05T02:47:19Z)
• Optimal Qubit Reuse for Near-Term Quantum Computers [0.18188255328029254]
  Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse. We introduce a formal model for qubit reuse optimization that delivers provably optimal solutions. We show improvements in the number of qubits and swap gate insertions, estimated success probability, and Hellinger fidelity of the investigated quantum circuits.
  arXiv  Detail & Related papers  (2023-07-31T23:15:45Z)
• Repeated Purification versus Concatenated Error Correction in Fault Tolerant Quantum Networks [3.52359746858894]
  Successful entanglement swapping is error-prone. The occurrence of quantum errors can be using purification and error correction. We compare the two options: repeated purification and iterationsd error correction.
  arXiv  Detail & Related papers  (2023-02-27T14:10:35Z)
• The power of noisy quantum states and the advantage of resource dilution [62.997667081978825]
  Entanglement distillation allows to convert noisy quantum states into singlets. We show that entanglement dilution can increase the resilience of shared quantum states to local noise.
  arXiv  Detail & Related papers  (2022-10-25T17:39:29Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum thermodynamic methods to purify a qubit on a quantum processing unit [68.8204255655161]
  We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit equipped with identical qubits. Our starting point is a three qubit design that emulates the well known two qubit swap engine. We implement it on a publicly available superconducting qubit based QPU, and observe a purification capability down to 200 mK.
  arXiv  Detail & Related papers  (2022-01-31T16:13:57Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.