Optimal synthesis into fixed XX interactions

• URL: http://arxiv.org/abs/2111.02535v3
• Date: Thu, 21 Apr 2022 16:27:51 GMT
• Title: Optimal synthesis into fixed XX interactions
• Abstract summary: We describe an optimal procedure, as well as its efficient software implementation, for exact and approximate synthesis of two-qubit unitary operations. We analyze which small sets of XX-type interactions cause the greatest improvement in expected infidelity under experimentally-motivated error models.
• Score: 1.6443454853415052
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We describe an optimal procedure, as well as its efficient software implementation, for exact and approximate synthesis of two-qubit unitary operations into any prescribed discrete family of XX-type interactions and local gates. This arises from the analysis and manipulation of certain polyhedral subsets of the space of canonical gates. Using this, we analyze which small sets of XX-type interactions cause the greatest improvement in expected infidelity under experimentally-motivated error models. For the exact circuit synthesis of Haar-randomly selected two-qubit operations, we find an improvement in estimated infidelity by ~31.4% when including alongside CX its square- and cube-roots, near to the optimal limit of ~36.9% obtained by including all fractional applications of CX.

Related papers

• COMET: Combinatorial Optimization for Multiplex Editing Targets Via Constraint-Preserving QAOA [0.010923877073891442]
  Multiplex CRISPR-Cas9 gene editing requires selecting one guide RNA per target gene subject to cross-gene interactions.<n>The one-hot per-gene constraint is conventionally enforced by adding penalty terms to the cost Hamiltonian.<n>An alternative is to enforce the constraint structurally via the XY-mixer, which preserves feasibility by construction.
  arXiv  Detail & Related papers  (2026-07-02T08:37:59Z)
• 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)
• Sub-Cubic Quantum Gate Synthesis via Stochastic Commutator Decomposition [0.0]
  Commutator Synthesis is a quantum gate compilation framework.<n>It integrates Kuperberg's sub-cubic Solovay-Kitaev exponent c near 1.44042 with the error-tailoring machinery of randomized compilation.
  arXiv  Detail & Related papers  (2026-05-03T20:41:21Z)
• Loop-Extrusion Linkage: Spectral Ordering and Interval-Based Structure Discovery for Continuous Optimization [0.0]
  We introduce the Loop-Extrusion (LEL) operator, a structure-learning wrapper that combines adaptive variable-inter estimation, spectral seriation via the Fiedler vector, and adaptive interval-based subspace search.<n>We evaluate LEL on six diagnostic functions at d=96 designed to modulated specific structural hypotheses.<n>Results are assessed via the Wilcoxon signed-rank test with Holm-Bonferroni correction and Vargha-Delaney A12 effect sizes.
  arXiv  Detail & Related papers  (2026-04-05T21:26:21Z)
• Differentiable Logic Synthesis: Spectral Coefficient Selection via Sinkhorn-Constrained Composition [0.0]
  We introduce Hierarchical Spectral Composition, a differentiable architecture that selects spectral coefficients from a frozen Fourier basis.<n>We adapt this framework to logic synthesis, adding column-sign modulation to enable Boolean negation.
  arXiv  Detail & Related papers  (2026-01-20T13:26:52Z)
• Optimal Transportation and Alignment Between Gaussian Measures [80.4634530260329]
  Optimal transport (OT) and Gromov-Wasserstein (GW) alignment provide interpretable geometric frameworks for datasets.<n>Because these frameworks are computationally expensive, large-scale applications often rely on closed-form solutions for Gaussian distributions under quadratic cost.<n>This work provides a comprehensive treatment of Gaussian, quadratic cost OT and inner product GW (IGW) alignment, closing several gaps in the literature to broaden applicability.
  arXiv  Detail & Related papers  (2025-12-03T09:01:48Z)
• ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions [91.31596562378076]
  ECPv2 is a scalable and theoretically grounded algorithm for global optimization of Lipschitz-continuous functions with unknown Lipschitzs.<n>We show that ECPv2 retains ECP's no-regret guarantees with optimal-time bounds and expands the acceptance region with these findings.
  arXiv  Detail & Related papers  (2025-11-20T17:30:55Z)
