Toward Fault-Tolerant Variational Optimization: QAOA under [[4,2,2]] Error Detection

• URL: http://arxiv.org/abs/2609.07537v1
• Date: Mon, 07 Sep 2026 14:20:42 GMT
• Title: Toward Fault-Tolerant Variational Optimization: QAOA under [[4,2,2]] Error Detection
• Abstract summary: We present a fault-tolerant implementation of QAOA based on the $[[4,2,2]]$ error-detection code.<n>Our main contribution is a novel ancilla-mediated logical $R_ZZ$ gate enabling interactions between qubits in different $[[4,2,2]]$ blocks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a partially fault-tolerant implementation of QAOA based on the $[[4,2,2]]$ error-detection code, targeting the Max-Cut problem on a square graph. Our main contribution is a novel ancilla-mediated logical $R_{ZZ}$ gate enabling interactions between qubits in different $[[4,2,2]]$ blocks. We evaluate unencoded and encoded circuits under five noise models, with both all-to-all and grid-routed connectivity, using the Cirq and qsimcirq frameworks with parallel CPU execution. Post-selection on stabilizer measurements consistently improves the probability of sampling optimal bitstrings, with five measurements providing the strongest benefit. These results support error-detection as a practical near-term strategy for improving the quality of variational quantum algorithms.

Related papers

• Efficient Circuit Transpilation of Commuting Gates on 2D Grids [0.21485350418225238]
  We propose a transpilation scheme for circuits consisting of blocks of commuting two-qubit gates on two-dimensional lattices.<n>We benchmark our approach on QAOA instances for Maximum Cut (MC) on Random Regular graphs and Maximum Independent Set (MIS) on Erds-Rényi graphs.<n>Compared to standard methods, we reduce circuit depth and gate count by about a factor of two, enabling experiments with up to $80$ qubits and improving approximation ratios by up to $6.6%$ for MC and $9.3%$ for MIS.
  arXiv  Detail & Related papers  (2026-07-11T12:09:27Z)
• Optimizing Qubit Mapping with Quasi-Orthogonal Space-Time Block Codes and Quaternion Orthogonal Designs [1.25828876338076]
  This study explores the qubit mapping through the integration of Quasi-Orthogonal Space-Time Block Codes (QOSTBCs) with Quaternion Orthogonal Designs (QODs) in quantum error correction frameworks.
  arXiv  Detail & Related papers  (2024-12-09T01:58:37Z)
• Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping [2.6447353939786296]
  Noise-Directed Remapping (NDAR) is a algorithm for approximately solving binary optimization problems by leveraging certain types of noise.<n>We consider access to a noisy quantum processor with dynamics that features a global attractor state.<n>Our algorithm bootstraps the noise attractor state by iteratively gauge-transforming the cost-function Hamiltonian in a way that transforms the noise attractor into higher-quality solutions.
  arXiv  Detail & Related papers  (2024-04-01T18:28:57Z)
• 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)
• Improved Qubit Routing for QAOA Circuits [0.0]
  We develop a qubit routing algorithm with classical run time for the Quantum Approximate Optimization Algorithm (QAOA) We show that it improves upon existing state-of-the-art routing algorithms for QAOA circuits defined on $k$-regular as well as Erd"os-Renyi problem graphs of sizes up to $N leq 400$.
  arXiv  Detail & Related papers  (2023-12-26T10:26:10Z)
• Using non-convex optimization in quantum process tomography: Factored gradient descent is tough to beat [11.893324664457552]
  Our algorithm converges faster and achieves higher fidelities than state the art, both in terms of settings and noise tolerance. We find our algorithm converges faster and achieves higher fidelities than state the art, both in terms of settings and noise tolerance.
  arXiv  Detail & Related papers  (2023-12-03T07:44:17Z)
• Distributed Extra-gradient with Optimal Complexity and Communication Guarantees [60.571030754252824]
  We consider monotone variational inequality (VI) problems in multi-GPU settings where multiple processors/workers/clients have access to local dual vectors. Extra-gradient, which is a de facto algorithm for monotone VI problems, has not been designed to be communication-efficient. We propose a quantized generalized extra-gradient (Q-GenX), which is an unbiased and adaptive compression method tailored to solve VIs.
  arXiv  Detail & Related papers  (2023-08-17T21:15:04Z)
• Contextual Combinatorial Bandits with Probabilistically Triggered Arms [55.9237004478033]
  We study contextual bandits with probabilistically triggered arms (C$2$MAB-T) under a variety of smoothness conditions. Under the triggering modulated (TPM) condition, we devise the C$2$-UC-T algorithm and derive a regret bound $tildeO(dsqrtT)$.
  arXiv  Detail & Related papers  (2023-03-30T02:51:00Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits [118.22458816174144]
  We propose a novel robust elimination-type algorithm that runs in epochs, combines exploration with infrequent switching to select a small subset of actions, and plays each action for multiple time instants. Our algorithm, GP Robust Phased Elimination (RGP-PE), successfully balances robustness to corruptions with exploration and exploitation. We perform the first empirical study of robustness in the corrupted GP bandit setting, and show that our algorithm is robust against a variety of adversarial attacks.
  arXiv  Detail & Related papers  (2022-02-03T21:19:36Z)
• Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach [94.37521840642141]
  We study the correlation clustering problem using the quantum approximate optimization algorithm (QAOA) and qudits. Specifically, we consider a neutral atom quantum computer and propose a full stack approach for correlation clustering. We show the qudit implementation is superior to the qubit encoding as quantified by the gate count.
  arXiv  Detail & Related papers  (2021-06-22T11:07:38Z)
• Quantum optimization via four-body Rydberg gates [0.0]
  We propose and analyze a fast, high fidelity four-body Rydberg parity gate. Our gate relies on onetime-optimized adiabatic laser pulses and is fully programmable by adjusting two hold-times during operation. We demonstrate an implementation of the quantum approximate optimization algorithm (QAOA) for a small scale test problem.
  arXiv  Detail & Related papers  (2021-06-04T18:33:09Z)
• Byzantine-Resilient Non-Convex Stochastic Gradient Descent [61.6382287971982]
  adversary-resilient distributed optimization, in which. machines can independently compute gradients, and cooperate. Our algorithm is based on a new concentration technique, and its sample complexity. It is very practical: it improves upon the performance of all prior methods when no. setting machines are present.
  arXiv  Detail & Related papers  (2020-12-28T17:19:32Z)

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.