No-Go Theorem for Generic Simulation of Qubit Channels with Finite Classical Resources

• URL: http://arxiv.org/abs/2501.15807v1
• Date: Mon, 27 Jan 2025 06:28:33 GMT
• Title: No-Go Theorem for Generic Simulation of Qubit Channels with Finite Classical Resources
• Authors: Sahil Gopalkrishna Naik, Nicolas Gisin, Manik Banik,
• Abstract summary: We show that a general simulation for the perfect qubit channel is impossible with finite classical communication. For noisy qubit channels, such as those with depolarizing noise, we demonstrate that general simulation is achievable with finite communication.
• Score: 0.0
• License:
• Abstract: The mathematical framework of quantum theory, though fundamentally distinct from classical physics, raises the question of whether quantum processes can be efficiently simulated using classical resources. For instance, a sender (Alice) possessing the classical description of a qubit state can simulate the action of a qubit channel through finite classical communication with a receiver (Bob), enabling Bob to reproduce measurement statistics for any observable on the state. Here, we contend that a more general simulation requires reproducing statistics of joint measurements, potentially involving entangled effects, on Alice's system and an additional system held by Bob, even when Bob's system state is unknown or entangled with a larger system. We establish a no-go result, demonstrating that such a general simulation for the perfect qubit channel is impossible with finite classical communication. Furthermore, we show that entangled effects render classical simulation significantly more challenging compared to unentangled effects. On the other hand, for noisy qubit channels, such as those with depolarizing noise, we demonstrate that general simulation is achievable with finite communication. Notably, the required communication increases as the noise decreases, revealing an intricate relationship between the noise in the channel and the resources necessary for its classical simulation.

Related papers

• Efficient quantum-enhanced classical simulation for patches of quantum landscapes [0.0]
  We show that it is always possible to generate a classical surrogate of a sub-region of an expectation landscape produced by a parameterized quantum circuit. We provide a quantum-enhanced classical algorithm which, after simple measurements on a quantum device, allows one to classically simulate approximate expectation values of a subregion of a landscape.
  arXiv  Detail & Related papers  (2024-11-29T18:00:07Z)
• On Simultaneous Information and Energy Transmission through Quantum Channels [15.387256204743407]
  We introduce the quantum-classical analogue of the capacity-power function. We generalize results in classical information theory for transmitting classical information through noisy channels.
  arXiv  Detail & Related papers  (2023-09-24T16:46:47Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• 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)
• Certifying the Classical Simulation Cost of a Quantum Channel [4.974890682815778]
  A fundamental objective in quantum information science is to determine the cost in classical resources simulating a particular quantum system. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel.
  arXiv  Detail & Related papers  (2021-02-24T20:22:43Z)
• Classical simulations of communication channels [0.0]
  We investigate whether certain non-classical communication channels can be simulated by a classical channel with a given number of states and a given amount' of noise. It is proved that any noisy quantum channel can be simulated by a corresponding classical channel with the same amount' of noise.
  arXiv  Detail & Related papers  (2021-01-26T18:25:22Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16: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.