International Journal of Quantum Information

Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a quantum algorithm. Using the graph-theoretical ZX-calculus, we describe and apply a general scheme for reformulating quantum circuits as MBQC implementations. After illustrating the method using the two-qubit Deutsch–Jozsa algorithm, we derive a ZX graph-diagram that encodes a general MBQC implementation for the three-qubit Deutsch–Jozsa algorithm. This graph describes an 11-qubit cluster state on which single-qubit measurements are used to execute the algorithm. Particular sets of choices of the axes for the measurements can be used to implement any realization of the oracle. In addition, we derive an equivalent lattice cluster state for the algorithm.

In this paper, we discuss a protocol for preparing a non-maximally entangled W-state at a distant location where there are two parties intending such creation each of whom possesses only partial information about the state. These two parties along with a third party Controller, participate in a single protocol in order to create the intended state in the hands of a fourth party. The role of the controller is to fabricate an 8-qubit entangled state and distribute the respective qubits involved in the entangled state to the relevant parties and thereby creating a noisy quantum channel. The protocol is first ideally discussed in the noise-free case which is then a perfect joint remote state preparation protocol with fidelity 1. Then, we discuss the performance of the protocol in the presence of noise in which the fidelity is diminished. We consider three different types of noises and analyze the variation of fidelity of the process.

For a three-level system monitored by an ancilla, we show that the quantum Zeno effect can be employed to control quantum jump for error correction. Further, we show that we can realize cNOT gate, and effect dense coding and teleportation using a three-level system with an ancilla. We believe that this work paves the way to generalize the control of a qudit.

Quantum information and quantum foundations are becoming popular topics for advanced undergraduate courses. Many of the fundamental concepts and applications in these two fields, such as delayed choice experiments and quantum encryption, are comprehensible to undergraduates with basic knowledge of quantum mechanics. In this paper, we show that the quantum eraser, usually used to study the duality between wave and particle properties, can also serve as a generic platform for quantum key distribution. We present a pedagogical example of an algorithm to securely share random keys using the quantum eraser platform and propose its implementation with quantum circuits.

Quantum digital signature, as an extension of classical digital signature, has become an important research content in quantum cryptography. Quantum blind signature combines the advantages of classical blind signature and quantum signature, which can ensure the unconditional security of the scheme based on the realization of the blinded signature of the message, and can be effectively applied in many real-world scenarios. This paper uses the four-particle $\chi$ state as a communication channel, combined with quantum teleportation technology to propose a new quantum multi-party blind signature protocol, which has the following characteristics: First, the Toeplitz hash function based on the linear shift register is introduced to blind the message, and the length of the blinded message can be adjusted according to the actual demand to increase the flexibility of the scheme; Second, through multi-party participation, the blind signature of multi-bit messages can be realized, and the signature efficiency can be improved. Compared with other quantum blind signatures, the signature efficiency has been greatly improved; Finally, using the four-particle $\chi$ state as a quantum channel can make the scheme use fewer resources to transmit data and increases the security of the scheme. Through security analysis, it can be seen that the scheme has blindness, nonrepudiation and unforgeability.

This paper focuses on stakeholder identification as per the value sensitive design (VSD) approach applied to the context of quantum technologies (QT) and contributes to a better understanding of the complex and dynamic nature of the QT landscape. We provide two comprehensive lists of stakeholders as starting points for VSD researchers and practitioners. These lists encompass a diverse range of organizations, including private companies, government agencies, NGOs, partnerships and professional/trade organizations. Our aim is to facilitate the recognition, legitimation and understanding of stakeholder interactions in the development of QT. These stakeholder lists lay a foundation for designing and implementing policies and strategies that promote the ethical and responsible development of QT, considering the values and interests of various stakeholders. Furthermore, these lists enable empirical and technical studies on specific QT innovations using an ethics-by-design approach like VSD.

The no-go theorem regarding unconditionally secure Quantum Bit Commitment protocols is a relevant result in quantum cryptography. Such result has been used to prove the impossibility of unconditional security for other protocols such as Quantum Oblivious Transfer or One-Sided Two Party Computation. In this paper, we formally define two non-deterministic versions of Quantum Private Queries, a protocol addressing the Symmetric-Private Information Retrieval problem. We show that the strongest variant of such scheme is formally equivalent to Quantum Bit Commitment, Quantum Oblivious Transfer and One-Sided Two-Party Computation protocols. This equivalence serves as conclusive evidence of the impracticality of achieving unconditionally secure Strong Probabilistic Quantum Private Queries.

This work proposes a $d$-dimensional quantum multi-secret sharing scheme with a cheat-detection mechanism. The dealer creates multiple secrets and distributes the shares of these secrets using multi-access structures and a monotone span program. The dealer detects the cheating of each participant using the black box’s cheat-detection mechanism. To detect the participants’ deceit, the dealer distributes secret shares’ shadows derived from a randomly invertible matrix $X$ to the participants, stored in the black box. The black box identifies the participant’s deceitful behavior during the secret recovery phase. Only honest participants authenticated by the black box acquire their secret shares to recover the multiple secrets. After the black box cheating verification, the participants reconstruct the secrets by utilizing the unitary operations and quantum Fourier transform. The proposed protocol is reliable in preventing attacks from eavesdroppers and participants. The scheme’s efficiency is demonstrated in different noise environments: dit-flip noise, $d$-phase-flip noise and amplitude-damping noise, indicating its robustness in practical scenarios. The proposed protocol provides greater versatility, security and practicality.

