Classical-quantum network coding: a story about tensor
- URL: http://arxiv.org/abs/2104.04745v1
- Date: Sat, 10 Apr 2021 12:05:38 GMT
- Title: Classical-quantum network coding: a story about tensor
- Authors: Cl\'ement Meignant, Fr\'ed\'eric Grosshans, Damian Markham
- Abstract summary: We study the conditions to perform the distribution of a pure state on a quantum network using quantum operations.
We develop a formalism which encompasses both types of distribution protocols.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We study here the conditions to perform the distribution of a pure state on a
quantum network using quantum operations which can succeed with a non-zero
probability, the Stochastic Local Operation and Classical Communication (SLOCC)
operations.
In their pioneering 2010 work, Kobayashi et al. showed how to convert any
classical network coding protocol into a quantum network coding protocol.
However, they left open whether the existence of a quantum network coding
protocol implied the existence of a classical one. Motivated by this question,
we characterize the set of distribution tasks achievable with non zero
probability for both classical and quantum networks. We develop a formalism
which encompasses both types of distribution protocols by reducing the solving
of a distribution task to the factorization of a tensor with complex
coefficients or real positive ones. Using this formalism, we examine the
equivalences and differences between both types of distribution protocols
exhibiting several elementary and fundamental relations between them as well as
concrete examples of both convergence and divergence. We answer by the negative
to the issue previously left open: some tasks are achievable in the quantum
setting, but not in the classical one. We believe this formalism to be a useful
tool for studying the extent of quantum network ability to perform multipartite
distribution tasks.
Related papers
- Quantum information with quantum-like bits [0.0]
In previous work we have proposed a construction of quantum-like bits that could endow a large, complex classical system.
This paper aims to explore the mathematical structure of quantum-like resources, and shows how arbitrary gates can be implemented by manipulating emergent states.
arXiv Detail & Related papers (2024-08-12T20:40:54Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - Entanglement and Causal Relation in distributed quantum computation [0.0]
We investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC)
In the first part, we analyze implementable computation over a given quantum network resource by introducing a new concept, quantum network coding for quantum computation.
In the second part, we show that entanglement required for local state discrimination can be substituted by less entanglement by increasing the rounds of classical communication.
arXiv Detail & Related papers (2022-02-14T07:23:17Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
We show how to make quantum networks, both standard and entanglement-based, genuine quantum.
We provide them with the possibility of handling superposed tasks and superposed addressing.
arXiv Detail & Related papers (2020-04-30T18:00:06Z) - From a quantum theory to a classical one [117.44028458220427]
We present and discuss a formal approach for describing the quantum to classical crossover.
The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
arXiv Detail & Related papers (2020-04-01T09:16:38Z) - Semidefinite tests for quantum network topologies [0.9176056742068814]
Quantum networks play a major role in long-distance communication, quantum cryptography, clock synchronization, and distributed quantum computing.
The question of which correlations a given quantum network can give rise to, remains almost uncharted.
We show that constraints on the observable covariances, previously derived for the classical case, also hold for quantum networks.
arXiv Detail & Related papers (2020-02-13T22:36:46Z)
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.