Paulihedral: A Generalized Block-Wise Compiler Optimization Framework For Quantum Simulation Kernels

• URL: http://arxiv.org/abs/2109.03371v1
• Date: Tue, 7 Sep 2021 23:52:58 GMT
• Title: Paulihedral: A Generalized Block-Wise Compiler Optimization Framework For Quantum Simulation Kernels
• Authors: Gushu Li, Anbang Wu, Yunong Shi, Ali Javadi-Abhari, Yufei Ding, Yuan Xie
• Abstract summary: Paulihedral is a block-wise compiler framework that can deeply optimize the quantum simulation kernel. We show that Paulihedral can outperform state-of-the-art compiler infrastructures in a wide-range of applications on both near-term superconducting quantum processors and future fault-tolerant quantum computers.
• Score: 17.038656780131692
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The quantum simulation kernel is an important subroutine appearing as a very long gate sequence in many quantum programs. In this paper, we propose Paulihedral, a block-wise compiler framework that can deeply optimize this subroutine by exploiting high-level program structure and optimization opportunities. Paulihedral first employs a new Pauli intermediate representation that can maintain the high-level semantics and constraints in quantum simulation kernels. This naturally enables new large-scale optimizations that are hard to implement at the low gate-level. In particular, we propose two technology-independent instruction scheduling passes, and two technology-dependent code optimization passes which reconcile the circuit synthesis, gate cancellation, and qubit mapping stages of the compiler. Experimental results show that Paulihedral can outperform state-of-the-art compiler infrastructures in a wide-range of applications on both near-term superconducting quantum processors and future fault-tolerant quantum computers.

Related papers

• A Quantum ISA for High-Level Programming, Enabling Sequential Execution and Conditional Branching [0.0]
  The paper introduces a novel quantum instruction set architecture that abstracts quantum circuits to support high-level programming paradigms. By separating concerns between hardware and software, the proposed architecture simplifies quantum algorithm development.
  arXiv  Detail & Related papers  (2024-10-09T11:16:29Z)
• 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 Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• On-the-fly Tailoring towards a Rational Ansatz Design for Digital Quantum Simulations [0.0]
  It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices. We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz. The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
  arXiv  Detail & Related papers  (2023-02-07T11:22:01Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Modularized and scalable compilation for quantum program in double quantum dots [0.0]
  We train the Ansatz circuit and exemplarily realize high-fidelity compilation of a series of universal quantum gates for singlet-triplet qubits in semiconductor double quantum dots. Our work constitutes an important stepping-stone for exploiting the potential of this physical resource for advanced and complicated quantum algorithms.
  arXiv  Detail & Related papers  (2022-11-10T02:32:39Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Efficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning [17.567408246024964]
  We devise an efficient and practical quantum compiler assisted by advanced deep reinforcement learning (RL) techniques. Our protocol is compatible with various quantum machines and can be used to compile multi-qubit operators. For the first time, we demonstrate how to leverage RL-based quantum compilers to accomplish two-qubit operator compiling.
  arXiv  Detail & Related papers  (2022-04-14T12:03:47Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Extending XACC for Quantum Optimal Control [70.19683407682642]
  Quantum computing vendors are beginning to open up application programming for direct pulse-level quantum control. We present an extension to the XACC system-level quantum-classical software framework. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences.
  arXiv  Detail & Related papers  (2020-06-04T13:13:55Z)

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.