Noise-Aware Mixed-State Quantum Computation via Parameterized Quantum Channels

• URL: http://arxiv.org/abs/2502.02324v1
• Date: Tue, 04 Feb 2025 13:50:21 GMT
• Title: Noise-Aware Mixed-State Quantum Computation via Parameterized Quantum Channels
• Authors: Giuseppe Clemente, Kevin Zambello,
• Abstract summary: We discuss the generalization strategies for controlling quantum channels and their practical realizations. We describe a simple example of application in the context of error mitigation, where the control parameters for the quantum channels are optimized in the presence of noise.
• Score: 0.0
• License:
• Abstract: Non-unitary protocols are already at the base of many hybrid quantum computing applications, especially in the noisy intermediate-scale quantum (NISQ) era where quantum errors typically affect the unitary evolution. However, while the framework for Parameterized Quantum Circuits is widely developed, especially for applications where the parameters are optimized towards a set goal, we find there are still interesting opportunities in defining a unified framework also for non-unitary protocols in the form of Parameterized Quantum Channels as a computing resource. We first discuss the general parameterization strategies for controlling quantum channels and their practical realizations. Then we describe a simple example of application in the context of error mitigation, where the control parameters for the quantum channels are optimized in the presence of noise, in order to maximize channel fidelity with respect to a given target channel.

Related papers

• Learning Orthogonal Random Unitary Channels with Contracted Quantum Approaches and Simplex Optimization [41.94295877935867]
  We present a procedure for learning a class of random unitary channels on a quantum computer. Our approach involves a multi-objective, Pauli- and unitary-based minimization, and allows for learning locally equivalent channels.
  arXiv  Detail & Related papers  (2025-01-28T19:02:52Z)
• 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)
• Single-shot Quantum Signal Processing Interferometry [3.431120541553662]
  We present a general algorithmic framework, quantum signal processing interferometry (QSPI), for quantum sensing. We use our QSPI sensing framework to make efficient binary decisions on a displacement channel in the single-shot limit.
  arXiv  Detail & Related papers  (2023-11-22T21:44:14Z)
• Retrieving non-linear features from noisy quantum states [11.289924445850328]
  In this paper, we analyze the feasibility and efficiency of extracting high-order moments from noisy states. We first show that there exists a quantum protocol capable of accomplishing this task if and only if the underlying noise channel is invertible. Our work contributes to a deeper understanding of how quantum noise could affect high-order information extraction and provides guidance on how to tackle it.
  arXiv  Detail & Related papers  (2023-09-20T15:28:18Z)
• Benchmarking universal quantum gates via channel spectrum [0.0]
  Noise remains the major obstacle to scalable quantum computation. We propose a method to infer the noise properties of the target gate, including process fidelity, fidelity, and some unitary parameters, from the eigenvalues of its noisy channel. Our method is insensitive to state-preparation and measurement errors, and importantly, can benchmark universal gates and is scalable to many-qubit systems.
  arXiv  Detail & Related papers  (2023-01-05T13:18:19Z)
• Quantum Federated Learning with Entanglement Controlled Circuits and Superposition Coding [44.89303833148191]
  We develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs) We propose an entangled slimmable QFL (eSQFL) that communicates the superposition-coded parameters of eS-QNNs. In an image classification task, extensive simulations corroborate the effectiveness of eSQFL.
  arXiv  Detail & Related papers  (2022-12-04T03:18:03Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• 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)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Optimal environment localization [0.8602553195689513]
  We consider the paradigmatic case of channel position finding. The goal of the problem is to detect the position of a target environment among a number of identical background environments. We derive bounds for the ultimate error probability affecting this multi-ary discrimination problem. We design an explicit protocol that gives numerical bounds on the ultimate error probability and often achieves quantum advantage.
  arXiv  Detail & Related papers  (2020-09-21T18:00:08Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.