Automatic oracle generation in Microsoft's Quantum Development Kit using QIR and LLVM passes

• URL: http://arxiv.org/abs/2212.01740v1
• Date: Sun, 4 Dec 2022 04:07:05 GMT
• Title: Automatic oracle generation in Microsoft's Quantum Development Kit using QIR and LLVM passes
• Authors: Mathias Soeken, Mariia Mykhailova
• Abstract summary: oracle generation techniques can find optimized quantum circuits for classical components in quantum algorithms. We implement LLVM passes that can automatically generate QIR functions representing classical Q# functions into QIR code implementing such functions quantumly.
• Score: 1.4902915966744057
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Automatic oracle generation techniques can find optimized quantum circuits for classical components in quantum algorithms. However, most implementations of oracle generation techniques require that the classical component is expressed in terms of a conventional logic representation such as logic networks, truth tables, or decision diagrams. We implemented LLVM passes that can automatically generate QIR functions representing classical Q# functions into QIR code implementing such functions quantumly. We are using state-of-the-art logic optimization and oracle generation techniques based on XOR-AND graphs for this purpose. This enables not only a more natural description of the quantum algorithm on a higher level of abstraction, but also enables technology-dependent or application-specific generation of the oracles.

Related papers

• OpenQudit: Extensible and Accelerated Numerical Quantum Compilation via a JIT-Compiled DSL [0.4264192013842096]
  This paper introduces OpenQudit, a compilation framework that allows users to define quantum operations symbolically.<n>OpenQudit's ahead-of-time compiler uses a tensor network representation and an e-graph-based pass for symbolic simplification.<n>The evaluation shows that this symbolic approach is highly effective, accelerating the core instantiation task by up to $mathttsim20times$ on common quantum circuit synthesis problems.
  arXiv  Detail & Related papers  (2025-11-20T17:37:42Z)
• Fully Quantum Lattice Gas Automata Building Blocks for Computational Basis State Encodings [0.0]
  We introduce novel building blocks for QLGA algorithms that rely on computational basis state encodings.<n>We provide intuitive examples and open-source implementations of the underlying quantum circuits.
  arXiv  Detail & Related papers  (2025-06-14T23:42:12Z)
• IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX [0.0]
  IQPopt is a software package designed to optimize large-scale instantaneous quantum circuits on classical hardware. By exploiting an efficient classical simulation for expectation value estimation, circuits with thousands of qubits and millions of gates can be optimized.
  arXiv  Detail & Related papers  (2025-01-08T19:00:02Z)
• Quantum Machine Learning in Log-based Anomaly Detection: Challenges and Opportunities [36.437593835024394]
  We introduce a unified framework, ourframework, for evaluating QML models in the context of LogAD. State-of-the-art methods such as DeepLog, LogAnomaly, and LogRobust are included in our framework. Our evaluation extends to factors critical to QML performance, such as specificity, the number of circuits, circuit design, and quantum state encoding.
  arXiv  Detail & Related papers  (2024-12-18T06:13:49Z)
• Quantum Kernel-Based Long Short-term Memory [0.30723404270319693]
  We introduce the Quantum Kernel-Based Long Short-Term Memory (QK-LSTM) network to capture complex, non-linear patterns in sequential data. This quantum-enhanced architecture demonstrates efficient convergence, robust loss minimization, and model compactness. Benchmark comparisons reveal that QK-LSTM achieves performance on par with classical LSTM models, yet with fewer parameters.
  arXiv  Detail & Related papers  (2024-11-20T11:39:30Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• Block encoding by signal processing [0.0]
  We demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU) can themselves be efficiently utilized for BE implementation. We present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons. We find that, while using QSVT for BE results in the best gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to $lesssim11$ qubits.
  arXiv  Detail & Related papers  (2024-08-29T18:00:02Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• Unified Architecture for a Quantum Lookup Table [1.0923877073891446]
  Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms. We present a general parameterized architecture for quantum circuits implementing a lookup table. Our architecture assumes only local 2D connectivity, yet recovers results that previously required all-to-all connectivity.
  arXiv  Detail & Related papers  (2024-06-26T02:54:02Z)
• Oracle separations of hybrid quantum-classical circuits [68.96380145211093]
  Two models of quantum computation: CQ_d and QC_d. CQ_d captures the scenario of a d-depth quantum computer many times; QC_d is more analogous to measurement-based quantum computation. We show that, despite the similarities between CQ_d and QC_d, the two models are intrinsically, i.e. CQ_d $nsubseteq$ QC_d and QC_d $nsubseteq$ CQ_d relative to an oracle.
  arXiv  Detail & Related papers  (2022-01-06T03:10:53Z)
• Verified Compilation of Quantum Oracles [10.942063551929914]
  VQO is a high-assurance quantum programming framework. OQASM is the oracle quantum assembly language. VQO's versions were on par with or better than (in terms of both qubit and gate counts) oracles produced by Quipper.
  arXiv  Detail & Related papers  (2021-12-13T14:36:36Z)
• 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)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• A MLIR Dialect for Quantum Assembly Languages [78.8942067357231]
  We demonstrate the utility of the Multi-Level Intermediate Representation (MLIR) for quantum computing. We extend MLIR with a new quantum dialect that enables the expression and compilation of common quantum assembly languages. We leverage a qcor-enabled implementation of the QIR quantum runtime API to enable a retargetable (quantum hardware agnostic) compiler workflow.
  arXiv  Detail & Related papers  (2021-01-27T13:00:39Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)

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.