Time-Constrained Local Quantum State Discrimination
- URL: http://arxiv.org/abs/2311.00677v1
- Date: Wed, 1 Nov 2023 17:37:20 GMT
- Title: Time-Constrained Local Quantum State Discrimination
- Authors: Ian George, Rene Allerstorfer, Philip Verduyn Lunel, Eric Chitambar
- Abstract summary: We investigate quantum state discrimination using local operations and simultaneous classical or quantum communication (LOSCC/LOSQC)
We show these conditions fail for LOSQC and provide the smallest-sized example in which a gap between LOSCC and LOSQC exists.
- Score: 3.8779763612314633
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Inspired by protocols in relativistic quantum cryptography, we investigate
quantum state discrimination using local operations and simultaneous classical
or quantum communication (LOSCC/LOSQC). When one system is a qubit, we identify
the structure of product ensembles that can be perfectly discriminated by
LOSCC. We show these conditions fail for LOSQC and provide the smallest-sized
example in which a gap between LOSCC and LOSQC exists. Finally, we prove an
uncertainty relation that yields error bounds in LOSQC state discrimination and
noise thresholds for quantum position verification.
Related papers
- Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process.
We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable.
Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs.
We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
arXiv Detail & Related papers (2024-05-12T09:05:13Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Learning Distributed Quantum State Discrimination with Noisy Classical
Communications [39.000858564696856]
This paper presents Noise Aware-LOCCNet (NA-LOCCNet) for distributed quantum state discrimination in the presence of noisy communication.
We propose specific ansatzes for the case of two observed qubit pairs, and we describe a noise-aware training design criterion.
arXiv Detail & Related papers (2022-07-22T22:06:56Z) - Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state [1.2094859111770522]
In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system.
Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.
arXiv Detail & Related papers (2022-07-11T15:17:58Z) - Trading causal order for locality [0.0]
Quantum theory admits ensembles of quantum nonlocality without entanglement (QNLWE)
We show how to perfectly discriminate some ensembles using local operations and classical communication without definite causal order.
arXiv Detail & Related papers (2022-02-01T14:49:58Z) - Experimental violations of Leggett-Garg's inequalities on a quantum
computer [77.34726150561087]
We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems.
Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
arXiv Detail & Related papers (2021-09-06T14:35:15Z) - 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) - Quantum Circuits assisted by LOCC: Transformations and Phases of Matter [0.7734726150561088]
We introduce deterministic state-transformation protocols between many-body quantum states which can be implemented by low-depth Quantum Circuits (QC) followed by Local Operations and Classical Communication (LOCC)
We show that this gives rise to a classification of phases in which topologically-ordered states or other paradigmatic entangled states become trivial.
arXiv Detail & Related papers (2021-03-24T17:44:34Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z)
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.