arXiv:2610.12264
Experimental generation of asymmetric keys from the parity structure of a two-photon six-qubit entangled state
Sanchari Chakraborti, Soumya Asokan, Sunita Khoth, Sujai Matta, C. M. Chandrashekar
Abstract
We propose and experimentally demonstrate an asymmetric key-generation scheme in which public and private keys are derived from a six-qubit photonic entangled state. A six-qubit entangled state is generated from two photons, each carrying one polarization and two path qubits. The state is prepared in an equal superposition of eight of the sixty-four six-qubit basis states, in which each photon's three qubits form a codeword of the classical [3,2,2] even-parity code, and are distributed between the two parties, Alice and Bob. This ensures, each triple is a uniformly random codeword and the two codewords are locked together through the correlation. The parity constraint is a local stabilizer, so each party verifies it on its own data every round, and eliminates the bit flip errors arising from imperfections, detector dark counts and multiple occupancy before it enters the raw key. A single publicly announced bit, chosen at random from either of the path qubits, allows each party to reconstruct the other's full triple while leaking no information to third party. We realize the desired six-qubit state using a Sagnac-based type-II SPDC source, reporting a Bell-CHSH parameter S = 2.798 +/- 0.008, by implementing gate operation on polarization and path degree's of freedom. This approach provides a physics-based alternative to public-key cryptosystems built on computational hardness assumptions. A t-bit string generated from multiple rounds for encryption will be intrinsically random. Without the private key, one needs at least O(2^t) runs on an t-qubit quantum system to find the matching bit to decrypt.
AI Summary
The paper investigates whether local parity encoding of a shared photonic Bell pair can support key reconstruction, public announcements, and round-by-round error detection. Each photon carries one polarization and two path qubits. Local Hadamard and CNOT operations produce a six-qubit state supported uniformly on eight computational-basis strings, with each party’s triple belonging to the classical $[3,2,2]$ even-parity code and the polarization bits anticorrelated. After computational-basis measurement, Alice announces one path bit; Bob combines it with his polarization outcome to reconstruct Alice’s triple. The paper describes the announced bit as a public key and the remaining pair as private encryption bits, claiming two encryption bits per round. These retained bits satisfy $x_{p'}=x_1\oplus x_p$, so they are deterministically related once the announcement is known. Local parity checks detect odd-weight bit flips but not double flips; errors affecting the distributed pair before encoding also pass these checks. A table-top implementation uses a Sagnac type-II SPDC source and polarization/path optical encoders. Source tomography gives Bell-state fidelity $0.987$, and a CHSH measurement yields $S=2.798\pm0.008$. Coincidence measurements give a raw event rate of $130.925\pm0.114$ kHz and QBER $(4.61\pm0.02)\%$. Counting two bits per desired event gives a reported private-bit rate of approximately $249.77$ kbit/s. Experimentally, every registered detector outcome is assigned a valid codeword, so no recorded round fails the local parity check. The reported rates are not final secret-key rates after error correction and privacy amplification; security is argued through entanglement monogamy and source characterization.
Central claim may not hold: The two retained encryption bits satisfy x_1 XOR x_p'=x_p, so the public announcement reduces their joint secret entropy to one bit and lets an observer recover the parity of every two-bit plaintext block. The protocol requires pre-established entanglement-derived secret data for encryption and decryption and provides no encryption procedure usable with the announced public bit alone, so it does not implement the claimed public-key alternative. The parity check misses even-weight flips and pre-encoding pair errors, while the experiment records only codeword-labelled outcomes and does not demonstrate the claimed round-by-round fault rejection. The source CHSH measurement does not establish the complete protocol's security, and the paper derives neither an adversarial secret-key bound nor the asserted O(2^t) quantum-search requirement. The claimed 249.77 kbit/s private-bit rate doubles a retrospectively selected signal rate rather than an operational secret-key rate, and its reported uncertainty is inconsistent with doubling the stated signal-rate uncertainty.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 12 pages, 8 figures