Quantum Information Processing最新文献

Centralized and distributed hybrid quantum–classical generalized Benders decomposition (GBD) algorithms are proposed to address unit commitment (UC) problems. In the centralized approach, the quantum GBD transforms the master problem (MP) into a quadratic unconstrained binary optimization form suitable for quantum computing. For distributed systems, the consensus-inspired quantum GBD (CIQGBD) and its partially distributed variant, D-CIQGBD, are proposed based on optimizing the allocation of relaxation variables directly. D-CIQGBD leverages the dual information of the improved sub-problems to construct more rational local cutting planes, which are then used to decompose the MP into local master problems (LMPs). This approach not only enhances the minimum eigenenergy gap of the system Hamiltonian during quantum annealing and improves the computational efficiency, but also reduces the qubit overhead and addresses the partitioning requirements. Extensive experiments under various UC scenarios validate the performance of the abovementioned hybrid algorithms. Compared to the classical solver Gurobi, D-CIQGBD demonstrates a speed advantage in solving the security-constrained UC problem on the IEEE RTS 24-bus system. These results provide new perspectives on leveraging quantum computing for the distributed optimization of power systems.

In this work, we investigate the possibility of predicting the phenomena of the quantum Mpemba fractionally, where it is assumed that a single qubit, which is initially prepared in three different cases, hottest, hotter and colder states, interacting with its surroundings made up of two qubits via XYZ chain model in the presence of Dzyaloshinskii–Moriya interaction (DM). The trace distance between the equilibrium and time fractional evolution of the system is used to predict the Mpemba phenomena. The impact of the interaction parameters and the fractional orders on the stabilization behavior of the qubit is discussed. It is shown that thermalization case is reached at small fraction order during a short interaction time. However, as one increases the fractional orders, the thermalization is observed at large interaction time. For ferromagnetic case and large strength of DM interaction, the stabilization behavior is predicted at small interaction time, while for anti-ferromagnetic and small values of DM, the stabilization is reached at large interaction time.

We propose a phenomenon of discrete-time quantum walks on graphs called the pulsation, which is a generalization of a phenomenon in the quantum searches. This phenomenon is discussed on a composite graph formed by two connected graphs (G_{1}) and (G_{2}). The pulsation means that the state periodically transfers between (G_{1}) and (G_{2}) with the initial state of the uniform superposition on (G_1). In this paper, we focus on the case for the Grover walk where (G_{1}) is the Johnson graph and (G_{2}) is a star graph. Also, the composite graph is constructed by identifying an arbitrary vertex of the Johnson graph with the internal vertex of the star graph. In that case, we find the pulsation with (O(sqrt{N^{1+1/k}})) periodicity, where N and k are the number of vertices and the diameter of the Johnson graph, respectively. The proof is based on Kato’s perturbation theory in finite-dimensional vector spaces.

In this study, we are testing the Shannon entropy of the Dirac oscillator in the background of a spinning cosmic string space-time and showing the influence of the cosmic string on this information measurement. In this case, by employing the formalism of Shannon information density, we quantify the uncertainty and delocalization of the wave function. Particular emphasis is placed on the influence of space-time rotation and topological defects, which lead to shifts in the oscillator’s energy spectrum and affect its quantum information content. Also, our results show the relation between quantum information theory and curved space-time, giving more explanation into quantum phenomena in the presence of cosmic defect parameters.

Many variations of Grover’s algorithm attempt to improve iteration count using a technique known as phase matching, replacing Grover’s phase-flip oracle with an (alpha )-rotation oracle that cannot be simulated using only one Grover oracle call. Previously it was shown that phase matching can always achieve 100% success probability with an iteration count within one step from the Grover algorithm. In this paper, we show that this is actually the optimal iteration count, hence finding the first proof of the minimal number of queries to solve the search problem with a known number of solutions whether we use an (alpha )-rotation or the Grover flip.

