Quantum Circuit Optimisation and MBQC Scheduling with a Pauli Tracking Library

• URL: http://arxiv.org/abs/2405.03970v1
• Date: Tue, 7 May 2024 03:00:57 GMT
• Title: Quantum Circuit Optimisation and MBQC Scheduling with a Pauli Tracking Library
• Authors: Jannis Ruh, Simon Devitt,
• Abstract summary: Pauli tracking allows one to reduce the number of Pauli gates that must be executed on quantum hardware. This is relevant for measurement-based quantum computing and for error-corrected circuits that are implemented through Clifford circuits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a software library for the commutation of Pauli operators through quantum Clifford circuits, which is called Pauli tracking. Tracking Pauli operators allows one to reduce the number of Pauli gates that must be executed on quantum hardware. This is relevant for measurement-based quantum computing and for error-corrected circuits that are implemented through Clifford circuits. Furthermore, we investigate the problem of qubit scheduling in measurement-based quantum computing and how Pauli tracking can be used to capture the constraints on the order of measurements.

Related papers

• Pauli Check Sandwiching for Quantum Characterization and Error Mitigation during Runtime [8.860010205263116]
  This work presents a novel quantum system characterization and error mitigation framework that applies Pauli check sandwiching (PCS) PCS combined with multi-programming unlocks non-trivial fidelity improvements in quantum program outcomes.
  arXiv  Detail & Related papers  (2024-08-10T14:21:45Z)
• Reducing Depth and Measurement Weights in Pauli-based Computation [0.0]
  Pauli-based computation (PBC) is a universal measurement-based quantum computation model steered by an adaptive sequence of independent and compatible Pauli measurements on magic-state qubits. Here, we propose several new ways of decreasing the weight of the Pauli measurements and their associated textsccnot complexity. We also demonstrate how to reduce this model's computational depth.
  arXiv  Detail & Related papers  (2024-08-07T18:00:11Z)
• 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)
• A simple method for compiling quantum stabilizer circuits [0.0]
  We introduce an intuitive and accessible method for Clifford gate compilation. By restricting ourselves to Clifford gates, the compilation process becomes almost trivial. We provide a brief explanation of the process along with some worked examples to build intuition.
  arXiv  Detail & Related papers  (2024-04-30T09:56:07Z)
• 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)
• Quantum simulation of Pauli channels and dynamical maps: algorithm and implementation [0.0]
  We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps. A parametrized quantum circuit is employed to accommodate for dynamical maps.
  arXiv  Detail & Related papers  (2023-07-31T22:57:29Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  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.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Fast Estimation of Sparse Quantum Noise [1.933681537640272]
  We present a practical algorithm for estimating the $s$ nonzero Pauli error rates in an $s$-sparse, $n$-qubit Pauli noise channel. We experimentally validate a version of the algorithm that uses simplified Clifford circuits on data from an IBM 14-qubit superconducting device.
  arXiv  Detail & Related papers  (2020-07-15T18:00:01Z)
• 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.