Quantum Information Processing最新文献

This paper proposes a verifiable dynamic multi-dimensional quantum secret sharing scheme utilizing a generalized Hadamard gate. The dealer simultaneously distributes quantum and classical information to participants in a single distribution using a generalized Hadamard gate and a quantum SUM gate. To detect the malicious behavior of participants, the dealer prepares a sequence of checking particles. The participants retrieve the secret quantum state and classical information utilizing a generalized Hadamard gate and single-particle measurement. Additionally, the authenticity of secrets is ensured using a public hash function. While adding or removing participants, the dealer does not require assistance from other participants. The proposed protocol effectively thwarts eavesdroppers and participants from performing several types of attacks, including collusion, forgery, denial, and revoked dishonest participant attacks. The proposed protocol yields greater reliability, simplicity, versatility, and practicality.

The Internet of Things, smart grids, etc. contain processors, sensors, and communication hardware that exchange information with other devices in the network and act on the acquired information. These generate huge amounts of data which are stored in cloud/edge servers managed by third parties and are exposed to the internet. The data often include sensitive information, and the protection of such privacy-sensitive data is important. Attribute-based encryption is one of the most popular methods to address security and privacy challenges encountered in such cases. However, most of the existing classical attribute-based schemes are not secure against quantum attacks and can be broken using Shor’s algorithm. Given this, secure (single-authority) quantum attribute-based schemes have been recently studied. To the best of our knowledge, quantum multi-authority attribute-based schemes have not received much attention and are missing in the literature. Here, we propose a novel construction of a quantum multi-authority attribute-based encryption scheme. The privacy of the encryption scheme is derived using trap codes and quantum secret-sharing schemes. Our construction is based on discrete-time quantum walks and is shown to be portable and usable in several variants of multi-authority schemes. We also demonstrate quantum advantage in terms of computational cost.

Hyper-parallel quantum computation offers irreplaceable advantages in quantum information processing (QIP). In this article, based on the scattering property of photons off emitters coupled to one-dimensional (1D) waveguides, we propose three heralded schemes for implementing hyper-controlled-not (hyper-CNOT) gates on two-photon systems. The four qubits of our hyper-CNOT gates are encoded on the spatial-mode and the polarization degrees of freedom (DOFs) of two-photon systems. In our schemes, the faulty scattering events between photons and quantum emitters caused by system imperfections can be detected and discarded. Besides, no auxiliary photons are needed during the process, reducing the operation time and resource consumption in QIP. We also discuss the success probabilities and fidelities of our schemes, concluding that our schemes may be feasible under current technology.

Classical Physics-informed neural networks (PINNs) approximate solutions to PDEs with the help of deep neural networks trained to satisfy the differential operator and the relevant boundary conditions. We revisit this idea in the quantum computing realm, using parameterised random quantum circuits as trial solutions. We further adapt recent PINN-based techniques to our quantum setting, in particular Gaussian smoothing. Our analysis concentrates on the Poisson, the Heat and the Hamilton–Jacobi–Bellman equations, which are ubiquitous in most areas of science. On the theoretical side, we develop a complexity analysis of this approach, and show numerically that random quantum networks can outperform more traditional quantum networks as well as random classical networks.

Let p be an odd prime and r, s, m be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of (2^rp^s) over the finite field (mathbb {F}_{p^m}). Through the utilization of CSS and Steane’s constructions, a series of new quantum error-correcting (QEC) codes are constructed with parameters distinct from all previous constructions. Furthermore, we identify all maximum distance separable (MDS) cyclic codes of length (2^rp^s), which are further utilized in the construction of QEC MDS codes. Finally, we introduce a significant number of novel entanglement-assisted quantum error-correcting (EAQEC) codes derived from these repeated-root cyclic codes. Notably, these newly constructed codes exhibit parameters distinct from those of previously known constructions.

