Quantum simulation of Pauli channels and dynamical maps: algorithm and implementation

• URL: http://arxiv.org/abs/2308.00188v1
• Date: Mon, 31 Jul 2023 22:57:29 GMT
• Title: Quantum simulation of Pauli channels and dynamical maps: algorithm and implementation
• Authors: Tomas Basile and Carlos Pineda
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Pauli channels are fundamental in the context of quantum computing as they model the simplest kind of noise in quantum devices. We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps (parametrized Pauli channels). A parametrized quantum circuit is employed to accommodate for dynamical maps. We also establish the mathematical conditions for an N-qubit transformation to be achievable using a parametrized circuit where only one single-qubit operation depends on the parameter. The implementation of the proposed circuit is demonstrated using IBM's quantum computers for the case of one qubit, and the fidelity of this implementation is reported.

Related papers

• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Quantum Circuit Optimisation and MBQC Scheduling with a Pauli Tracking Library [0.0]
  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.
  arXiv  Detail & Related papers  (2024-05-07T03:00:57Z)
• 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)
• The Bonsai algorithm: grow your own fermion-to-qubit mapping [0.7049738935364298]
  We present a formalism to design flexible fermion-to-qubit mappings from ternary trees. We introduce a recipe that guarantees Fock basis states are mapped to computational basis states in qubit space. We illustrate the algorithm by producing mappings for the heavy-hexagon topology widely used in IBM quantum computers.
  arXiv  Detail & Related papers  (2022-12-19T18:53:08Z)
• 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)
• Quantum circuit compilation and hybrid computation using Pauli-based computation [0.0]
  Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non-destructive measurements of Pauli observables. We propose practical ways of implementing PBC as adaptive quantum circuits and provide code to do the required classical side-processing.
  arXiv  Detail & Related papers  (2022-03-03T16:01:55Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Relating Measurement Patterns to Circuits via Pauli Flow [0.0]
  We show that Pauli flow can be efficiently identified and transformed into a gate-based quantum circuit. We then use this relationship to derive simulation results for the effects of graph-theoretic rewrites in the ZX-calculus.
  arXiv  Detail & Related papers  (2021-09-13T00:48:24Z)
• 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)
• 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)
• Logical Abstractions for Noisy Variational Quantum Algorithm Simulation [25.515765956985188]
  Existing quantum circuit simulators do not address the common traits of variational algorithms. We present a quantum circuit simulation toolchain based on logical abstractions targeted for simulating variational algorithms.
  arXiv  Detail & Related papers  (2021-03-31T17:20:13Z)

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.