Device-independent Quantum Key Distribution in the commuting operator framework

• URL: http://arxiv.org/abs/2607.03579v1
• Date: Fri, 03 Jul 2026 19:44:10 GMT
• Title: Device-independent Quantum Key Distribution in the commuting operator framework
• Abstract summary: Device-independent quantum key distribution (DIQKD) is arguably the gold standard for secure quantum communication.<n>Existing proof techniques do not always meet this goal as they tend to rely on subtile assumptions.<n>We show that task of computing key rates can be casted as a non-commutative optimization problem.
• Score: 10.668771582679561
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Device-independent quantum key distribution (DIQKD) is arguably the gold standard for secure quantum communication, as it aims to rely only on observed input-output statistics of an uncharacterized device which is only assumption to obey the laws of quantum physics. A corresponding security analysis hence demands a description of a quantum experiment from a most general perspective. Under close inspection, existing proof techniques do not always meet this goal as they tend to rely on subtile assumptions on a tensor product structure of the underlying Hilbert space and a 'hidden but finite' dimensionality. In this work, we collect the tools needed for a full analysis of DIQKD in the commuting operator framework, which avoids these subtilities and provides the arguably most general view on a quantum experiment. We rigorously proof the common assumption that in DIQKD measurements can be w.l.o.g. assumed to be projective. Furthermore, we show that task of computing key rates can be casted as a non-commutative polynomial optimization (NPO) problem to which the Navascués-Pironio-Acín (NPA) hierarchy gives a correct and converging relaxation. As a tool, we generalize the integral representation for the relative entropy by Frenkel [Quantum 7, 1102 (2023)] to general von Neumann algebras and apply techniques from Kossmann and Schwonnek [arXiv: 2411.04858] for the approximation in an NPO program.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization [50.880384999888044]
  We develop misspecified GP bandit algorithms and derive regret bounds that characterize the trade-off between approximation error and information gain.<n>Our methods outperform full quantum kernels in sample efficiency, while substantially reducing computational overhead.
  arXiv  Detail & Related papers  (2026-07-01T15:38:00Z)
• A Fully Device-Independent Ternary Quantum Key Distribution Protocol Based on the Impossible Colouring Game [0.59374762912328]
  We propose a quantum key distribution protocol based on the two-party Impossible Colouring pseudo-telepathy game.<n>The protocol harnesses Bell inequality violations that arise from contextuality in the Kochen-Specker theorem.<n>It operates within an adequate security framework and demonstrates an improved key generation rate compared to standard quantum key distribution schemes.
  arXiv  Detail & Related papers  (2025-05-21T14:52:31Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
  Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs.<n>Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.<n>We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries.<n>We introduce a second model where the QPUF functions as a nonunitary quantum channel, which guarantees existential unforgeability.
  arXiv  Detail & Related papers  (2024-04-17T12:16:41Z)
• Quantum singular value transformation for an arbitrary bounded operator embedded in a unitary operator [0.65268245109828]
  This research extends quantum singular value transformation (QSVT) for general bounded operators embedded in unitary operators on possibly infinite-dimensional Hilbert spaces. We have achieved a refined operator-theoretic understanding of QSVT, leading to a more streamlined approach.
  arXiv  Detail & Related papers  (2024-01-17T07:06:31Z)
• Harnessing high-dimensional temporal entanglement using limited interferometric setups [41.94295877935867]
  We develop the first complete analysis of high-dimensional entanglement in the polarization-time-domain. We show how to efficiently certify relevant density matrix elements and security parameters for Quantum Key Distribution. We propose a novel setup that can further enhance the noise resistance of free-space quantum communication.
  arXiv  Detail & Related papers  (2023-08-08T17:44:43Z)
• Entropy Accumulation under Post-Quantum Cryptographic Assumptions [4.416484585765028]
  In device-independent (DI) quantum protocols, the security statements are oblivious to the characterization of the quantum apparatus. We present a flexible framework for proving the security of such protocols by utilizing a combination of tools from quantum information theory.
  arXiv  Detail & Related papers  (2023-07-02T12:52:54Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Quantum Complementarity Approach to Device-Independent Security [2.782396962787398]
  We show the complementarity security origin of device-independent quantum cryptography tasks. We generalize the sample entropy in classical Shannon theory for the finite-size analysis. Applying it to the data in a recent ion-trap-based device-independent quantum key distribution experiment, one could reduce the requirement on data size to less than a third.
  arXiv  Detail & Related papers  (2021-11-27T09:42:44Z)
• 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)
• 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.