Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices

• URL: http://arxiv.org/abs/2004.06052v2
• Date: Wed, 15 Nov 2023 12:30:56 GMT
• Title: Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
• Authors: Arianne Meijer-van de Griend (Cambridge Quantum Computing Ltd), Ross Duncan (Cambridge Quantum Computing Ltd, University of Strathclyde)
• Abstract summary: We propose a new algorithm toe quantum circuits for connectivitys, which takes into account the qubit of the quantum computer. Our algorithm generates circuits with a smaller CNOT depth than the algorithms currently used in Staq and tket.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes into account the qubit connectivity of the quantum computer. We focus on the architectures of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT depth than the algorithms currently used in Staq and tket, while improving the runtime with respect the former.

Related papers

• Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks [2.0257616108612373]
  Quantum walks are powerful tools for various graph-based applications. We present a circuit design for implementing discrete-time quantum walks on complex networks.
  arXiv  Detail & Related papers  (2024-08-28T09:11:47Z)
• 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)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Nearest neighbor synthesis of CNOT circuits on general quantum architectures [12.363647205992951]
  This paper addresses the nearest neighbor synthesis of CNOT circuits in the architecture with and without Hamiltonian paths. A key-qubit priority mapping model for the general architecture with and without Hamiltonian paths is proposed. Experimental results show that the proposed method can enhance the fidelity of the CNOT circuit by about 64.7% on a real quantum computing device.
  arXiv  Detail & Related papers  (2023-10-01T06:30:58Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• 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)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures [0.0]
  We present a new algorithm for the synthesis of CNOT circuits based on the solution of the syndrome decoding problem. Our method addresses the case of ideal hardware with an all-to-all qubit connectivity and the case of near-term quantum devices with restricted connectivity.
  arXiv  Detail & Related papers  (2022-01-17T15:11:36Z)
• Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler [2.8873930745906957]
  This paper introduces textbfQurzon, a proposed novel quantum compiler. It incorporates the marriage of techniques of divide and compute with the state-of-the-art algorithms of optimal qubit placement. A scheduling algorithm is also introduced within the compiler that can explore the power of distributed quantum computing.
  arXiv  Detail & Related papers  (2021-09-15T04:53:04Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Phase polynomials synthesis algorithms for NISQ architectures and beyond [3.3722008527102894]
  In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller running time for similar performances. We also provide methods that can be applied to our algorithms in order to trade an increase in the CNOT count for a decrease in execution time, thereby filling the gap between our algorithms and faster ones.
  arXiv  Detail & Related papers  (2021-04-02T08:26:36Z)

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.