Quantum Information Processing最新文献

Graph-structured data commonly arise in many real-world applications, and this extends naturally into the quantum setting, where quantum data with inherent graph structures are frequently generated by typical quantum data sources. However, existing state-of-the-art models often lack training and evaluation on deeper quantum neural networks. In this work, we design a hybrid quantum-classical neural network with deep residual learning, termed Res-HQCNN, specifically designed to handle graph-structured quantum data. Building upon this architecture, we systematically explore the interplay between residual block structures and graph information in both training and testing phases. Through extensive experiments, we demonstrate that incorporating graph structure information into the quantum data significantly improves learning efficiency compared to the existing model. Additionally, we conduct comparative experiments to evaluate the effectiveness of residual blocks. Our results show that the residual structure enables deeper Res-HQCNN models to learn graph-structured quantum data more efficiently and accurately.

This manuscript presents a novel quantum image encryption scheme that integrates two independent two-dimensional (2D) Arnold cat maps—one for spatial permutation and one for intensity permutation—with a robust chaotic diffusion process. This unified dual-permutation framework–applying independent permutations to spatial and intensity data–distinguishes itself from prior dual-map approaches and, to our knowledge, has not been previously explored in QIE. The algorithm features dual permutation, where independent cat maps are applied to coordinate and nibble-split pixel data, followed by quantum diffusion implemented through bit-plane cyclic shifts, chaotic key-based modular addition, and intra-qubit XOR operations. Critically, we provide the explicit formulation of the mathematical operators governing these quantum state transformations, addressing a key limitation of prior works. Moreover, since the proposed encryption transformations are formulated in terms of unitary quantum operators, the scheme is scalable, ensuring that our mathematical framework remains valid for future fault-tolerant quantum computers. This approach ensures that both spatial and intensity information are thoroughly scrambled, resulting in cipher images with near-uniform histograms, near-zero correlation coefficients, and extreme key sensitivity. The quantum implementation offers a theoretical exponential speedup in circuit depth compared to classical (O(R cdot N^2)) time complexity counterparts while resisting statistical, differential, and brute-force attacks through chaotic parameterization. Comprehensive experimental validation confirms the cryptographic superiority of our scheme: it achieves information entropy values exceeding 7.999, Number of Pixel Change Rate (NPCR) > 99.6%, and Unified Average Changing Intensity (UACI) (sim )33.46% on standard test images, outperforming recent state-of-the-art algorithms.

The k-partite entanglement, which focus on at most how many particles in the global system are entangled but separable from other particles, is complementary to the k-entanglement that reflects how many split subsystems are entangled under partitions of the systems in characterizing multipartite entanglement. Very recently, the theory of the complete k-entanglement measure has been established in [Phys. Rev. A 110, 012405 (2024)]. Here we investigate whether we can define the complete measure of the k-partite entanglement. Consequently, with the same spirit as that of the complete k-entanglement measure, we present the axiomatic postulates that a complete k-partite entanglement measure should require. Furthermore, we present two classes of k-partite entanglement measures and show that one is complete while the other one is unified but not complete except for the case of (k=2).

The analytical solution of the system of three-level atom in (Lambda ) configuration interaction with two modes in the presence of a degenerate parameter amplifier term is presented. We investigate the effects of a degenerate parameter amplifier on the quantum properties of the atomic system. Specifically, we analyze how the presence of the parametric amplifier influences the atomic Fisher information, which quantifies the amount of information that can be extracted about a parameter from measurements on the quantum state. Additionally, we study the quantum coherence, which measures the superposition of states, and the second-order correlation function, which provides insights into the statistical properties of the emitted photons. In our analysis, we assumed that the atom in the upper state and the field in the squeezed-pair coherent state. Our results reveal that the presence of the degenerate parameter amplifier significantly enhances the quantum coherence of the atomic states. Furthermore, we demonstrate that the atomic Fisher information, a crucial quantity for parameter estimation in quantum metrology, is substantially influenced by the amplifier’s parameters. The second-order correlation function, which characterizes the statistical properties of the emitted photons, exhibits notable modifications due to the atom-amplifier interaction. These findings provide new insights into the control and manipulation of quantum states in three-level atomic systems, with potential applications in quantum information processing and metrology.

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.