• Rate optimal learning of equilibria from data [63.14746189846806]
  We close theoretical gaps in Multi-Agent Imitation Learning (MAIL) by characterizing the limits of non-interactive MAIL and presenting the first interactive algorithm with near-optimal sample complexity.<n>For the interactive setting, we introduce a framework that combines reward-free reinforcement learning with interactive MAIL and instantiate it with an algorithm, MAIL-WARM.<n>We provide numerical results that support our theory and illustrate, in environments such as grid worlds, where Behavior Cloning fails to learn.
  arXiv  Detail & Related papers  (2025-10-10T12:28:35Z)
• Path Integral Optimiser: Global Optimisation via Neural Schrödinger-Föllmer Diffusion [1.8195082751200438]
  We present an early investigation into the use of neural diffusion processes for global optimisation.<n>One can use the Boltzmann distribution to formulate optimization as solving a Schr"odinger bridge sampling problem.<n>We provide theoretical bounds for this optimiser, results on toy tasks, and a summary of the theory motivating the model.
  arXiv  Detail & Related papers  (2025-06-07T14:46:18Z)
• Optimized Clifford Noise Reduction: Theory, Simulations and Experiments [2.685668802278156]
  We propose several optimizations of the CliNR partial error correction scheme. Errors are corrected by measuring a sequence of Pauli operators. We show that our algorithms improve the performance of CliNR by 25%.
  arXiv  Detail & Related papers  (2025-04-17T21:47:38Z)
• Decomposition-Based Optimal Bounds for Privacy Amplification via Shuffling [6.702635586444281]
  Shuffling has been shown to amplify differential privacy guarantees, enabling a more favorable privacy-utility trade-off.<n>We introduce a unified analytical framework--the general clone paradigm--which subsumes all possible decompositions.<n>We develop a simple and efficient algorithm based on the Fast Fourier Transform (FFT) to compute optimal privacy amplification bounds.
  arXiv  Detail & Related papers  (2025-04-10T03:11:17Z)
• Make Optimization Once and for All with Fine-grained Guidance [78.14885351827232]
  Learning to Optimize (L2O) enhances optimization efficiency with integrated neural networks. L2O paradigms achieve great outcomes, e.g., refitting, generating unseen solutions iteratively or directly. Our analyses explore general framework for learning optimization, called Diff-L2O, focusing on augmenting solutions from a wider view.
  arXiv  Detail & Related papers  (2025-03-14T14:48:12Z)
• Simulating methylamine using symmetry adapted qubit-excitation-based variational quantum eigensolver [0.39462888523270856]
  We propose and analyze optimization strategies for the VQE algorithm that combine various methods. Best-performing optimization strategy reduces the number of two-qubit operations for simulating the methylamine molecule from 600,000 to approximately 12,000, using 26 qubits.
  arXiv  Detail & Related papers  (2025-01-28T15:55:32Z)
• On the Convergence of FedProx with Extrapolation and Inexact Prox [55.2480439325792]
  We investigate the behavior of FedExProx without the assumption that each client computes a certain operator exactly. We show that inexactness leads to convergence to a neighborhood of the solution. Our theoretical insights are validated through comprehensive numerical experiments.
  arXiv  Detail & Related papers  (2024-10-02T10:42:27Z)
• Peephole Optimization for Quantum Approximate Synthesis [0.4604003661048266]
  Peephole optimization of quantum circuits provides a method of leveraging standard circuit approaches into scalable quantum circuit optimization. We propose a series of improvements to the final phase of this architecture, which include the addition of error awareness and a better method of approximating the correctness of the result.
  arXiv  Detail & Related papers  (2024-09-09T19:22:42Z)
