SearcharxivSearch

arXiv · 2606.19551

Rotational Bell-State Loop-Back Key Establishment and Agreement Certification for Passive Users

Abstract

Server-aided Bell-state networks with sequential local encoding are an established approach to mediated key distribution. Against this background, we study a Loop-Back architecture in which two source-free, detector-free users transform the same traveling qubit. Alice privately samples $r\in\mathbb{Z}*2^2$, prepares $|β_r\rangle$ over the complete Bell basis, retains one qubit, and uses $r$ as the reference for the returned pair. A deterministic Pauli-composition mode, $U*{\mathrm{eff}}=U_2U_1$, serves as a reference to prior serial-unitary protocols. The main extension instead uses the two same-axis settings $R(\pmα)$ and a reference-versus-complement Bell test. Opposite rotations cancel, whereas equal rotations add, so $P(C\mid\mathrm{disagreement})=0$ and $P(C\mid\mathrm{agreement})=\sin^2(2α)$. At $α=π/8$, agreement is certified with probability $1/2$, and the overall conclusive-key probability is $1/4$ for unbiased choices. The same event supplies one shared raw-key bit. For the Pauli mode, a one-qubit Pauli twirl hides either user's factor from an endpoint mediator that may prepare an arbitrary qubit--ancilla state and choose the final measurement, provided the other Pauli is uniform and the traveler is inaccessible between users. The rotational guarantee is narrower: common-sign privacy holds only for the prescribed Bell source and coarse-grained instrument. A polarization implementation can normalize the private reference to the singlet and use a beam splitter with verified two-photon detection; loss produces a third, discarded outcome. The proposal is theoretical and does not claim composable security or experimental validation.

Explore related subjects

Keep this discovery

BibTeXRIS

Luis Adrián Lizama-Pérez. 2026-08-19. Rotational Bell-State Loop-Back Key Establishment and Agreement Certification for Passive Users. https://doi.org/10.1016/j.osn.2026.100892

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Unconditional Certified Randomness without Structure

We obtain a certified randomness protocol in the quantum random oracle model. The protocol is non-interactive and publicly verifiable with a classical verifier, and is based on Yamakawa and Zhandry's proof of quantumness [JACM'24]. We prove unconditional security of this protocol against adversaries making subexponentially-many adaptive quantum queries to the random oracle. Prior work on certified randomness relative to a random oracle additionally assumed the Aaronson--Ambainis conjecture or proved security only against low query-depth adversaries.

quant-ph

High-Dimensional Deterministic Secure Quantum Communication with Reed-Solomon Erasure Coding

Deterministic Secure Quantum Communication (DSQC) is a quantum cryptographic technique engineered to transfer a message through a quantum channel, requiring an auxiliary classical channel for eavesdropping verification and decoding, but without prior key distribution. This article presents a theoretical high-dimensional prepare and measure DSQC protocol using the Reed-Solomon erasure coding to ensure data resilience to noise. This protocol offers the following benefits: it eliminates the need for quantum memory or entanglement, it can be built with commercially available technology, and its higher capacity improves the overall transmission rate.

quant-ph

Operational Roles of QRNG-Derived Quantum Entropy in Bitcoin Proof-of-Work Architectures

Replacing classical entropy with QRNG output does not change honest Bitcoin PoW success probability when candidate headers remain distinct. The original contribution of this paper is a reproducible benchmark that locates and measures the operational value of quantum entropy in hybrid quantum-classical mining infrastructure through two scheduler-level observables, the entropy-efficiency factor $η$ and the reboot-diversity index $ρ$. Monte Carlo and scheduler simulations with confidence intervals show parity for competent deterministic and strong-classical baselines, while QRNG value emerges in assurance-oriented scenarios involving correlated restart faults, namespace reuse, and entropy provenance. The study is therefore positioned as a simulation-based validation framework rather than as a device-level QRNG demonstration; hardware-in-the-loop validation with recorded or live QRNG streams is identified as the next experimental step.

cs.CR