For quantum voice security, we offer an integrated functional system that (i) encapsulates threat models for voice biometrics within the quantum world, (ii) integrates PQC (Post-Quantum Cryptographic) foundations with quantum resilient detection, and (iii) provides prescriptive choices for parameters upon deployment with experimentally confirmed metrics. We model attacks as resource bounded CPTP (Completely Positive Trace Preserving) maps and Lindbladian flows, while we model voice recordings as hybrid quantum-classical objects within composite CV (Continuous Variable) and qubit Hilbert spaces. These three high-level categories of quantum threats are framed by such formalism: quantum generative spoofing (measured by TD (Trace Distance) of RQGAN (Relativistic Quantum Generative Adversarial Network)/QGAN (Quantum GAN) synthesis), quantum amplified adversarial perturbations (e.g., Groover accelerated search and entangled operator perturbations within Fock space), and retrospective cryptanalytic compromises (e.g., Shor enabled store now, decrypt later). To defend against such threats, we use a variety of lattice templates supported protection (RLWE (Ring Learning With Errors)/MLWE (Module LWE) with min-entropy and TTC (Time-To-Compromise) constraints met explicitly within choice of parameters), CV-QKD (CV–Quantum Key Distribution) if possible, randomized keyed encodings with gauge equivariant quantum QEC (Error Correcting Codes), and quantum resilient detection approaches (Wigner negativity witnesses, QCNN (Quantum Convolutional Neural Network) classifiers, and QFI (Quantum Fisher Information) detectability tests). Operational measures relating privacy leakage as well as detection sensitivity are the PDR (Purity Displacement Ratio), QSDI (Quantum Signal-to-Distortion Index), and QBFI (Quantum Biometric Fidelity Index). We also obtain security parameter and sample complexity bounds that translate immediately to code distance, encoder, and key size decisions. RLWE template secrecy with decryption failure probabilities experimental results on LibriSpeech, ASVspoof, and synth data confirm (<10^{-6}) under modeled attacks by noise as well as strong detection of quantum synthesised spoofs (deepfake detection (>96%), spoof suppression from 0.89 to 0.12 success) are achievable. Our technique provides insightful, empirical guideline direction toward voice authentication system development that is secure against existing as well as potential quantum threats (Note: abbreviations used over the course of study are tabulated in Appendix I).

We introduce the first quantum authentication scheme for continuous-variable (CV) states. Our scheme is based on trap states, and is an adaptation of a discrete-variable scheme by Broadbent et al. [15], but with more freedom in choosing the number of traps.The CV traps are squeezed states.As the CV variant of quantum one-time pad (QOTP) encryption we introduce gaussian-distributed displacements.We provide a security proof, mostly following the approach of Broadbent and Wainewright [13]. We take into account the inevitable imperfections due to the finite squeezing and the finite width of the gaussian QOTP distribution.As a necessary ingredient for the proof we derive the CV analogue of the Pauli Twirl. Since CV quantum systems fit well with existing optical communication infrastructure, they provide a promising platform for implementing quantum-cryptographic schemes and distributed quantum-computational tasks. This work expands the toolbox for securing CV quantum communication.

In this paper, we propose a counterfactual quantum communication protocol based on the chained quantum Zeno effect, which transfers the photonic part of constructed multipartite entangled states through a pair of entangled electrons. Subsequently, we report on a two-dimensional all-photonic quantum repeater protocol designed to generate multipartite entanglement over long distances between two network users. Finally, we present a counterfactual quantum network that enables two distant parties to communicate multiple messages without any transmission of quantum or classical particles.

Quantum key distribution (QKD) enables unconditional secure communication, but its security is fundamentally limited by reliance on classical identity authentication, which introduces vulnerabilities. This work proposes a quantum-fused authentication and QKD protocol incorporating identity verification entirely within the quantum layer. Specifically, we design a bidirectional identity-authenticated QKD protocol using single-photon sequences and unitary transformations, and further generalize it to the multiparty setting by introducing locally indistinguishable orthogonal product states as the encoding platform—a design exemplified with a detailed three-party case. Theoretical analysis and simulation results demonstrate that the protocol achieves reliable quantum authentication, efficient key distribution, and prevents information leakage, fundamentally removing risks associated with classical authentication. Our findings offer a practical and novel framework for strengthening the security of quantum communication systems.