• A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization [53.14532968909759]
  We introduce an efficient single-loop primal-dual block-coordinate algorithm called ALEXR. We establish the convergence rates of ALEXR in both convex and strongly convex cases under smoothness and non-smoothness conditions. Experimental results on GDRO and partial Area Under the ROC Curve for cFCCO demonstrate the promising performance of our algorithm.
  arXiv  Detail & Related papers  (2023-12-04T19:00:07Z)
• Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms [64.10576998630981]
  We show the first tight characterization of the optimal Hessian-dependent sample complexity. A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances. The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
  arXiv  Detail & Related papers  (2023-06-21T17:03:22Z)
• Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient [51.37720227675476]
  We introduce a new variant of the Decision-Estimation Coefficient, and use it to derive new lower bounds that improve upon prior work on three fronts. We provide upper bounds on regret that scale with the same quantity, thereby closing all but one of the gaps between upper and lower bounds in Foster et al. Our results apply to both the regret framework and PAC framework, and make use of several new analysis and algorithm design techniques that we anticipate will find broader use.
  arXiv  Detail & Related papers  (2023-01-19T18:24:08Z)
• Probabilistic unitary synthesis with optimal accuracy [1.0923877073891446]
  unitary synthesis is to find a gate sequence that optimally approximates a target unitary transformation. We show that the optimality of current probabilistic synthesis algorithms is unknown. We construct an efficient probabilistic synthesis algorithm for single-qubit unitaries, rigorously estimate its time complexity, and show that it reduces the approximation error quadratically compared with deterministic algorithms.
  arXiv  Detail & Related papers  (2023-01-16T08:37:34Z)
• Tree ensemble kernels for Bayesian optimization with known constraints over mixed-feature spaces [54.58348769621782]
  Tree ensembles can be well-suited for black-box optimization tasks such as algorithm tuning and neural architecture search. Two well-known challenges in using tree ensembles for black-box optimization are (i) effectively quantifying model uncertainty for exploration and (ii) optimizing over the piece-wise constant acquisition function. Our framework performs as well as state-of-the-art methods for unconstrained black-box optimization over continuous/discrete features and outperforms competing methods for problems combining mixed-variable feature spaces and known input constraints.
  arXiv  Detail & Related papers  (2022-07-02T16:59:37Z)
• Bayesian Optimization with High-Dimensional Outputs [42.311308135418805]
  In practice, we often wish to optimize objectives defined over many correlated outcomes (or tasks) We devise an efficient technique for exact multi-task GP sampling that combines exploiting Kronecker structure in the covariance matrices with Matheron's identity. We demonstrate how this unlocks a new class of applications for Bayesian Optimization across a range of tasks in science and engineering.
  arXiv  Detail & Related papers  (2021-06-24T13:15:12Z)
• Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator [75.05106948314956]
  We show that an increasing large momentum parameter for the first-order moment is sufficient for adaptive scaling. We also give insights for increasing the momentum in a stagewise manner in accordance with stagewise decreasing step size.
  arXiv  Detail & Related papers  (2021-04-30T08:50:24Z)
• Empirical performance bounds for quantum approximate optimization [0.27998963147546135]
  Quantifying performance bounds provides insight into when QAOA may be viable for solving real-world applications. We find QAOA exceeds the Goemans-Williamson approximation ratio bound for most graphs. The resulting data set is presented as a benchmark for establishing empirical bounds on QAOA performance.
  arXiv  Detail & Related papers  (2021-02-12T23:12:09Z)
• Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions [73.33961743410876]
  A soft-max function has two main efficiency measures: approximation and smoothness. We identify the optimal approximation-smoothness tradeoffs for different measures of approximation and smoothness. This leads to novel soft-max functions, each of which is optimal for a different application.
  arXiv  Detail & Related papers  (2020-10-22T05:19:58Z)
• Extracting Optimal Solution Manifolds using Constrained Neural Optimization [6.800113407368289]
  Constrained Optimization solution algorithms are restricted to point based solutions. We present an approach for extracting optimal sets as approximate, where unmodified non-informed constraints are defined.
  arXiv  Detail & Related papers  (2020-09-13T15:37:44Z)

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.