Optimized Clifford Noise Reduction: Theory, Simulations and Experiments

• URL: http://arxiv.org/abs/2504.13356v2
• Date: Tue, 05 Aug 2025 19:11:11 GMT
• Title: Optimized Clifford Noise Reduction: Theory, Simulations and Experiments
• Abstract summary: We propose several optimizations of the CliNR partial error correction scheme.<n>Errors are corrected by measuring a sequence of Pauli operators.<n>We show that our algorithms improve the performance of CliNR by 25%.
• Score: 2.685668802278156
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose several optimizations of the CliNR partial error correction scheme which implements Clifford circuits by consuming a resource state. Errors are corrected by measuring a sequence of Pauli operators that we refer to as the verification sequence. We first propose a global optimization algorithm searching for a verification sequence resulting in a low logical error rate using tabu search. Then, we introduce a proxy for the logical error rate which is easier to evaluate and we design a two-step optimization algorithm. First, a verification sequence minimizing the proxy is computed, then this sequence is refined by reintroducing the logical error rate. Finally, we identify a large group of automorphisms of the search space which preserve the proxy and we use this symmetry to reduce the size of the search space. This results in a 168 $\times$ (respectively 20,160 $\times$) reduction of the size of the search space for the optimization of verification sequences with three (respectively four) Pauli operators. Our numerical simulations for 20-qubit Clifford circuits with size 400 under the ion chain model show that our optimization algorithms improve the performance of CliNR by 25% and that the two-step optimization achieves the same results as the global optimization with 64% fewer evaluations of the logical error rate. Finally, we perform experiments on a 36-qubit trapped ion quantum computer, without mid-circuit measurements, showing that the CZNR variant of CliNR is at breakeven.

Related papers

• LLM-Driven Evolutionary Generation of Multi-Objective Bayesian Optimization Algorithms [2.012877764904354]
  We use large language models as mutation and crossover operators within evolutionary strategies to generate complete algorithm implementations.<n>Across nine evolutionary runs we generated approximately 900 algorithms and benchmarked them on twelve synthetic problems and three real-world engineering problems.
  arXiv  Detail & Related papers  (2026-07-06T08:44:13Z)
• S-LCG: Structured Linear Congruential Generator-Based Deterministic Algorithm for Search and Optimization [3.033196534183858]
  This study presents a novel deterministic optimization algorithm based on a special variant of the Linear Congruential Generator (LCG)<n>It is motivated by the intrinsic structure of the generator, the reason behind naming it the Structured Linear Congruential Generator (S- LCG)
  arXiv  Detail & Related papers  (2026-05-06T17:57:41Z)
• Tiered Acquisition for Constrained Bayesian Optimization: An Application to Analog Circuits [5.353688923855625]
  We propose a novel Bayesian optimization algorithm with a tiered ensemble of acquisition functions.<n>The method is validated in gain and area optimization of a two-stage Miller compensated operational amplifier in a 65 nm technology.<n>In comparison to robust baselines and state-of-the-art algorithms, this method reduces constraint violations by up to 38% and improves the target objective by up to 43%.
  arXiv  Detail & Related papers  (2024-12-23T07:41:43Z)
• Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization [32.939120407900035]
  Our algorithms feature a simple update rule that requires solving only one linear system per iteration. We also evaluate the practical performance of our algorithm by comparing it to existing second-order algorithms for minimax optimization.
  arXiv  Detail & Related papers  (2024-06-04T06:56:41Z)
• A Pure Quantum Approximate Optimization Algorithm Based on CNR Operation [0.0]
  We propose a general-purpose pure quantum approximate optimization algorithm. The algorithm is constructed to a $p$-level divide-and-conquer structure. We show the algorithm performance in detail when the required qubits number of the two optimization problems is 10.
  arXiv  Detail & Related papers  (2023-10-27T06:54:39Z)
• Stochastic Optimization for Non-convex Problem with Inexact Hessian Matrix, Gradient, and Function [99.31457740916815]
  Trust-region (TR) and adaptive regularization using cubics have proven to have some very appealing theoretical properties. We show that TR and ARC methods can simultaneously provide inexact computations of the Hessian, gradient, and function values.
  arXiv  Detail & Related papers  (2023-10-18T10:29:58Z)
• Using Differential Evolution to avoid local minima in Variational Quantum Algorithms [0.0]
  Variational Quantum Algorithms (VQAs) are among the most promising NISQ-era algorithms for harnessing quantum computing. Our goal in this paper is to study alternative optimization methods that can avoid or reduce the effect of local minima and barren plateau problems.
  arXiv  Detail & Related papers  (2023-03-21T20:31:06Z)
• Explicit Second-Order Min-Max Optimization Methods with Optimal Convergence Guarantee [86.05440220344755]
  We propose and analyze inexact regularized Newton-type methods for finding a global saddle point of emphcon unconstrained min-max optimization problems. We show that the proposed methods generate iterates that remain within a bounded set and that the iterations converge to an $epsilon$-saddle point within $O(epsilon-2/3)$ in terms of a restricted function.
  arXiv  Detail & Related papers  (2022-10-23T21:24:37Z)
• Size optimization of CNOT circuits on NISQ [13.391818915679796]
  We study the optimization of the CNOT circuits on some noisy intermediate-scale quantum(NISQ) devices. We implement our algorithm on IBM20 and some other NISQ devices, the results are better than most other methods in our experiment.
  arXiv  Detail & Related papers  (2022-10-11T06:44:04Z)
• Efficient Non-Parametric Optimizer Search for Diverse Tasks [93.64739408827604]
  We present the first efficient scalable and general framework that can directly search on the tasks of interest. Inspired by the innate tree structure of the underlying math expressions, we re-arrange the spaces into a super-tree. We adopt an adaptation of the Monte Carlo method to tree search, equipped with rejection sampling and equivalent- form detection.
  arXiv  Detail & Related papers  (2022-09-27T17:51:31Z)
• Provable Stochastic Optimization for Global Contrastive Learning: Small Batch Does Not Harm Performance [53.49803579981569]
  We consider a global objective for contrastive learning, which contrasts each positive pair with all negative pairs for an anchor point. Existing methods such as SimCLR requires a large batch size in order to achieve a satisfactory result. We propose a memory-efficient optimization algorithm for solving the Global Contrastive Learning of Representations, named SogCLR.
  arXiv  Detail & Related papers  (2022-02-24T22:16:53Z)
• Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits [99.70167985955352]
  We study the problem of zero-order optimization of a strongly convex function. We consider a randomized approximation of the projected gradient descent algorithm. Our results imply that the zero-order algorithm is nearly optimal in terms of sample complexity and the problem parameters.
  arXiv  Detail & Related papers  (2020-06-14T10:42:23Z)
• Convergence of adaptive algorithms for weakly convex constrained optimization [59.36386973876765]
  We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope. Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
  arXiv  Detail & Related papers  (2020-06-11T17:43:19Z)

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.