Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets

• URL: http://arxiv.org/abs/2505.00543v1
• Date: Thu, 01 May 2025 14:13:13 GMT
• Title: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets
• Authors: Evan McKinney, Lev S. Bishop,
• Abstract summary: We present a segmented Cartan trajectory method that compiles arbitrary two-qubit unitaries into native gate sets.<n> GULPS provides a scalable, ISA-aware compilation strategy suitable for integration into platforms like Qiskit.
• Score: 0.7468717050144966
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present GULPS (Global Unitary Linear Programming Synthesis), a segmented Cartan trajectory method that compiles arbitrary two-qubit unitaries into native gate sets by decomposing the synthesis problem into locally solvable sub-problems. Each segment corresponds to a depth-2 circuit synthesized from a linear program over canonical gate invariants, subject to quantum Littlewood-Richardson (QLR) constraints. The intermediate invariants are stitched together via nonlinear least-squares optimization to recover the local operations between segments. This hybrid LP-numerical method enables robust synthesis across parameterized instruction sets. As quantum hardware continues to evolve, GULPS provides a scalable, ISA-aware compilation strategy suitable for integration into platforms like Qiskit.

Related papers

• Joint Transmit and Pinching Beamforming for Pinching Antenna Systems (PASS): Optimization-Based or Learning-Based? [89.05848771674773]
  A novel antenna system ()-enabled downlink multi-user multiple-input single-output (MISO) framework is proposed.<n>It consists of multiple waveguides, which equip numerous low-cost antennas, named (PAs)<n>The positions of PAs can be reconfigured to both spanning large-scale path and space.
  arXiv  Detail & Related papers  (2025-02-12T18:54:10Z)
• Noise-Aware Circuit Compilations for a Continuously Parameterized Two-Qubit Gateset [0.40991783970979595]
  We use the Quantum Scientific Computing Open User Testbed (QSCOUT) to study noise-aware compilations. We discuss the realization of $mathcalZZ$ gates with arbitrary angle on the all-to-all connected trapped-ion system. We demonstrate these compilation approaches on the hardware with randomized quantum volume circuits.
  arXiv  Detail & Related papers  (2024-11-02T00:46:51Z)
• Automated Placement of Analog Integrated Circuits using Priority-based Constructive Heuristic [0.0]
  We focus on the specific class of analog placement, which requires so-called pockets, their possible merging, and parametrizable minimum distances between devices. Our solution minimizes the perimeter of the circuit's bounding box and the approximated wire length. We show the quality of the proposed method on both synthetically generated and real-life industrial instances accompanied by manually created designs.
  arXiv  Detail & Related papers  (2024-10-18T07:16:59Z)
• Variable Substitution and Bilinear Programming for Aligning Partially Overlapping Point Sets [48.1015832267945]
  This research presents a method to meet requirements through the minimization objective function of the RPM algorithm. A branch-and-bound (BnB) algorithm is devised, which solely branches over the parameters, thereby boosting convergence rate. Empirical evaluations demonstrate better robustness of the proposed methodology against non-rigid deformation, positional noise, and outliers, when compared with prevailing state-of-the-art transformations.
  arXiv  Detail & Related papers  (2024-05-14T13:28:57Z)
• Enhancing Quantum Optimization with Parity Network Synthesis [0.0]
  We propose a pair of algorithms for parity network synthesis and linear circuit inversion. Together, these algorithms can build the diagonal component of the QAOA circuit, generally the most expensive in terms of two qubit gates.
  arXiv  Detail & Related papers  (2024-02-16T22:11:52Z)
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors [5.012570785656963]
  Dynamically field-programmable qubit arrays (DPQA) have emerged as a promising platform for quantum information processing. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements. We show that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture.
  arXiv  Detail & Related papers  (2023-06-06T08:13:10Z)
• Fully Stochastic Trust-Region Sequential Quadratic Programming for Equality-Constrained Optimization Problems [62.83783246648714]
  We propose a sequential quadratic programming algorithm (TR-StoSQP) to solve nonlinear optimization problems with objectives and deterministic equality constraints. The algorithm adaptively selects the trust-region radius and, compared to the existing line-search StoSQP schemes, allows us to utilize indefinite Hessian matrices.
  arXiv  Detail & Related papers  (2022-11-29T05:52:17Z)
• Optimization-based Block Coordinate Gradient Coding for Mitigating Partial Stragglers in Distributed Learning [58.91954425047425]
  This paper aims to design a new gradient coding scheme for mitigating partial stragglers in distributed learning. We propose a gradient coordinate coding scheme with L coding parameters representing L possibly different diversities for the L coordinates, which generates most gradient coding schemes.
  arXiv  Detail & Related papers  (2022-06-06T09:25:40Z)
• Efficient quantum gate decomposition via adaptive circuit compression [0.0]
  The utilization of parametric two-qubit gates in the circuit design allows us to transform the discrete problem of circuit synthesis into an optimization problem over continuous variables. We implemented the algorithm in the SQUANDER software package and benchmarked it against several state-of-the-art quantum gate synthesis tools.
  arXiv  Detail & Related papers  (2022-03-08T22:29:31Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Unfolding Projection-free SDP Relaxation of Binary Graph Classifier via GDPA Linearization [59.87663954467815]
  Algorithm unfolding creates an interpretable and parsimonious neural network architecture by implementing each iteration of a model-based algorithm as a neural layer. In this paper, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we unroll a projection-free algorithm for semi-definite programming relaxation (SDR) of a binary graph. Experimental results show that our unrolled network outperformed pure model-based graph classifiers, and achieved comparable performance to pure data-driven networks but using far fewer parameters.
  arXiv  Detail & Related papers  (2021-09-10T07:01:15Z)

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.