A relay-assisted scheme for quantum key distribution (QKD) over long atmospheric channels is proposed. In this scheme, a polarization orbital-angular-moment with measurement-device-independent (POAM-MDI) QKD for quantum relay is designed to both reconstruct the turbulence-degraded qubits and redirect the qubits to the next relay or to Bob who performs detection randomization. The proposed scheme will neither be time-consuming nor lead to unstable or even intermittent in volatile environments. Theoretical and numerical results show that the proposed relay-assisted scheme outperforms the conventional direct transmission over long atmospheric channels.

This paper focuses on the construction of a general parametric model that can be implemented executing multiple swap tests over few qubits and applying a suitable measurement protocol. The model turns out to be equivalent to a two-layer feedforward neural network which can be realized combining small quantum modules. The advantages and the perspectives of the proposed quantum method are discussed.

The development of new quantum watermarking is in full swing, and it is crucial to test the robustness of these proposed watermarking schemes. In this paper, different quantum circuits are introduced to realize geometric transformations on quantum images, which serve as a means of simulating geometric attacks on quantum watermark images. Receivers may get distorted images, and the extracted watermark images may also be disrupted. To recover the geometric order of the quantum watermark images, a strategy is proposed to identify the trajectory of qubit alterations. Quantum circuits can be designed accordingly to restore the original order of the watermark images, which receivers could use before the extraction process to mitigate the impact of geometric attacks. Experimental simulations demonstrate how attacks affect the quantum watermark images and the extracted watermark images. Additionally, it illustrates how quantum recovery circuits step by step act on images that have been geometrically attacked. An analysis of the complexity of geometric restoration circuits reveals that quantum circuits exhibit better performance compared to classical circuits.

The early work of Wei et al. has shown that it is possible to do the computation in constant time for quantum search in quantum local adiabatic evolution framework if the system Hamiltonian has an extra enlarged factor proportional to the square-root of the size of the problem. Also in our prior work, we have shown that it is possible to apply a linear interpolating path in the system Hamiltonian to achieve an O(1) time complexity for a quantum global adiabatic computation. In this paper, we discuss the issues when implementing these two quantum algorithms on the quantum circuit model, and find that to our surprise, the time slices produced does not equal to the time complexity of the algorithm in each case. This is in contrast to the previous related results, because there these two quantities always coincide. When taking into account of the whole energy-level increase of the system compared with that of the usual quantum adiabatic evolutions and the corresponding time complexity simultaneously, we find that the time slices needed always consist of the two quantities multiplying together. This result is new, and may be hopeful to find application in designing quantum adiabatic algorithm for problems beyond quantum search.

Quantum coherence serves as a crucial physical resource, with its quantification emerging as a focal point in contemporary research. Superadditivity constitutes one of the most fundamental attributes in characterizing the coherence distribution in multipartite quantum systems. In this paper, we provide a way to derive tighter superadditivity inequalities of $l_1$-norm coherence measure for arbitrary multiqubit states. We present a category of superadditivity relations related to the $\alpha$th $(\alpha \ge 2)$ power of $l_1$-norm coherence $C_{l_1}$ under certain conditions. Our results are better than the existing ones and are illustrated in detail with examples.

Recurrent neural networks are a kind of recursion which takes sequence data as input and carries on the evolution of temporal dependency data. Variational quantum algorithms use classical computers as the quantum optimizer to update the circuit parameters. In this work, we propose a variational quantum algorithm of the recurrent neural network, which we dub VQRNN, to find approximate optima in the time series forecasting. Motivated by the variational quantum algorithms, we train classical activation functions to assist quantum computing. Here, unlike the quantum tensor networks (QTN) algorithm that predicts a single output feature with a single time step, our algorithm can forecast multi-output features by adjusting the recurrent hidden state. Finally, we deploy the QTN and VQRNN algorithms on the Origin Quantum platform with the numerical simulator backends using the Meteorological data set. Experimental results show that the atmospheric pressure prediction accuracy of VQRNN is 99.8864% in multi-feature forecasting tasks. In addition, we conclude that the variation-based model has an excellent performance in multi-feature output forecasting.

There exist two types of configurations of marked vertices on a two-dimensional grid, known as the exceptional configurations, which are hard to find by the discrete-time quantum walk algorithms. In this article, we provide a comparative study of the quantum walk algorithm with different coins to search these exceptional configurations on a two-dimensional grid. We further extend the analysis to the hypercube, where only one type of exceptional configurations are present. Our observation, backed by numerical results, is that our recently proposed modified coin operator is the only coin which can search both types of exceptional configurations as well as nonexceptional configurations successfully. As a consequence, we observe that the existence of exceptional configurations are not a quantum phenomenon, rather a mere limitation of some of the coin operators.