Geometrical constructions of purity testing protocols and their applications to quantum communication

• URL: http://arxiv.org/abs/2503.14003v1
• Date: Tue, 18 Mar 2025 08:09:33 GMT
• Title: Geometrical constructions of purity testing protocols and their applications to quantum communication
• Authors: Róbert Trényi, Simeon Ball, David G. Glynn, Marcos Curty,
• Abstract summary: We provide geometrical constructions for protocols that originate directly from classical linear error correcting codes (LECCs)<n>We investigate the implications of our results in various tasks, including error detection, entanglement purification for general quantum error models and quantum message authentication.
• Score: 1.8749305679160366
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Purity testing protocols (PTPs), i.e., protocols that decide with high probability whether or not a distributed bipartite quantum state is maximally entangled, have been proven to be a useful tool in many quantum communication applications. In this paper, we provide geometrical constructions for such protocols that originate directly from classical linear error correcting codes (LECCs), in a way that the properties of the resulting PTPs are completely determined from those of the LECCs used in the construction. We investigate the implications of our results in various tasks, including error detection, entanglement purification for general quantum error models and quantum message authentication.

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)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Single-shot decoding of good quantum LDPC codes [38.12919328528587]
  We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise. We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
  arXiv  Detail & Related papers  (2023-06-21T18:00:01Z)
• Communication protocols and QECCs from the perspective of TQFT, Part I: Constructing LOCC protocols and QECCs from TQFTs [0.0]
  Topological quantum field theories (TQFTs) provide a general language for describing quantum-state preparation and measurement. Here we show that LOCC protocols generically induce quantum error-correcting codes (QECCs) In the accompanying Part II, we show that QECCs can be regarded as implementing, or inducing the emergence of, spacetimes on the boundaries between interacting systems.
  arXiv  Detail & Related papers  (2023-03-29T05:24:03Z)
• Boosted quantum and semi-quantum communication protocols [0.0]
  We show that it is possible to reduce the number of such runs by a suitable design of the key generation rule. We illustrate this advantage by proposing quantum and semi-quantum key distribution protocols.
  arXiv  Detail & Related papers  (2023-03-24T12:33:22Z)
• 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)
• All-photonic one-way quantum repeaters [15.3862808585761]
  We propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction. We present a novel decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network.
  arXiv  Detail & Related papers  (2022-10-18T18:07:19Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• A context-aware gate set tomography characterization of superconducting qubits [1.4979445283937185]
  We introduce a context-aware version of the gate set tomography protocol. We experimentally infer context-dependent errors in a publicly accessible cloud-based superconducting qubits platform. Our results show that when the GST is upgraded to include such features of context-awareness, a large coherence in the errors is observed.
  arXiv  Detail & Related papers  (2021-03-17T21:41:26Z)
• Multi-party quantum fingerprinting with weak coherent pulses: circuit design and protocol analysis [0.0]
  We introduce a novel multi-user quantum fingerprinting protocol that is ready to be implemented with existing technology. Much of the importance of our work arises from the fact that the obtained QCC figures of merit allow direct comparison with the best-known classical multi-user fingerprinting protocol.
  arXiv  Detail & Related papers  (2020-06-01T04:28:52Z)
• 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.