Minimum Entanglement Protocols for Function Estimation
- URL: http://arxiv.org/abs/2110.07613v3
- Date: Fri, 29 Sep 2023 18:21:11 GMT
- Title: Minimum Entanglement Protocols for Function Estimation
- Authors: Adam Ehrenberg, Jacob Bringewatt, Alexey V. Gorshkov
- Abstract summary: We prove necessary and sufficient conditions for the existence of optimal protocols using at most $k$-partite entanglement.
Our protocols require some amount of time-dependent control, and we show that a related class of time-independent protocols fail to achieve optimal scaling for generic functions.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We derive a family of optimal protocols, in the sense of saturating the
quantum Cram\'{e}r-Rao bound, for measuring a linear combination of $d$ field
amplitudes with quantum sensor networks, a key subprotocol of general quantum
sensor network applications. We demonstrate how to select different protocols
from this family under various constraints. Focusing primarily on
entanglement-based constraints, we prove the surprising result that highly
entangled states are not necessary to achieve optimality in many cases.
Specifically, we prove necessary and sufficient conditions for the existence of
optimal protocols using at most $k$-partite entanglement. We prove that the
protocols which satisfy these conditions use the minimum amount of entanglement
possible, even when given access to arbitrary controls and ancilla. Our
protocols require some amount of time-dependent control, and we show that a
related class of time-independent protocols fail to achieve optimal scaling for
generic functions.
Related papers
- Ancilla-free measurement of out-of-time-ordered correlation functions:
General measurement protocol and Rydberg atom implementation [0.0]
We introduce a protocol that gives access to out-of-time-ordered correlation functions in many-body quantum systems.
We put forward a strategy for Hamiltonian sign inversion $Hto-H$ in arrays of Rydberg-dressed atoms.
arXiv Detail & Related papers (2024-03-13T16:20:37Z) - Optimal quantum teleportation protocols for fixed average fidelity [0.0]
Among all quantum teleportation protocols giving rise to the same average fidelity, those with aligned Bloch vectors between input and output states exhibit the minimum average trace distance.
We show that optimal protocols can be interpreted as the perfect quantum teleportation protocol under the action of correlated one-qubit channels.
arXiv Detail & Related papers (2023-10-27T15:41:12Z) - Robust and efficient verification of graph states in blind
measurement-based quantum computation [52.70359447203418]
Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients.
It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario.
Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
arXiv Detail & Related papers (2023-05-18T06:24:45Z) - 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) - New protocols for quantum key distribution with explicit upper and lower
bound on secret-key rate [0.0]
We present two new schemes for quantum key distribution (QKD) which neither require entanglement nor require an ideal single photon source.
The proposed protocols can be implemented using realistic single photon sources which are commercially available.
arXiv Detail & Related papers (2022-12-26T11:14:39Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols.
We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states.
This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
arXiv Detail & Related papers (2022-01-14T19:24:31Z) - Deterministic Entanglement Transmission on Series-Parallel Quantum
Networks [2.86989372262348]
This paper explores and amplifies a new and more effective mapping of QN, referred to as concurrence percolation theory (ConPT)
We implement ConPT via a novel deterministic entanglement transmission scheme that is fully analogous to resistor network analysis.
The DET is designed for general d-dimensional information carriers, scalable and adaptable for any series-parallel QN, and experimentally feasible as tested on IBM's quantum platform.
arXiv Detail & Related papers (2021-10-11T03:29:03Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Round-robin differential phase-time-shifting protocol for quantum key
distribution: theory and experiment [58.03659958248968]
Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties.
Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments.
We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario.
Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
arXiv Detail & Related papers (2021-03-15T15:20:09Z) - Computing conditional entropies for quantum correlations [10.549307055348596]
In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution.
We introduce the family of iterated mean quantum R'enyi divergences with parameters $alpha_k = 1+frac12k-1$ for positive integers $k$.
We show that the corresponding conditional entropies admit a particularly nice form which, in the context of device-independent optimization, can be relaxed to a semidefinite programming problem.
arXiv Detail & Related papers (2020-07-24T15:27:51Z)
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.