Simulating noisy quantum channels via quantum state preparation algorithms

• URL: http://arxiv.org/abs/2212.13834v2
• Date: Tue, 2 May 2023 13:39:26 GMT
• Title: Simulating noisy quantum channels via quantum state preparation algorithms
• Abstract summary: Authors reported an algorithm to simulate, in a circuit-based quantum computer, a general quantum channel (QC) We identify and discuss a simple way to implement the simulation of QCs on any $d$-level quantum system through quantum state preparation algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In Refs. [Phys. Rev. A 96, 062303 (2017)] and [Sci. China Phys. Mech. Astron. 61, 70311 (2018)], the authors reported an algorithm to simulate, in a circuit-based quantum computer, a general quantum channel (QC). However, the application of their algorithm is limited because it entails the solution of intricate non-linear systems of equations in order to obtain the quantum circuit to be implemented for the simulation. Motivated by this issue, in this article we identify and discuss a simple way to implement the simulation of QCs on any $d$-level quantum system through quantum state preparation algorithms, that have received much attention in the quantum information science literature lately. We exemplify the versatility of our protocol applying it to most well known qubit QCs, to some qudit QCs, and to simulate the effect of Lorentz transformations on spin states. We also regard the application of our protocol for initial mixed states. Most of the given application examples are demonstrated using IBM's quantum computers.

Related papers

• Quantum Approximate Optimization Algorithm: Performance on Simulators and Quantum Hardware [0.0]
  Running quantum circuits on quantum computers does not always generate "clean" results, unlike on a simulator.<n>This paper explores different optimization methods, techniques, and error mitigation methods to observe how they react to quantum noise differently.<n>It is helpful for other researchers to understand the complexities of running QAOA on real quantum hardware and the challenges faced in dealing with noise.
  arXiv  Detail & Related papers  (2025-09-29T02:51:37Z)
• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Vectorized Attention with Learnable Encoding for Quantum Transformer [0.6766416093990318]
  We propose the Vectorized Quantum Transformer (VQT), a model that supports ideal masked attention matrix computation.<n>Our noise intermediate-scale quantum friendly VQT approach unlocks a novel architecture for end-to-end machine learning in quantum computing.
  arXiv  Detail & Related papers  (2025-08-25T20:33:14Z)
• Quantum simulation of scattering amplitudes and interferences in perturbative QCD [0.0]
  We show how quantum computers can be employed to calculate Feynman diagrams and their interferences in Quantum Chromodynamics (QCD)<n>We simulate the colour parts of the interactions directly on the quantum computer, while the kinematic parts are for now pre-computed classically.<n>For processes where some of the external particles are identical, we find the first hints of a potential quantum advantage.
  arXiv  Detail & Related papers  (2025-07-09T18:10:25Z)
• Simulating quantum circuits with restricted quantum computers [0.0]
  This thesis is dedicated to the simulation of nonlocal quantum computation using local quantum operations. We characterize the optimal simulation overhead for a broad range of practically relevant nonlocal states and channels. We also investigate the utility of classical communication between the local parties.
  arXiv  Detail & Related papers  (2025-03-27T17:59:45Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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 Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Subspace methods for electronic structure simulations on quantum computers [1.8056100769700794]
  Quantum subspace methods (QSMs) are a class of quantum computing algorithms. We provide a self-contained introduction to QSMs, with emphasis on their application to the electronic structure of molecules.
  arXiv  Detail & Related papers  (2023-11-30T20:40:06Z)
• Quantum algorithms for the simulation of perturbative QCD processes [0.0]
  We discuss quantum algorithms for the simulation of perturbative Quantum Chromodynamics (QCD) processes. In particular, we describe quantum circuits for simulating the colour part of the interactions of quarks and gluons.
  arXiv  Detail & Related papers  (2023-09-12T12:50:37Z)
• Measurement-based infused circuits for variational quantum eigensolvers [1.732837834702512]
  Variational quantum eigensolvers (VQEs) are successful algorithms for studying physical systems on quantum computers. In this work, we incorporate such ideas into traditional VQE circuits. We showcase our approach on real superconducting quantum computers by performing VQE simulations of testbed systems.
  arXiv  Detail & Related papers  (2023-05-30T16:45:54Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Digital quantum simulation of the BCS model with a central-spin-like quantum processor [0.0]
  We present a quantum algorithm to perform digital quantum simulations of the BCS model on a quantum register with a star shaped connectivity map. We show how to effectively translate the problem onto the quantum hardware and implement the algorithm using only the native interactions between the qubits.
  arXiv  Detail & Related papers  (2022-09-19T17:48:45Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Faster Schr\"odinger-style simulation of quantum circuits [2.0940228639403156]
  Recent demonstrations of superconducting quantum computers by Google and IBM fueled new research in quantum algorithms. We advance Schr"odinger-style simulation of quantum circuits that is useful standalone and as a building block in layered simulation algorithms.
  arXiv  Detail & Related papers  (2020-08-01T08:47:24Z)

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.