Probabilistic channel simulation using coherence

• URL: http://arxiv.org/abs/2404.06775v2
• Date: Wed, 18 Dec 2024 04:13:13 GMT
• Title: Probabilistic channel simulation using coherence
• Abstract summary: We develop the framework for probabilistic channel simulation using coherence with free operations.<n>We show that if the target channel is not a resource nonactivating channel, then one cannot simulate it exactly both deterministically and probabilistically.
• Score: 0.8009842832476994
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Channel simulation using coherence, which refers to realizing a target channel with coherent states and free operations, is a fundamental problem in the quantum resource theory of coherence. The limitations of the accuracy of deterministic channel simulation motivate us to consider the more general probabilistic framework. In this paper, we develop the framework for probabilistic channel simulation using coherence with free operations. When the chosen set of free operations is the maximally incoherent operations, we provide an efficiently computable semidefinite program (SDP) to calculate the maximal success probability and derive the analytic expression of success probability for some special cases. When the chosen set of free operations is the dephasing-covariant incoherent operations (DIO), we show that if the target channel is not a resource nonactivating channel, then one cannot simulate it exactly both deterministically and probabilistically. The SDP for maximal success probability of simulating a channel by DIO is also given correspondingly.

Related papers

• Randomized simulation of quantum channels using small ancilla [0.0]
  We study the problem of implementing a quantum channel using a small ancilla with classical randomization and postselection on an output failure flag.<n>We prove that any unital channel on a $d$-dimensional system can be simulated with ancilla dimension $k$ and success probability $(fracklog d)$.<n>We show that this tradeoff is best possible by constructing a family of channels which cannot be simulated with success probability better than $O(fracklog d)$.
  arXiv  Detail & Related papers  (2026-06-07T19:01:03Z)
• Feedback Motion Planning for Stochastic Nonlinear Systems with Signal Temporal Logic Specifications [25.484834028091083]
  We study feedback motion planning for continuous-time nonlinear systems under signal temporal logic (STL) specifications.<n>We propose a framework that synthesizes control policies for chance-constrained STL trajectory optimization problems.
  arXiv  Detail & Related papers  (2026-05-04T09:02:16Z)
• Non-asymptotic error bounds for probability flow ODEs under weak log-concavity [6.661419982187023]
  This work establishes non-asymptotic convergence bounds in the 2-Wasserstein distance for a general class of probability flow ODEs.<n>Our results extend convergence theory to more realistic data distributions and practical ODE solvers.
  arXiv  Detail & Related papers  (2025-10-20T14:54:38Z)
• Integrating Belief Domains into Probabilistic Logic Programs [0.16385815610837165]
  This paper introduces interval-based Capacity Logic Programs based on an extension of the Distribution Semantics to include belief functions.<n>It describes properties of the new framework that make it amenable to practical applications.
  arXiv  Detail & Related papers  (2025-07-23T07:52:09Z)
• Programmable Quantum Processors: Equivalence and Learning [0.0]
  A programmable quantum processor is a device able to transform input data states in a desired way. Three types of probabilistic equivalences - strong, weak, and structural - were defined. It was found that spans of operators of structurally equivalent processors are identical.
  arXiv  Detail & Related papers  (2024-11-04T17:18:18Z)
• Dynamical Measure Transport and Neural PDE Solvers for Sampling [77.38204731939273]
  We tackle the task of sampling from a probability density as transporting a tractable density function to the target. We employ physics-informed neural networks (PINNs) to approximate the respective partial differential equations (PDEs) solutions. PINNs allow for simulation- and discretization-free optimization and can be trained very efficiently.
  arXiv  Detail & Related papers  (2024-07-10T17:39:50Z)
• Quantum channel decomposition with pre- and post-selection [0.7597059965024503]
  This paper proposes a channel decomposition method for target unitaries that have their input and output conditioned on specific quantum states. We explicitly determine the requisite number of decomposing channels, which could be significantly smaller than the selection-free scenario. We demonstrate an application of this approach to the quantum linear solver algorithm, highlighting the efficacy of the proposed method.
  arXiv  Detail & Related papers  (2023-05-19T12:48:21Z)
• Robust Control for Dynamical Systems With Non-Gaussian Noise via Formal Abstractions [59.605246463200736]
  We present a novel controller synthesis method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous control system into a finite-state model that captures noise by probabilistic transitions between discrete states. We use state-of-the-art verification techniques to provide guarantees on the interval Markov decision process and compute a controller for which these guarantees carry over to the original control system.
  arXiv  Detail & Related papers  (2023-01-04T10:40:30Z)
• Channel Simulation: Finite Blocklengths and Broadcast Channels [13.561997774592667]
  We study channel simulation under common randomness assistance in the finite-blocklength regime. We identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.
  arXiv  Detail & Related papers  (2022-12-22T13:08:55Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Bayesian sequential design of computer experiments for quantile set inversion [0.0]
  We consider an unknown multivariate function representing a system-such as a complex numerical simulator. Our objective is to estimate the set of deterministic inputs leading to outputs whose probability is less than a given threshold.
  arXiv  Detail & Related papers  (2022-11-02T10:14:05Z)
• Selection of the Most Probable Best [2.1095005405219815]
  We consider an expected-value ranking and selection (R&S) problem where all k solutions' simulation outputs depend on a common parameter whose uncertainty can be modeled by a distribution. We define the most probable best (MPB) to be the solution that has the largest probability of being optimal with respect to the distribution. We devise a series of algorithms that replace the unknown means in the optimality conditions with their estimates and prove the algorithms' sampling ratios achieve the conditions as the simulation budget increases.
  arXiv  Detail & Related papers  (2022-07-15T15:27:27Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• Simulation Paths for Quantum Circuit Simulation with Decision Diagrams [72.03286471602073]
  We study the importance of the path that is chosen when simulating quantum circuits using decision diagrams. We propose an open-source framework that allows to investigate dedicated simulation paths.
  arXiv  Detail & Related papers  (2022-03-01T19:00:11Z)
• Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise [59.47042225257565]
  We present a novel planning method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states. We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
  arXiv  Detail & Related papers  (2021-10-25T06:18:55Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Reinforcement Learning Based Temporal Logic Control with Maximum Probabilistic Satisfaction [5.337302350000984]
  This paper presents a model-free reinforcement learning algorithm to synthesize a control policy. The effectiveness of the RL-based control synthesis is demonstrated via simulation and experimental results.
  arXiv  Detail & Related papers  (2020-10-14T03:49:16Z)
• Operation-Aware Soft Channel Pruning using Differentiable Masks [51.04085547997066]
  We propose a data-driven algorithm, which compresses deep neural networks in a differentiable way by exploiting the characteristics of operations. We perform extensive experiments and achieve outstanding performance in terms of the accuracy of output networks.
  arXiv  Detail & Related papers  (2020-07-08T07:44:00Z)

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.