Optimizing Quantum Compilation via High-Level Quantum Instructions

• URL: http://arxiv.org/abs/2510.24323v1
• Date: Tue, 28 Oct 2025 11:44:38 GMT
• Title: Optimizing Quantum Compilation via High-Level Quantum Instructions
• Authors: Evandro C. R. Rosa, Jerusa Marchi, Eduardo I. Duzzioni, Rafael de Santiago,
• Abstract summary: We show how a high-level programming construct provides compilers with the semantic information needed for advanced optimizations.<n>We introduce a novel optimization that leverages a quantum-specific instruction to automatically substitute quantum gates with more efficient, approximate decompositions.<n>Our results suggest that high-level abstractions are crucial for unlocking a new class of powerful compiler optimizations.
• Score: 0.7340017786387767
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Current quantum programming is dominated by low-level, circuit-centric approaches that limit the potential for compiler optimization. This work presents how a high-level programming construct provides compilers with the semantic information needed for advanced optimizations. We introduce a novel optimization that leverages a quantum-specific instruction to automatically substitute quantum gates with more efficient, approximate decompositions, a process that is transparent to the programmer and significantly reduces quantum resource requirements. Furthermore, we show how this instruction guarantees the correct uncomputation of auxiliary qubits, enabling safe, dynamic quantum memory management. We illustrate these concepts by implementing a V-chain decomposition of the multi-controlled NOT gate, showing that our high-level approach not only simplifies the code but also enables the compiler to generate a circuit with up to a 50% reduction in CNOT gates. Our results suggest that high-level abstractions are crucial for unlocking a new class of powerful compiler optimizations, paving the way for more efficient quantum computation.

Related papers

• Hybrid Reward-Driven Reinforcement Learning for Efficient Quantum Circuit Synthesis [0.0]
  A reinforcement learning framework is introduced for the efficient synthesis of quantum circuits.<n>The framework combines a static, domain-informed reward that guides the agent toward the target state with customizable dynamic penalties.<n> Benchmarking on graph-state preparation tasks for up to seven qubits, we demonstrate that the algorithm consistently discovers minimal-depth circuits.
  arXiv  Detail & Related papers  (2025-07-22T14:39:20Z)
• Scalable Memory Recycling for Large Quantum Programs [0.0]
  As quantum computing technology advances, the complexity of quantum algorithms increases, necessitating a shift from low-level circuit descriptions to high-level programming paradigms.<n>This paper addresses the challenges of developing a compilation that optimize memory management and scales well for bigger, more complex circuits.
  arXiv  Detail & Related papers  (2025-03-02T09:56:39Z)
• Codesigned counterdiabatic quantum optimization on a photonic quantum processor [6.079051215256144]
  We focus on the counterdiabatic protocol with a codesigned approach to implement this algorithm on a photonic quantum processor. We develop and implement an optimized counterdiabatic method by tackling the higher-order many-body interaction terms. We experimentally demonstrate the advantages of a codesigned mapping of counterdiabatic quantum dynamics for quantum computing on photonic platforms.
  arXiv  Detail & Related papers  (2024-09-26T15:08:19Z)
• Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects [59.07692103357675]
  This survey explores the feasibility of an integrated design and optimization scheme that spans from the algorithmic level to quantum hardware.<n>It becomes more possible to reduce manual design costs, enhance the precision and efficiency of execution, and facilitate the implementation and validation of the superiority of quantum algorithms on hardware.
  arXiv  Detail & Related papers  (2024-06-30T15:50:10Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Surrogate optimization of variational quantum circuits [1.0546736060336612]
  Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE.
  arXiv  Detail & Related papers  (2024-04-03T18:00:00Z)
• Quantum Circuit Unoptimization [0.6449786007855248]
  We construct a quantum algorithmic primitive called quantum circuit unoptimization.<n>It makes a given quantum circuit complex by introducing some redundancies while preserving circuit equivalence.<n>We use quantum circuit unoptimization to generate compiler benchmarks and evaluate circuit optimization performance.
  arXiv  Detail & Related papers  (2023-11-07T08:38:18Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Hardware-Conscious Optimization of the Quantum Toffoli Gate [11.897854272643634]
  This manuscript expands the analytical and numerical approaches for optimizing quantum circuits at this abstraction level. We present a procedure for combining the strengths of analytical native gate-level optimization with numerical optimization. Our optimized Toffoli gate implementation demonstrates an $18%$ reduction in infidelity compared with the canonical implementation.
  arXiv  Detail & Related papers  (2022-09-06T17:29:22Z)
• Enabling Retargetable Optimizing Compilers for Quantum Accelerators via a Multi-Level Intermediate Representation [78.8942067357231]
  We present a multi-level quantum-classical intermediate representation (IR) that enables an optimizing, retargetable, ahead-of-time compiler. We support the entire gate-based OpenQASM 3 language and provide custom extensions for common quantum programming patterns and improved syntax. Our work results in compile times that are 1000x faster than standard Pythonic approaches, and 5-10x faster than comparative standalone quantum language compilers.
  arXiv  Detail & Related papers  (2021-09-01T17:29:47Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.