Quantum encryption in phase space with dynamic displacement operators and quantum permutation pad
Bibliographic record
Abstract
We propose the Dynamic Displacement Operator (DDO) as part of Quantum Encryption in Phase Space (QEPS-dd), a novel scheme for securing coherent optical communications using Quadrature Amplitude Modulation (QAM). In this framework, the K-QAM encoding is modeled as a quantum operator, with its constellation points forming the eigenbasis. The encoding and decoding processes are treated as operations of this quantum operator on its eigenstates, ensuring coherent communication via digital signal processing at both the transmission and reception sides. The DDO combines a displacement operator and a phase-shift operator, producing dynamic effects that enhance the randomization of the cipher constellation, thus significantly improving communication security. To further strengthen encryption, we introduce the Quantum Permutation Pad (QPP), which randomizes the DDO basis. Together, these components offer robust protection against both classical and quantum attacks. Our security analysis shows that the most effective attack is a brute-force search for the secret DDO pad, with a computational complexity of Ο(2ℓ!), where ℓ represents the bit length of the DDO pad. As ℓ increases, the factorial growth in complexity makes the system resistant to classical methods and quantum algorithms such as Grover’s search. Building on prior experimental results with phase-shift (QEPS-p) and displacement (QEPS-d) operators, we propose that QEPS-dd can be implemented for high-speed quantum-secure communication over existing optical networks, offering a practical solution for enhancing communication security.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".