Gradient descent reliably finds depth- and gate-optimal circuits for generic unitaries

• URL: http://arxiv.org/abs/2601.03123v1
• Date: Tue, 06 Jan 2026 15:54:24 GMT
• Title: Gradient descent reliably finds depth- and gate-optimal circuits for generic unitaries
• Authors: Janani Gomathi, Alex Meiburg,
• Abstract summary: We show that simple gradient descent reliably finds depth- and gate-optimal circuits for generic unitaries.<n>We show that this discrepancy can be explained by avoiding the random selection of certain parameter-deficient circuit skeletons.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: When the gate set has continuous parameters, synthesizing a unitary operator as a quantum circuit is always possible using exact methods, but finding minimal circuits efficiently remains a challenging problem. The landscape is very different for compiled unitaries, which arise from programming and typically have short circuits, as compared with generic unitaries, which use all parameters and typically require circuits of maximal size. We show that simple gradient descent reliably finds depth- and gate-optimal circuits for generic unitaries, including in the presence of restricted chip connectivity. This runs counter to earlier evidence that optimal synthesis required combinatorial search, and we show that this discrepancy can be explained by avoiding the random selection of certain parameter-deficient circuit skeletons.

Related papers

• Beyond Reinforcement Learning: Fast and Scalable Quantum Circuit Synthesis [2.2632495210933135]
  Quantum unitary synthesis addresses the problem of translating quantum algorithms into sequences of hardware-executable gates.<n>Existing approaches suffer from misaligned optimization objectives, substantial training costs and limited generalization across different qubit counts.<n>We mitigate these limitations by using supervised learning to approximate the minimum description of residual unitaries and combining this estimate with beam search to identify near optimal gate sequences.
  arXiv  Detail & Related papers  (2026-02-16T19:43:43Z)
• Optimized Compilation of Logical Clifford Circuits [41.67570087491999]
  Gate-by-gate compilation often yields deep circuits.<n>We focus on the compilation of primitives from quantum simulation as single blocks.<n>We introduce a methodology that lifts these primitives into size-invariant, depth-efficient compilation strategies.
  arXiv  Detail & Related papers  (2026-02-13T11:35:11Z)
• Unitary Synthesis with AlphaZero via Dynamic Circuits [0.0]
  Unitary synthesis is the process of decomposing a target unitary transformation into a sequence of quantum gates.<n>We propose an approach using an AlphaZero-inspired reinforcement-learning agent for the exact compilation of unitaries.<n>The approach achieves low inference time and proves versatile across different gate sets, and qubit connectivities.
  arXiv  Detail & Related papers  (2025-08-28T21:15:28Z)
• Cutoff Theorems for the Equivalence of Parameterized Quantum Circuits (Extended) [0.0]
  Most quantum circuits are not verified, so this procedure is known to be error-prone.<n>We propose a cutoff-based procedure which reduces the problem of verifying the equivalence of parameterized quantum circuits.<n>We show that our techniques extend to equivalence modulo global phase, and describe an efficient angle sampling procedure for cyclotomic gate sets.
  arXiv  Detail & Related papers  (2025-06-26T03:58:51Z)
• Provably optimal exact gate synthesis from a discrete gate set [0.0]
  We propose a method for exact circuit synthesizing using a discrete gate set.<n>Our approach translates the problem of a gate specified by its unitary matrix into a satisfiability (SAT) instance.
  arXiv  Detail & Related papers  (2025-03-19T17:32:29Z)
• Optimization Driven Quantum Circuit Reduction [20.697821016522358]
  We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality.<n>The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support.<n>We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
  arXiv  Detail & Related papers  (2025-02-20T16:41:10Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization [0.8341988468339112]
  Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing.<n>We leverage search-based methods to first approximately diagonalize a unitary, then perform the inversion analytically.<n>Our approach improves both the implementation precision and run time of synthesis algorithms by orders of magnitude when evaluated on unitaries from real quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-31T12:10:32Z)
• Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
  CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
  arXiv  Detail & Related papers  (2024-08-07T19:51:22Z)
• Finding Transformer Circuits with Edge Pruning [71.12127707678961]
  We propose Edge Pruning as an effective and scalable solution to automated circuit discovery.<n>Our method finds circuits in GPT-2 that use less than half the number of edges compared to circuits found by previous methods.<n>Thanks to its efficiency, we scale Edge Pruning to CodeLlama-13B, a model over 100x the scale that prior methods operate on.
  arXiv  Detail & Related papers  (2024-06-24T16:40:54Z)
• Adaptive Planning Search Algorithm for Analog Circuit Verification [53.97809573610992]
  We propose a machine learning (ML) approach, which uses less simulations. We show that the proposed approach is able to provide OCCs closer to the specifications for all circuits.
  arXiv  Detail & Related papers  (2023-06-23T12:57:46Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers [45.66259474547513]
  We design quantum circuits by using the standard cell approach borrowed from classical circuit design. We present evidence that, when compared with automatic routing methods, our layout-aware routers are significantly faster and achieve shallower 3D circuits.
  arXiv  Detail & Related papers  (2022-06-10T10:54:46Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.