Quantum network sensing with efficient multi-partite entanglement distribution via lossy channels
- URL: http://arxiv.org/abs/2505.10148v1
- Date: Thu, 15 May 2025 10:22:30 GMT
- Title: Quantum network sensing with efficient multi-partite entanglement distribution via lossy channels
- Authors: Yoshihiro Ueda, Makoto Ishihara, Wojciech Roga, Masahiro Takeoka,
- Abstract summary: Quantum network sensing shows potential to enhance the estimation precision for functions of spatially distributed parameters beyond the shot noise limit.<n>In this research, we analyze a quantum network sensing protocol based on a recently proposed, efficient GHZ state distribution scheme.
- Score: 0.11249583407496219
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum network sensing shows potential to enhance the estimation precision for functions of spatially distributed parameters beyond the shot noise limit. The key resource required for this task is possibly multi-partite quantum entanglement. The photonic entanglement is the most natural for this task; however, distributing it over long distances presents significant difficulties, mainly because of unavoidable loss in communication channels. In this research, we analyze a quantum network sensing protocol based on a recently proposed, efficient GHZ state distribution scheme. In comparison to conventional methods based on entanglement distribution , our protocol shows the decreasing loss-induced estimation error of certain functions of distributed parameters including their arbitrary linear combinations.
Related papers
- Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
arXiv Detail & Related papers (2025-06-06T13:48:20Z) - Heralded deterministic Knill-Laflamme-Milburn entanglement generation for solid-state emitters via waveguide-assisted photon scattering [0.0]
We present a set of heralded deterministic protocols for the generation of two-qubit, three-qubit, and $N$-qubit Knill-Laflamme-Milburn (KLM) states by the photon scattering property.<n>In each protocol, the auxiliary single photon functions as a universal interface to bridge all stationary qubits.
arXiv Detail & Related papers (2025-05-31T04:35:12Z) - Distributed multi-parameter quantum metrology with a superconducting quantum network [12.826409453589461]
We use a superconducting quantum network with low-loss interconnects to estimate multiple distributed parameters associated with non-commuting generators.<n>Our approach achieves an improvement of up to 6.86 dB over classical strategy for estimating all three components of a remote vector field in terms of standard deviation.
arXiv Detail & Related papers (2024-12-24T12:41:53Z) - Quantum Advantage in Distributed Sensing with Noisy Quantum Networks [37.23288214515363]
We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks which can only distribute noisy entangled states.<n>We demonstrate that the probe state with potential for quantum advantage in distributed sensing can be prepared by a three-node quantum network.
arXiv Detail & Related papers (2024-09-25T16:55:07Z) - Simple loss-tolerant protocol for GHZ-state distribution in a quantum network [0.0]
We propose a simple loss-tolerant protocol for the Greenberger-Horne-Zeilinger state distribution.
Our protocol does not use quantum repeaters and is achievable with current quantum optics technology.
arXiv Detail & Related papers (2024-04-30T11:16:37Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Multi-User Entanglement Distribution in Quantum Networks Using Multipath
Routing [55.2480439325792]
We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing.
The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
arXiv Detail & Related papers (2023-03-06T18:06:00Z) - Suppressing Amplitude Damping in Trapped Ions: Discrete Weak
Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
We introduce a low-overhead protocol to reverse this degradation.
We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise.
This filter can be understood as a protocol for single-copy quasi-distillation.
arXiv Detail & Related papers (2022-09-06T18:18:41Z) - A scheme for multipartite entanglement distribution via separable
carriers [68.8204255655161]
We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes.
We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
arXiv Detail & Related papers (2022-06-20T10:50:45Z) - Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users.
We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
arXiv Detail & Related papers (2020-11-23T19:00:01Z) - Representation matching for delegated quantum computing [64.67104066707309]
representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network.
We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
arXiv Detail & Related papers (2020-09-14T18:07:43Z)
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.