Skip to main content
Quantum Computing

Return to Question

deleted 1 character in body; edited title
Source Link
glS ♦
glS ♦
  • 26.9k
  • 6
  • 35
  • 121

Shared entanglement If Alice and Bob share only classical communication resources, is shared entanglement always equivalent to shared randomness?

Shared entanglement If Alice and Bob share only classical communication resources, is shared entanglement always equivalent to shared randomness?

If Alice and Bob share only classical communication resources such as noisy or perfect classical channels, is shared entanglement always equivalent to shared randomness?

In other words, must there be a quantum channel in order to exploit the power of shared entanglement? If yes, how can one prove this?

Shared entanglement and classical resources

If Alice and Bob share only classical communication resources such as noisy or perfect classical channels, is shared entanglement always equivalent to shared randomness?

In other words, must there be a quantum channel in order to exploit the power of shared entanglement? If yes, how can one prove this?

If Alice and Bob share only classical communication resources, is shared entanglement always equivalent to shared randomness?

If Alice and Bob share only classical communication resources such as noisy or perfect classical channels, is shared entanglement always equivalent to shared randomness?

In other words, must there be a quantum channel in order to exploit the power of shared entanglement? If yes, how can one prove this?

Source Link
JRT
JRT
  • 616
  • 3
  • 7

Shared entanglement and classical resources

If Alice and Bob share only classical communication resources such as noisy or perfect classical channels, is shared entanglement always equivalent to shared randomness?

In other words, must there be a quantum channel in order to exploit the power of shared entanglement? If yes, how can one prove this?