Detecting Errors in a Quantum Network with Pauli Checks

• URL: http://arxiv.org/abs/2405.15236v4
• Date: Mon, 19 May 2025 18:45:54 GMT
• Title: Detecting Errors in a Quantum Network with Pauli Checks
• Authors: Alvin Gonzales, Daniel Dilley, Bikun Li, Liang Jiang, Zain H. Saleem,
• Abstract summary: We apply the quantum error detection scheme Pauli check sandwiching (PCS) to quantum networks by turning it into a distributed multiparty protocol.<n>PCS provides protection on the targeted qubits and generally requires less resource overhead than standard quantum error correction and detection codes.
• Score: 2.692338496884547
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We apply the quantum error detection scheme Pauli check sandwiching (PCS) to quantum networks by turning it into a distributed multiparty protocol. PCS provides protection on the targeted qubits and generally requires less resource overhead than standard quantum error correction and detection codes. We provide analytical equations for the final fidelity and postselection rate for different PCS checks. We also introduce a recursive version of PCS that generates a family of distance 2 quantum codes that are locally equivalent to CSS codes. Our analytical results are benchmarked against BBPSSW in comparable scenarios. We also perform simulations with noisy gates for entanglement swapping and attain fidelity improvements. Lastly, we discuss various setups and graph state properties of PCS.

Related papers

• Machine Learning assisted noise classification with Quantum Key Distribution protocols [0.7373617024876725]
  We consider the quantum bit error rates (QBERs) generated in quantum key distribution schemes under consideration of different noises.<n>Our protocol classifies quantum noises with high accuracy under the assumption of two different scenarios.<n>Our method is based on classical post processing of data generated from very simplistic quantum protocols.
  arXiv  Detail & Related papers  (2025-04-01T12:30:47Z)
• Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors [0.6502950223731163]
  This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit and gate teleportation. We also formulate an integer linear program to further reduce entanglement requirements by mapping the logical resources of partitioned circuits to the physical constraints of the quantum network.
  arXiv  Detail & Related papers  (2025-01-24T22:16:31Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Informed Dynamic Scheduling for QLDPC Codes [1.7802147489386628]
  We consider edge-wise informed dynamic scheduling (IDS) for QLDPC codes based on syndrome-based residual belief propagation (sRBP) Two strategies, including edge pool design and error pre-correction, are introduced to tackle this obstacle and quantum trapping sets. A novel sRBP equipped with a predict-and-reduce-error mechanism (PRE-sRBP) is proposed.
  arXiv  Detail & Related papers  (2024-10-02T03:00:15Z)
• Quantum Wasserstein Compilation: Unitary Compilation using the Quantum Earth Mover's Distance [2.502222151305252]
  We present a quantum Wasserstein compilation (QWC) cost function based on the quantum Wasserstein distance of order 1. An estimation method based on measurements of local Pauli-observable is utilized in a generative adversarial network to learn a given quantum circuit.
  arXiv  Detail & Related papers  (2024-09-09T17:46:40Z)
• Twin-field-based multi-party quantum key agreement [0.0]
  We study a method to extend the twin-field key distribution protocol to a scheme for multi-party quantum key agreement.<n>We study our protocol's security using a minimum error discrimination analysis and derive the key rate based on the entanglement-based source-replacement scheme.
  arXiv  Detail & Related papers  (2024-09-06T11:51:10Z)
• Pauli Check Sandwiching for Quantum Characterization and Error Mitigation during Runtime [8.860010205263116]
  This work presents a novel quantum system characterization and error mitigation framework that applies Pauli check sandwiching (PCS) PCS combined with multi-programming unlocks non-trivial fidelity improvements in quantum program outcomes.
  arXiv  Detail & Related papers  (2024-08-10T14:21:45Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• A Feasible Semi-quantum Private Comparison Based on Entanglement Swapping of Bell States [5.548873288570182]
  We propose a feasible semi-quantum private comparison protocol based on entanglement swapping of Bell states. Security analysis shows that our protocol is resilient to both external and internal attacks. Our proposed approach showcases the potential applications of entanglement swapping in the field of semi-quantum cryptography.
  arXiv  Detail & Related papers  (2023-05-12T13:28:44Z)
• Secure multiparty quantum computations for greatest common divisor and private set intersection [2.5204420653245245]
  We present a secure multiparty quantum computation (MPQC) for computing greatest common divisor (GCD) based on quantum multiparty private set union (PSU) by Liu, Yang, and Li.
  arXiv  Detail & Related papers  (2023-03-30T07:33:30Z)
• Realization of quantum signal processing on a noisy quantum computer [0.4593579891394288]
  We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. Our results are the first step in the experimental realization of QSP-based quantum algorithms.
  arXiv  Detail & Related papers  (2023-03-09T19:00:17Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Single-shot error mitigation by coherent Pauli checks [6.992823294269743]
  We show how to generate samples from the output distribution of a quantum circuit without full-blown error correction. Our approach is based on Coherent Pauli Checks that detect errors in a Clifford circuit.
  arXiv  Detail & Related papers  (2022-12-07T20:03:07Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Testing quantum computers with the protocol of quantum state matching [0.0]
  The presence of noise in quantum computers hinders their effective operation. We suggest the application of the so-called quantum state matching protocol for testing purposes. For systematically varied inputs we find that the device with the smaller quantum volume performs better on our tests than the one with larger quantum volume.
  arXiv  Detail & Related papers  (2022-10-18T08:25:34Z)
• Benchmarking multi-qubit gates -- I: Metrological aspects [0.0]
  benchmarking hardware errors in quantum computers has drawn significant attention lately. Existing benchmarks for digital quantum computers involve averaging the global fidelity over a large set of quantum circuits. We develop a new figure-of-merit suitable for multi-qubit quantum gates based on the reduced Choi matrix.
  arXiv  Detail & Related papers  (2022-10-09T19:36:21Z)
• 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)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)

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.