Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network

• URL: http://arxiv.org/abs/2106.13998v1
• Date: Sat, 26 Jun 2021 10:55:52 GMT
• Title: Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network
• Authors: Evan E. Dobbs, Robert Basmadjian, Alexandru Paler, Joseph S. Friedman
• Abstract summary: We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
• Score: 64.1951227380212
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Predicting the optimum SWAP depth of a quantum circuit is useful because it informs the compiler about the amount of necessary optimization. Fast prediction methods will prove essential to the compilation of practical quantum circuits. In this paper, we propose that quantum circuits can be modeled as queuing networks, enabling efficient extraction of the parallelism and duration of SWAP circuits. To provide preliminary substantiation of this approach, we compile a quantum multiplier circuit and use a queuing network model to accurately determine the quantum circuit parallelism and duration. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.

Related papers

• Equivalence Checking of Quantum Circuits via Intermediary Matrix Product Operator [4.306566710489809]
  Equivalence checking plays a vital role in identifying errors that may arise during compilation and optimization of quantum circuits. We introduce a novel method based on Matrix Product Operators (MPOs) for determining the equivalence of quantum circuits.
  arXiv  Detail & Related papers  (2024-10-14T18:00:00Z)
• SuperEncoder: Towards Universal Neural Approximate Quantum State Preparation [12.591173729459427]
  We show that it is possible to leverage a pre-trained neural network to directly generate the QSP circuit for arbitrary quantum state. Our study makes a steady step towards a universal neural designer for approximate QSP.
  arXiv  Detail & Related papers  (2024-08-10T04:39:05Z)
• 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)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Mapping quantum circuits to shallow-depth measurement patterns based on graph states [0.0]
  We create a hybrid simulation technique for measurement-based quantum computing. We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements. We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
  arXiv  Detail & Related papers  (2023-11-27T19:00:00Z)
• 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)
• Parallel circuit implementation of variational quantum algorithms [0.0]
  We present a method to split quantum circuits of variational quantum algorithms (VQAs) to allow for parallel training and execution. We apply this specifically to optimization problems, where inherent structures from the problem can be identified. We show that not only can our method address larger problems, but that it is also possible to run full VQA models while training parameters using only one slice.
  arXiv  Detail & Related papers  (2023-04-06T12:52:29Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• An Optimized Quantum Implementation of ISD on Scalable Quantum Resources [2.274915755738124]
  We show that Prange's ISD algorithm can be implemented rather efficiently on a quantum computer. We leverage the idea of classical co-processors to design hybrid classical-quantum trade-offs.
  arXiv  Detail & Related papers  (2021-12-12T06:01:10Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.