Efficient parameterised compilation for hybrid quantum programming

• URL: http://arxiv.org/abs/2208.07683v1
• Date: Tue, 16 Aug 2022 11:45:08 GMT
• Title: Efficient parameterised compilation for hybrid quantum programming
• Authors: A.M. Krol, K. Mesman, A. Sarkar, M. M\"oller, Z. Al-Ars
• Abstract summary: Near term quantum devices have the potential to outperform classical computing. These devices use hybrid classical-quantum algorithms such as Variational Eigensolvers. We have implemented explicit parameters that prevent recompilation of the whole program in Quantum programming framework OpenQL.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Near term quantum devices have the potential to outperform classical computing through the use of hybrid classical-quantum algorithms such as Variational Quantum Eigensolvers. These iterative algorithms use a classical optimiser to update a parameterised quantum circuit. Each iteration, the circuit is executed on a physical quantum processor or quantum computing simulator, and the average measurement result is passed back to the classical optimiser. When many iterations are required, the whole quantum program is also recompiled many times. We have implemented explicit parameters that prevent recompilation of the whole program in quantum programming framework OpenQL, called OpenQL_PC, to improve the compilation and therefore total run-time of hybrid algorithms. We compare the time required for compilation and simulation of the MAXCUT algorithm in OpenQL to the same algorithm in both PyQuil and Qiskit. With the new parameters, compilation time in OpenQL is reduced considerably for the MAXCUT benchmark. When using OpenQL_PC, compilation of hybrid algorithms is up to two times faster than when using PyQuil or Qiskit.

Related papers

• Fast Algorithms and Implementations for Computing the Minimum Distance of Quantum Codes [43.96687298077534]
  The distance of a stabilizer quantum code determines the number of errors that can be detected and corrected. We present three new fast algorithms and implementations for computing the symplectic distance of the associated classical code.
  arXiv  Detail & Related papers  (2024-08-20T11:24:30Z)
• Extreme Compression of Large Language Models via Additive Quantization [59.3122859349777]
  Our algorithm, called AQLM, generalizes the classic Additive Quantization (AQ) approach for information retrieval. We provide fast GPU and CPU implementations of AQLM for token generation, which enable us to match or outperform optimized FP16 implementations for speed.
  arXiv  Detail & Related papers  (2024-01-11T18:54:44Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Compiler Optimization for Quantum Computing Using Reinforcement Learning [3.610459670994051]
  We propose a reinforcement learning framework for developing optimized quantum circuit compilation flows. The proposed framework is set up with a selection of compilation passes from IBM's Qiskit and Quantinuum's TKET. It significantly outperforms both individual compilers in 73% of cases regarding the expected fidelity.
  arXiv  Detail & Related papers  (2022-12-08T19:00:01Z)
• Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers [0.0]
  Open-source software package, Arline Benchmarks, is designed to perform automated benchmarking of quantum compilers. We compare several quantum compilation frameworks based on a set of important metrics. We propose a concept of composite compilation pipeline that combines compiler-specific circuit optimizations in a single compilation stack.
  arXiv  Detail & Related papers  (2022-02-28T18:48:01Z)
• An LLVM-based C++ Compiler Toolchain for Variational Hybrid Quantum-Classical Algorithms and Quantum Accelerators [0.8323133408188051]
  This paper presents an LLVM-based C++ compiler toolchain to efficiently execute variational hybrid quantum-classical algorithms. We introduce a set of extensions to the C++ language for programming these algorithms. We evaluate the framework's performance by running quantum circuits that prepare Thermofield Double (TFD) states.
  arXiv  Detail & Related papers  (2022-02-22T19:32:50Z)
• 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)
• Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns [0.0]
  Current quantum processors are noisy, have limited coherence and imperfect gate implementations. We present novel deterministic algorithms for compiling recurrent quantum circuit patterns in time. Our solution produces unmatched results on RyRz circuits.
  arXiv  Detail & Related papers  (2021-02-17T13:59:12Z)
• 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)
• OpenQL : A Portable Quantum Programming Framework for Quantum Accelerators [0.0]
  We propose a quantum programming framework named OpenQL, which includes a high-level quantum programming language and its associated quantum compiler. Our experiments show that OpenQL allows the execution of the same high-level algorithm on two different qubit technologies, namely superconducting qubits and Si-Spin qubits.
  arXiv  Detail & Related papers  (2020-05-27T11:23:16Z)

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.