Fault-tolerant Preparation of Distant Logical Bell Pair -- with application in the magic square game

• URL: http://arxiv.org/abs/2503.13673v1
• Date: Mon, 17 Mar 2025 19:24:49 GMT
• Title: Fault-tolerant Preparation of Distant Logical Bell Pair -- with application in the magic square game
• Authors: Andy Zeyi Liu, Debbie Leung,
• Abstract summary: We study the impact of low noise on quantum nonlocality in nonlocal games.<n>We introduce an interface circuit and logical entanglement protocol purification (EPP) to efficiently translate between physical and logical qubits.<n>Our framework is adaptable to various quantum error-correcting codes (QECCs) and experimental platforms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Measures of quantum nonlocality traditionally assume perfect local computation. In real experiments, however, each computational primitive is imperfect. Fault-tolerant techniques enable arbitrarily accurate quantum computation but do not necessarily preserve optimized measures of nonlocality. We examine the impact of low noise on quantum nonlocality in nonlocal games, where even small imperfections can disproportionately increase entanglement consumption. Focusing on the fault-tolerant magic square game, we optimize the tradeoff between noisy entanglement consumption and deficit in the game value. We introduce an interface circuit and logical entanglement purification protocol (EPP) to efficiently translate states between physical and logical qubits and purify noisy logical Bell pair, reducing Bell pair consumption. Our analytical and numerical results, particularly for the $[[7^k,1,3^k]]$ concatenated Steane code, demonstrate exponential Bell pair savings and a higher noise threshold. We establish theoretical lower bounds for local noise threshold of $4.70\times10^{-4}$ and an initial Bell pair infidelity threshold of $18.3\%$. Our framework is adaptable to various quantum error-correcting codes (QECCs) and experimental platforms. This work not only advances fault-tolerant nonlocal games but also inspires further research on interfacing different QECCs, fostering modular quantum architectures and the quantum internet.

Related papers

• Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks [1.6249398255272316]
  Two novel lattice surgery-based protocols are introduced to establish logical Bell states between distant nodes.<n>In the local protocol, the intermediary node creates and directly transmits the logical Bell states to quantum memories.<n>The non-local protocol distributes auxiliary Bell states, merging boundaries between pre-existing codes in the quantum memories.
  arXiv  Detail & Related papers  (2024-12-02T12:16:28Z)
• Generating multipartite nonlocality to benchmark quantum computers [0.0]
  We show that quantum computers can be used for producing large $n$-partite nonlocality.<n>This allows one, in return, to benchmark nonclassical correlations regardless of the number of qubits or the connectivity.
  arXiv  Detail & Related papers  (2024-06-11T19:03:35Z)
• 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)
• 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)
• Hybrid noise protection of logical qubits for universal quantum computation [0.0]
  We present a model of universal quantum computation that has many advantages over strategies that require a large overhead. We separate collective noise from individual noises on physical qubits and use a decoherence-free subspace. We are able to either use a steady global magnetic field or to devise a set of DD pulses that remove much of the remaining noise.
  arXiv  Detail & Related papers  (2023-06-27T02:09:14Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Hybrid quantum gap estimation algorithm using a filtered time series [0.0]
  We prove that classical post-processing, i.e., long-time filtering of an offline time series, exponentially improves the circuit depth needed for quantum time evolution. We apply the filtering method to the construction of a hybrid quantum-classical algorithm to estimate energy gap. Our findings set the stage for unbiased quantum simulation to offer memory advantage in the near term.
  arXiv  Detail & Related papers  (2022-12-28T18:59:59Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Protecting coherence from the environment via Stark many-body localization in a Quantum-Dot Simulator [0.0]
  We show that a magnetic field gradient can be implemented in a semiconductor quantum dot array to induce a local quantum coherent dynamical $ell-$bit. These $ell-$bits are responsible for the model being many-body localized. We show that these dynamical $ell-$bits and the corresponding many-body localization are protected from all noises, including phonons, for sufficiently long times if electron-phonon interaction is not non-local.
  arXiv  Detail & Related papers  (2022-04-28T08:50:45Z)
• Towards Demonstrating Fault Tolerance in Small Circuits Using Bacon-Shor Codes [5.352699766206807]
  We study a next step - fault-tolerantly implementing quantum circuits. We compute pseudo-thresholds for the Pauli error rate $p$ in a depolarizing noise model. We see that multiple rounds of stabilizer measurements give an improvement over performing a single round at the end.
  arXiv  Detail & Related papers  (2021-08-04T14:24:14Z)
• 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)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

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.