dorsal/arxiv
View SchemaDistributed Quantum Computation over Noisy Channels
| Authors | J. I. Cirac, A. Ekert, S. F. Huelga, C. Macchiavello |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9803017 |
| URL | https://arxiv.org/abs/quant-ph/9803017 |
| DOI | 10.1103/PhysRevA.59.4249 |
Abstract
We analyse the use of entangled states to perform quantum computations non locally among distant nodes in a quantum network. The complexity associated with the generation of multiparticle entangled states is quantified in terms of the concept of global cost. This parameter allows us to compare the use of physical resources in different schemes. We show that for ideal channels and for a sufficiently large number of nodes, the use of maximally entangled states is advantageous over uncorrelated ones. For noisy channels, one has to use entanglement purification procedures in order to create entangled states of high fidelity. We show that under certain circumstances a quantum network supplied with a maximally entangled input still yields a smaller global cost, provided that $n$ belongs to a given interval $n\in [n_{min},n_{max}]$. The values of $n_{min}$ and $n_{max}$ crucially depend on the purification protocols used to establish the $n$-- processor entangled states, as well as on the presence of decoherence processes during the computation. The phase estimation problem has been used to illustrate this fact.
{
"annotation_id": "68f17f01-9028-4dff-961f-99989857ae9a",
"date_created": "2026-03-02T18:02:41.098000Z",
"date_modified": "2026-03-02T18:02:41.098000Z",
"file_hash": "dcbda731adcbe13918190562749331e063362fdc24a9209282968f93b6152d6d",
"private": false,
"record": {
"abstract": "We analyse the use of entangled states to perform quantum computations non\nlocally among distant nodes in a quantum network. The complexity associated\nwith the generation of multiparticle entangled states is quantified in terms of\nthe concept of global cost. This parameter allows us to compare the use of\nphysical resources in different schemes. We show that for ideal channels and\nfor a sufficiently large number of nodes, the use of maximally entangled states\nis advantageous over uncorrelated ones. For noisy channels, one has to use\nentanglement purification procedures in order to create entangled states of\nhigh fidelity. We show that under certain circumstances a quantum network\nsupplied with a maximally entangled input still yields a smaller global cost,\nprovided that $n$ belongs to a given interval $n\\in [n_{min},n_{max}]$. The\nvalues of $n_{min}$ and $n_{max}$ crucially depend on the purification\nprotocols used to establish the $n$-- processor entangled states, as well as on\nthe presence of decoherence processes during the computation. The phase\nestimation problem has been used to illustrate this fact.",
"arxiv_id": "quant-ph/9803017",
"authors": [
"J. I. Cirac",
"A. Ekert",
"S. F. Huelga",
"C. Macchiavello"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.59.4249",
"title": "Distributed Quantum Computation over Noisy Channels",
"url": "https://arxiv.org/abs/quant-ph/9803017"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "55b0f874-1bdf-4dd3-b1e6-26f6bb4214b4",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}