On approximate quantum error correction for symmetric noise

• URL: http://arxiv.org/abs/2507.12326v1
• Date: Wed, 16 Jul 2025 15:20:07 GMT
• Title: On approximate quantum error correction for symmetric noise
• Authors: Gereon Koßmann, Julius A. Zeiss, Omar Fawzi, Mario Berta,
• Abstract summary: We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al.<n>In particular, we combine noise symmetries - such as those present in multiple copies of the qubit depolarizing channel - with the permutational symmetry arising from the extendability of the optimization variable.<n>Our results contribute to narrowing the gap between theoretical developments in quantum information theory and their practical applications in the analysis of small-scale quantum error-correcting codes.
• Score: 8.099700053397278
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al. [Mathematical Programming, 1 - 49 (2021)], which provides converging outer bounds on the optimal fidelity of approximate quantum error correction (AQEC). As our first contribution, we introduce a measurement-based rounding scheme that extracts inner sequences of certifiably good encoder-decoder pairs from this outer hierarchy. To address the computational complexity of evaluating fixed levels of the hierarchy, we investigate the use of symmetry-based dimension reduction. In particular, we combine noise symmetries - such as those present in multiple copies of the qubit depolarizing channel - with the permutational symmetry arising from the extendability of the optimization variable. This framework is illustrated through basic, but already challenging numerical examples that showcase its practical effectiveness. Our results contribute to narrowing the gap between theoretical developments in quantum information theory and their practical applications in the analysis of small-scale quantum error-correcting codes.

Related papers

• Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking [45.147301546565316]
  This paper considers the problem of decentralized optimization on compact submanifolds.<n>We propose an algorithm where agents update variables using quantized variables.<n>To the best of our knowledge, this is the first algorithm to achieve an $mathcalO (1/K)$ convergence rate in the presence of quantization.
  arXiv  Detail & Related papers  (2025-06-09T01:57:25Z)
• Multiparameter quantum estimation with Gaussian states: efficiently evaluating Holevo, RLD and SLD Cramér-Rao bounds [0.0]
  We introduce an efficient numerical method to evaluate the Holevo Cram'er-Rao bound (HCRB) for general Gaussian states.<n>We consider two paradigmatic applications, where the parameter dependence appears both in the first moments.
  arXiv  Detail & Related papers  (2025-04-24T18:19:56Z)
• Predicting symmetries of quantum dynamics with optimal samples [41.42817348756889]
  Identifying symmetries in quantum dynamics is a crucial challenge with profound implications for quantum technologies.<n>We introduce a unified framework combining group representation theory and subgroup hypothesis testing to predict these symmetries with optimal efficiency.<n>We prove that parallel strategies achieve the same performance as adaptive or indefinite-causal-order protocols.
  arXiv  Detail & Related papers  (2025-02-03T15:57:50Z)
• Group-theoretic error mitigation enabled by classical shadows and symmetries [2.378735224874938]
  Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in devices without quantum error correction. We develop a quantum error-mitigation strategy called symmetry-adjusted classical shadows'' Our results reveal symmetry-adjusted classical shadows as a low-cost strategy to mitigate errors from noisy quantum experiments in the ubiquitous presence of symmetry.
  arXiv  Detail & Related papers  (2023-10-04T18:00:02Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Optimizing one-axis twists for variational Bayesian quantum metrology [0.0]
  In particular, qubit phase estimation, or rotation sensing, appears as a ubiquitous problem with applications to electric field sensing, magnetometry, atomic clocks, and gyroscopes. We propose a new family of parametrized encoding and decoding protocols called arbitrary-axis twist ansatzes. We show that it can lead to a substantial reduction in the number of one-axis twists needed to achieve a target estimation error.
  arXiv  Detail & Related papers  (2022-12-23T16:45:15Z)
• 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)
• Quantum error mitigation for rotation symmetric bosonic codes with symmetry expansion [0.15077212427453812]
  We propose a class of quantum error mitigation that virtually projects the state onto the noise-free symmetric subspace.<n>We show that symmetry expansion dramatically suppresses the effect of photon loss.<n>Our novel error mitigation method will significantly enhance computation accuracy in the near-term bosonic quantum computing paradigm.
  arXiv  Detail & Related papers  (2022-11-11T12:33:11Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries [1.2183405753834557]
  We analytically study the most essential cases of $U(1)$ and $SU(d)$ symmetries. We show that for both symmetry groups the error of the covariant codes generated by Haar-random symmetric unitaries, typically scale as $O(n-1)$ in terms of both the average- and worst-case distances against erasure noise.
  arXiv  Detail & Related papers  (2021-12-02T18:46:34Z)
• 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)
• Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries [2.517903855792476]
  We introduce an application-specific approach for mitigating the errors in QAOA evolution by leveraging the symmetries present in the classical objective function to be optimized. Specifically, the QAOA state is projected into the symmetry-restricted subspace, with projection being performed either at the end of the circuit or throughout the evolution. Our approach improves the fidelity of the QAOA state, thereby increasing both the accuracy of the sample estimate of the QAOA objective and the probability of sampling the binary string corresponding to that objective value.
  arXiv  Detail & Related papers  (2021-06-08T14:40:48Z)
• Quantum Error Mitigation using Symmetry Expansion [0.0]
  Noise remains the biggest challenge for the practical applications of any near-term quantum devices. We develop a general framework named symmetry expansion which provides a wide spectrum of symmetry-based error mitigation schemes. We show that certain symmetry expansion schemes can achieve a smaller estimation bias than symmetry verification.
  arXiv  Detail & Related papers  (2021-01-08T18:30:48Z)

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.