This paper proposes a magnetic field measurement scheme based on a hybrid microwave optomechanical-magnetic coupled system. The proposed sensor comprises a yttrium iron garnet sphere and an optomechanical cavity, where the spring coefficient of the cavity is parametrically modulated. The results demonstrate that the system’s response to the input signal is significantly enhanced, amplifying the weak input signal while reducing the added noise of measurement below the standard quantum limit. Consequently, this hybrid system serves as an effective amplifier, generating a stronger output signal while maintaining sensitivity nearly identical to that of the bare system. We posit that these findings may offer an efficient method for magnetic field measurement and contribute to the advancement of technology in quantum precision measurements.

In quantum key distribution, secret randomness is extracted quantum-mechanically from two-sided local random choices of measurement bases. Subsequently, the public announcement of basis information is necessary to perform a security check and establish the key. Recent studies have demonstrated that, provided the basis information is accessible, even adversaries with limited computational power can readily compromise the key through side-channel attacks. In this paper, we propose a quantum key distribution scheme using entangled coherent states. The present scheme is based on the secure exchange of one-sided quantum randomness, thus obviating the necessity for basis-information announcement. This effectively closes the security loophole associated with access to basis information during side-channel attacks. The security of the present protocol has been verified against both local and global quantum attacks. Furthermore, the impact of high photon loss and an authentication scheme has been discussed.

Efficient decomposition of permutation unitaries is vital as they frequently appear in quantum computing. In this paper, we identify the key properties that impact the decomposition process of permutation unitaries. Then, we classify these decompositions based on the identified properties, establishing a comprehensive framework for analysis. We demonstrate the applicability of the presented framework through the widely used multi-controlled Toffoli gate, revealing that the existing decompositions in the literature belong to only four out of ten identified classes. Motivated by this finding, we propose transformations that can adapt a given decomposition into a member of another class, enabling resource reduction.

In this paper, we propose a protocol for quantum secure multiparty summation and privacy sorting based on inverse quantum Fourier transform. The protocol allows multiple participants to obtain the summation and sorting of their secrets without revealing their private inputs. Each participant in the protocol encodes his/her own secret input into the phase of the d-level entangled state of n particles by means of a phase transformation operator and an inverse quantum Fourier transform. Finally, all participants perform measurements and jointly calculate the sum of all the secret data, meanwhile deriving their own rankings of the private inputs based on the final results. Compared to the existing similar quantum summation and sorting protocols, this protocol requires only a one-time particle transmission and does not require private key sequences to encrypt secret information, resulting in higher quantum efficiency. The participants can further obtain the ranking of their secret inputs by themselves. The credibility of the protocol is demonstrated in security analysis and simulation.

It is well-known that maximally entangled GHZ states can achieve perfect teleportation and superdense coding, whereas maximally entangled W states cannot. However, it has been demonstrated that there exists a special class of non-maximally entangled W states, called as W-like states, which can overcome this limitation. Therefore, it is of great significance to prepare such W-like states for efficient quantum communication. Here, we propose two kinds of novel and efficient fusion schemes for atomic W-like states based on the large-detuning interactions between several atoms and a single-mode cavity field, with which large-scale atomic (|mathcal {W}_{N+M-1}rangle ) and (|mathcal {W}_{N+M+T-2}rangle ) states can be prepared, respectively, from two small-scale atomic (|mathcal {W}_{N}rangle ) and (|mathcal {W}_{M}rangle ) states and three small-scale atomic (|mathcal {W}_{N}rangle ), (|mathcal {W}_{M}rangle ) and (|mathcal {W}_{T}rangle ) states, by detecting the states of one or two of the fused atoms. Particularly, although the fusion process of our scheme involves particle loss, the corresponding success probability is high and fixed, which may induce high fusion efficiency. Furthermore, through the investigation of the resource cost and feasibility analysis, our protocol is simple and feasible under the current experimental conditions. All these suggest that it provides an alternative strategy for preparing large-scale atomic W-like states for perfect teleportation and superdense coding.