Randomized simulation of quantum channels using small ancilla

• URL: http://arxiv.org/abs/2606.08784v1
• Date: Sun, 07 Jun 2026 19:01:03 GMT
• Title: Randomized simulation of quantum channels using small ancilla
• Abstract summary: 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)$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the problem of implementing a quantum channel using a small ancilla with classical randomization and postselection on an output failure flag. The simulation is probabilistic, but exact conditioned on success. We prove that any unital channel on a $d$-dimensional system can be simulated with ancilla dimension $k$ and success probability $Ω(\frac{k}{\log d})$. Equivalently, every unital channel on $n$ qubits can be simulated with constant success probability using only $O(\log n)$ ancillary qubits. We show that this tradeoff is best possible by constructing a family of channels which cannot be simulated with success probability better than $O(\frac{k}{\log d})$. We also show that the class of \textit{highly noncommutative} channels, which includes random channels, admits constant-success simulation with just a single ancillary qubit. We further show that this model of simulation necessarily fails for strongly non-unital channels and discuss possible extensions involving adaptivity. On the technical side we rely on a partition-based protocol and matrix concentration inequalities, including the recent refinement of noncommutative Khintchine inequalities due to Bandeira, Boedihardjo and van Handel.

Related papers

• Distributed Monogamy of Entanglement limits Quantum Channel Simulation [2.277447144331876]
  We introduce fractional extendibility, which gives a finer characterization of the quantum correlation that is leaked to the environment.<n>We also establish the distributed monogamy of entanglement: for any state on $AB_Bdots B_n$, the maximum average probability of extracting an EPR pair from a random subset of $k leq n/2$ systems among the $B_i$'s is the fraction $k/n$.
  arXiv  Detail & Related papers  (2026-07-09T15:26:41Z)
• Conclusive Identification Via Noisy Classical Channel: Superactivation and Quantum Advantage [0.5863360388454261]
  We show that a noiseless quantum channel of dimension equal to the rank $(mathttS_N) (mathttS_N)$ suffices, yielding a strict quantum advantage whenever $(mathttS_N) (mathttS_N)$.
  arXiv  Detail & Related papers  (2026-03-31T18:02:13Z)
• Optimality of meta-converse for channel simulation [9.66763121039393]
  We study the effect of shared non-signaling correlations for the problem of simulating a channel using noiseless communication in the one-shot setting. For classical channels, we show how to round any non-signaling-assisted simulation strategy to a strategy that only uses shared randomness. For quantum channels, we round any non-signaling-assisted simulation strategy to a strategy that only uses shared entanglement.
  arXiv  Detail & Related papers  (2024-10-10T17:24:04Z)
• Probabilistic channel simulation using coherence [0.8009842832476994]
  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.
  arXiv  Detail & Related papers  (2024-04-10T06:31:58Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [49.126395046088014]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets.<n>Our main findings are that the maximum length of messages thus identifiable scales superlinearly as $R,nlog n$ with the block length $n$.<n>We show that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Composite QDrift-Product Formulas for Quantum and Classical Simulations in Real and Imaginary Time [0.18374319565577155]
  Recent work has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian $H$ for a given simulation problem into subsets. We show that this approach holds in imaginary time, making it a candidate classical algorithm for quantum Monte-Carlo calculations. We provide exact numerical simulations of algorithmic cost by counting the number of gates of the form $e-iH_j t$ and $e-H_j beta$ to meet a certain error tolerance.
  arXiv  Detail & Related papers  (2023-06-28T21:31:26Z)
• Stochastic Approach For Simulating Quantum Noise Using Tensor Networks [0.8258451067861933]
  We show that our simulation error is relatively low, even for large numbers of qubits. By using the slicing technique, we can simulate up to 100 qubitOA circuits with high depth using supercomputers.
  arXiv  Detail & Related papers  (2022-10-28T03:44:59Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Learning Halfspaces with Tsybakov Noise [50.659479930171585]
  We study the learnability of halfspaces in the presence of Tsybakov noise. We give an algorithm that achieves misclassification error $epsilon$ with respect to the true halfspace.
  arXiv  Detail & Related papers  (2020-06-11T14:25:02Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.