This preprint presents a dyadic probability distribution for prime identification through Fourier coefficients of subsystem purity in an entanglement protocol. It proves a composite-signal lower bound over 2≤n≤2(d−1)2 \leq n \leq 2(d-1), gives an explicit state-preparation circuit, derives sampling-cost comparisons, and provides exact-arithmetic and numerical validation. The accompanying ZIP contains the LaTeX source, reproducibility scripts, QASM circuit, generated data, figures, and verification report. All included results are classical calculations or ideal circuit simulations.
This preprint presents a dyadic probability distribution for prime identification through Fourier coefficients of subsystem purity in an entanglement protocol. It proves a composite-signal lower bound over 2≤n≤2(d−1)2 \leq n \leq 2(d-1), gives an explicit state-preparation circuit, derives sampling-cost comparisons, and provides exact-arithmetic and numerical validation. The accompanying ZIP contains the LaTeX source, reproducibility scripts, QASM circuit, generated data, figures, and verification report. All included results are classical calculations or ideal circuit simulations.
The identification of prime numbers is an ancient area of study with applications in cryptography and fundamental mathematical problems, such as the Riemann Hypothesis (RH). Classical algorithms, like the Sieve of Eratosthenes and the AKS Primality Test, are efficient examples for this purpose. However, quantum computing (QC), with its superior theoretical capacity, has inspired the development of quantum algorithms, many of which are probabilistic or rely on the RH. In this dissertation, we propose a deterministic and efficient quantum algorithm that generalizes a recent method from quantum optics to identify prime numbers through entanglement dynamics. We adapted this method for QC, removing several constraints from the original work, and showed that discrete bipartite quantum systems prepared in certain initial states can be used to identify prime numbers through the Fourier modes of the reduced purity of one of the subsystems. The proposed algorithm is viable for implementation in future fault-tolerant QC systems. The initial steps involve encoding the system in qubits and preparing a maximally superposed state. In the state evolution step, we use Walsh matrices to efficiently prepare diagonal unitary gates. The reduced purity is measured using a modified controlled-SWAP test, and the Fourier modes are obtained via the numerical calculation of a one-dimensional integral. Subsequently, we present the simulations performed in Qiskit, which demonstrate the validity of the algorithm in all its stages. Finally, we discuss the computational cost, quantifying the number of elementary gates as a function of the number of qubits and speculating the total computational complexity of the algorithm.
We implement a quantum protocol for prime number identification based on entanglement dynamics, using IBM quantum processors. The method links the primality of an integer to specific Fourier components extracted from the time evolution of entanglement in a bipartite quantum system. To mitigate experimental noise, we introduce a noise-mitigation method based on a global rescaling factor, which is calibrated on a subset of circuits and extrapolated across different configurations. Theoretical support is provided by a new analytical bound for the Fourier modes derived assuming an initial uniform superposition state. This new bound enhances the separation between prime and composite numbers under moderate experimental deviations. These results represent a step toward practical number-theoretic applications on noisy intermediate-scale quantum (NISQ) devices.
A change of quantum reference frame can leave a preparation label readable while spoiling spectrum broadcast structure (SBS). For a binary preparation with exact laboratory SBS, this preprint proves matching inverse-square error bounds in the number of public position-encoding outcomes and exponential bounds in the actual-source information or message-entropy budget, in the narrow-packet limit at fixed budget. The lower bounds allow arbitrary message-conditioned targets that are classical on the system. On the same finite-width input chosen for each target error, coherent measurement of the old origin after the frame change achieves that error with asymptotically fewer public outcomes than position encoding. The paper also gives a finite-mode implementation under selective origin–ancilla control. The deposit includes the preprint, a Supplemental Material guide, and a reproducibility archive containing the LaTeX sources, figure-generation and verification scripts, figures, and numerical results.
This archive accompanies the paper Architecture-Sensitive Noise Fingerprints in Classical Statistics of Quantum States. It contains the full manuscript, all figures appearing in the paper, and the Python scripts used to generate the numerical results. The project demonstrates that classical measurement statistics obtained from noisy quantum states retain reproducible, architecture-dependent structure. Even under standard local, Markovian noise models, simple low-order classical features—such as entropy, maximum probability, parity mass, and Hamming-weight distributions—encode diagnostic fingerprints of the underlying quantum state architecture. The analysis focuses on stabilizer states (including GHZ, cluster, and star graph states), fixed measurement bases, and exact probability distributions. No machine learning, optimisation, tomography, or state reconstruction is used. All results are generated using transparent, reproducible numerical simulations. The contents of this archive are: LaTeX source and compiled PDF of the manuscript All figures used in the paper (PDF/PNG) Python scripts for generating the figures and classical feature data A README describing structure and reproducibility This archive is intended to support transparency, reproducibility, and reuse of the results, and may serve as a lightweight reference for diagnostic approaches to quantum noise and state architecture.
This paper characterizes the fixed finite positive semidefinite composition partners whose tensor powers test strong positivity of every finite Hermitian matrix: a partner is universal exactly when it has a nonreal entry in the specified history basis. Constructive proofs give explicit copy bounds, finite-depth spectral and tolerance certificates, a finite-family obstruction, and a quantum-history realization. For a noisy two-history family, all-event lower bounds and explicit exposing events establish sharp weak-imaginary resource scaling. Further results include an exact pure-phase onset and conditional finite-composition CHSH certificates. The accompanying ZIP contains the LaTeX source, six exact standard-library Python checkers and their results, a package verifier and file hashes. Priority remains unestablished. No derivation of a physical probability law is claimed.Robert Barritz directed the research and its preparation for publication. OpenAI’s ChatGPT and Codex systems contributed substantially to mathematical formulation, proof development and examination, examples, exact computational verification, literature comparison, and manuscript preparation. Anthropic’s Claude contributed mathematical, computational, and literature review that informed revisions. The AI contribution extended substantially beyond language editing. AI-assisted review does not constitute human expert or journal peer review.
The quest for prime numbers remains a fundamental challenge in mathematics, driving a persistent desire for more efficient prime number generation techniques. Classical methods often struggle to produce sufficient numbers, while the search for novel prime distribution patterns is a long-standing endeavor. This paper explores a novel approach utilizing quantum simulation to generate and analyze prime number sequences with significantly enhanced density. We propose a quantum simulation technique that leverages quantum entanglement to create a highly complex, multi-scale model of prime number distribution. This model allows for the identification of intricate patterns and distributions, far exceeding the capabilities of classical computation. We detail the theoretical framework, the quantum algorithm implementation, and preliminary results demonstrating a substantial increase in prime number density compared to existing methods. This advancement holds the potential to revolutionize prime number discovery and contribute to a deeper understanding of the fundamental properties of prime numbers.