One-way Quantum Research Articles

Percolation-based architecture for cluster state creation using photon-mediated entanglement between atomic memories

A central challenge for many quantum technologies concerns the generation of large entangled states of individually addressable quantum memories. Here, we show that percolation theory allows the rapid generation of arbitrarily large graph states by heralding the entanglement in a lattice of atomic memories with single-photon detection. This approach greatly reduces the time required to produce large cluster states for quantum information processing including universal one-way quantum computing. This reduction puts our architecture in an operational regime where demonstrated coupling, collection, detection efficiencies, and coherence time are sufficient. The approach also dispenses the need for time-consuming feed-forward, high cooperativity interfaces and ancilla single photons, and can tolerate a high rate of site imperfections. We derive the minimum coherence time to scalably create large cluster states, as a function of photon-collection efficiency. We also propose a variant of the architecture with long-range connections, which is even more resilient to site yields. We analyze our architecture for nitrogen vacancy (NV) centers in diamond, but the approach applies to any atomic or atom-like systems.

Quantum Private Query Based on Stable Error Correcting Code in the Case of Noise

In order to protect the privacy of query users and databases, a quantum private query protocol under noisy conditions is proposed and studied. It is a one-way quantum protocol that not only protects user privacy, but also prevents eavesdropping. And in the protocol initialization phase, the identity is verified by the quantum entanglement pair. Through key distribution, a user only knows a part of the key, and the accuracy of the original key needs to be considered. Channel noise directly affects the transmission result of quantum bits and reduces the transmission accuracy. In addition, the presence of eavesdropper Eve may also affect the transmission of qubits. The receiver corrects the error by using quantum error correction technology, thereby improving the efficiency of protocol communication.

On Relation Between Linear Temporal Logic and Quantum Finite Automata

Linear temporal logic is a widely used method for verification of model checking and expressing the system specifications. The relationship between theory of automata and logic had a great influence in the computer science. Investigation of the relationship between quantum finite automata and linear temporal logic is a natural goal. In this paper, we present a construction of quantum finite automata on finite words from linear-time temporal logic formulas. Further, the relation between quantum finite automata and linear temporal logic is explored in terms of language recognition and acceptance probability. We have shown that the class of languages accepted by quantum finite automata are definable in linear temporal logic, except for measure-once one-way quantum finite automata.

Optimising the information flow of one-way quantum computations

In the one-way quantum computing model, the information processing is driven by measurements performed on an entangled state, called the resource state. In order to achieve parallelism, one aims to...

Quantum optical neural networks

Physically motivated quantum algorithms for specific near-term quantum hardware will likely be the next frontier in quantum information science. Here, we show how many of the features of neural networks for machine learning can naturally be mapped into the quantum optical domain by introducing the quantum optical neural network (QONN). Through numerical simulation and analysis we train the QONN to perform a range of quantum information processing tasks, including newly developed protocols for quantum optical state compression, reinforcement learning, black-box quantum simulation, and one-way quantum repeaters. We consistently demonstrate that our system can generalize from only a small set of training data onto inputs for which it has not been trained. Our results indicate that QONNs are a powerful design tool for quantum optical systems and, leveraging advances in integrated quantum photonics, a promising architecture for next-generation quantum processors.

Measurement-device-independent quantum secret sharing and quantum conference based on Gaussian cluster state

Cluster state is the basic resource for one-way quantum computation and a valuable resource for establishing quantum network, because it has a flexible and varied composition form. We present measurement-device-independent quantum secret sharing (QSS) and quantum conference (QC) schemes based on continuous variable (CV) four-mode cluster state with different structures. The users of the protocol prepare their own Einstein-Podolsky-Rosen (EPR) states, respectively. One mode of these EPR states is sent to an untrusted relay where a generalized Bell measurement creates different types of CV cluster states among four users, while the other mode is kept at their own station. We show that a shared secret key for QSS and QC schemes is distilled based on the shared quantum correlation among four users. QC and four users QSS are implemented based on the star shape CV cluster state. QSS with three users are implemented based on the linear or square shape CV cluster states. The results show that the secure transmission distance for an asymmetric network, where the transmission distances between the users and relay are different, is longer than that of a symmetric network, where the transmission distances between the users and relay are the same. The presented schemes provide concrete references for establishing quantum network with the CV cluster state.

On the possibility to detect quantum correlation regions with the variable optimal measurement angle

Quantum correlations described by quantum discord and one-way quantum deficit can contain ordinary regions with {\em constant} (i.e., universal) optimal measurement angle $0$ or $\pi/2$ with respect to the $z$-axis and regions with a {\em variable} (state-dependent) angle of the optimal measurement. The latter regions which are absent in the Bell-diagonal states are very tiny for the quantum discord and cannot be observed experimentally due to various imperfections on the preparation and measurement steps of the experiment. On the contrary, for the one-way quantum deficit we succeeded in getting the special two-qubit X states which seem to allow one to reach all regions of quantum correlation exploiting available quantum optical techniques. These states give possibility to deep investigation of quantum correlations and related optimization problems at new region and its boundaries. In the paper, explicit theoretical calculations applicable to one-way deficit are reported, together with the design of the experimental setup for generating such selected family of states; moreover, there are presented numerical simulations showing that the most inaccessible region with the intermediate optimal measurement angle may be resolved experimentally.

Phase diagram for the one-way quantum deficit of two-qubit X states

The one-way quantum deficit, a measure of quantum correlation, can exhibit for X quantum states the regions (subdomains) with the phases $\Delta_0$ and $\Delta_{\pi/2}$ which are characterized by constant (i.e., universal) optimal measurement angles, correspondingly, zero and $\pi/2$ with respect to the $z$-axis and a third phase $\Delta_\vartheta$ with the variable (state-dependent) optimal measurement angle $\vartheta$. We build the complete phase diagram of one-way quantum deficit for the XXZ subclass of symmetric X states. In contrast to the quantum discord where the region for the phase with variable optimal measurement angle is very tiny (more exactly, it is a very thin layer), the similar region $\Delta_\vartheta$ is large and achieves the sizes comparable to those of regions $\Delta_0$ and $\Delta_{\pi/2}$. This instils hope to detect the mysterious fraction of quantum correlation with the variable optimal measurement angle experimentally.

Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures

Distinct practical advantages of the one-way quantum computation (1WQC) have attracted the attention of many researchers. To physically realize a 1WQC pattern, its qubits should be mapped onto a quantum physical environment. The nearest-neighbor architectures are suitable for implementing 1WQC patterns because they provide nearest-neighbor sufficient interactions for full entanglement that are necessary for highly entangled configuration of 1WQC. To make a 1WQC nearest-neighbor compliant, swap gates are needed to bring the interacting qubits of a gate adjacent. More swap gates result in the higher latency and error probability. Therefore, an efficient mapping of qubits of a 1WQC pattern onto qubits provided by a nearest-neighbor architecture can dramatically reduce the number of swaps. This motivates us to propose an approach that maps qubits of a 1WQC pattern to qubits of a two-dimensional nearest-neighbor architecture. Our evaluations show that the proposed mapping approach reduces the number of swaps in the range of 0–96.2% in comparison with the best in the literature for the attempted benchmarks.

Quantum ω-Automata over Infinite Words and Their Relationships

Inspired by the results of finite automata working on infinite words, we studied the quantum ω-automata with Buchi, Muller, Rabin and Streett acceptance condition. Quantum finite automata play a pivotal part in quantum information and computational theory. Investigation of the power of quantum finite automata over infinite words is a natural goal. We have investigated the classes of quantum ω-automata from two aspects: the language recognition and their closure properties. It has been shown that quantum Muller automaton is more dominant than quantum Buchi automaton. Furthermore, we have demonstrated the languages recognized by one-way quantum finite automata with different quantum acceptance conditions. Finally, we have proved the closure properties of quantum ω-automata.

Quantum-inspired microwave signal processing for implementing unitary transforms.

Inspired by photonic one-way quantum computation, we describe a microwave signal processing method for implementing unitary transforms based on measuring the cebits encoded in the "classical microwave graph state (CMGS)." Here the terms "cebit" and "CMGS" defined in our system are classical analogies of a qubit and certain target quantum graph states in quantum physics respectively, which can exhibit some similar behaviors and resultants. The constructions of 4- and 16-cebit CMGSs as examples are discussed in detail and specific tomography methods are introduced to characterize their qualities. By performing operations on these CMGSs, we implement some basic 2 × 2, 4 × 4, and specific generalized unitary transforms, and obtain output results with high fidelities. Furthermore, we also demonstrate that a simulation of an efficient Grover's search algorithm, which has been executed in one-way quantum computing schemes, can be directly realized via a certain 4-cebit CMGS. Due to the excellent parallel efficiency and credible outcomes in the proposal, this quantum-inspired method may provide benefits for exploring new ways to microwave information processing, or in turn as an alternative tool for simulating particular quantum systems to some extent.

On the power of two-way multihead quantum finite automata

This paper introduces a variant of two-way quantum finite automata named two-way multihead quantum finite automata. A two-way quantum finite automaton is more powerful than classical two-way finite automata. However, the generalizations of two-way quantum finite automata have not been defined so far as compared to one-way quantum finite automata model. We have investigated the newly introduced automata from two aspects: the language recognition capability and its comparison with classical and quantum counterparts. It has been proved that a language which cannot be recognized by any one-way and multi-letter quantum finite automata can be recognized by two-way quantum finite automata. Further, it has been shown that a language which cannot be recognized by two-way quantum finite automata can be recognized by two-way multihead quantum finite automata with two heads. Furthermore, it has been investigated that quantum variant of two-way deterministic multihead finite automata takes less number of heads to recognize a language containing of all words whose length is a prime number.

Collaborative quantum computation with redundant graph state

Quantum computation is a computing model based on quantum theory, which can outperform the classical computation in solving certain problems. With the increase of the complexity of quantum computing tasks, it becomes important to distribute quantum computing resources to multi-parties to cooperatively fulfill the complex tasks. Here in this paper a scheme based on the one-way quantum computing model is proposed to realize collaborative quantum computation. The standard one-way quantum computing model is based on graph states. With graph states used as resources, one can realize a universal quantum computer through using single-qubit measurements and feed-forward. In contrast to the standard one-way computation, the main resource for collaborative quantum computation is a redundant graph state (also a multi-particle highly entangled state). Unlike in the traditional graph state where each particle corresponds to a specific node, in a redundant graph state, several particles correspond to a single node, which means that each node of the graph has several redundant copies. With the help of a redundant graph state, several parties can share a graph state flexibly at will. A redundant graph state is prepared and then distributed to several parties where each of them obtains a full copy of all nodes. By communicating with each other and measuring the particles in different ways, a standard graph state is prepared and distributed among these parties. The collaborative computation then finishes through the common one-way quantum computing operations. Besides the general scheme, a concrete optical implementation of a two-party cooperative single-qubit quantum state preparation based on a six-photon redundant graph state is also put forward. Such a redundant graph state is proposed to be prepared by using the spontaneous parametric down-conversion entangled source and quantum interference. With this redundant graph state, a standard three-node graph state can be shared with the two parties in an arbitrary way. This scheme does not only make the collaborative quantum computation across several parties possible and flexible, but also guarantee the privacy of each party’s operations. This feature would be particularly useful in the case where the computing resource is obtained from an outside provider. This scheme paves the way for realizing quantum computation in more general and complicated applications.

An investigation of some quantum correlations of Dirac fields in noninertial frames

In this paper, some concepts of quantum correlations, such as one-way quantum deficit, purity, and entanglement of formation are investigated between the modes of Dirac fields in noninertial frames. We consider two bipartite divisions of a tripartite system constructed by initial Werner states, which is shared between two relatively accelerated observers. The degradation of these quantum correlations is shown when the acceleration parameter increases. However, a nonzero amount of correlations survives even at infinite acceleration limit. Furthermore, we study the inevitable influence of mixedness factor of initial state on the quantum correlations behaviour. Finally, we review our calculation beyond single-mode approximation and point out some differences and similarities between the two regimes.

High-dimensional one-way quantum processing implemented on d-level cluster states

Taking advantage of quantum mechanics for executing computational tasks faster than classical computers1 or performing measurements with precision exceeding the classical limit2,3 requires the generation of specific large and complex quantum states. In this context, cluster states4 are particularly interesting because they can enable the realization of universal quantum computers by means of a ‘one-way’ scheme5, where processing is performed through measurements6. The generation of cluster states based on sub-systems that have more than two dimensions, d-level cluster states, provides increased quantum resources while keeping the number of parties constant7, and also enables novel algorithms8. Here, we experimentally realize, characterize and test the noise sensitivity of three-level, four-partite cluster states formed by two photons in the time9 and frequency10 domain, confirming genuine multi-partite entanglement with higher noise robustness compared to conventional two-level cluster states6,11–13. We perform proof-of-concept high-dimensional one-way quantum operations, where the cluster states are transformed into orthogonal, maximally entangled d-level two-partite states by means of projection measurements. Our scalable approach is based on integrated photonic chips9,10 and optical fibre communication components, thus achieving new and deterministic functionalities. The creation and manipulation of large quantum states is necessary for quantum information processing tasks. Three-level, four-partite cluster states have now been created in the time and frequency domain of two photons on-chip.

Measuring quantumness: from theory to observability in interferometric setups

We investigate the notion of quantumness based on the non-commutativity of the algebra of observables and introduce a measure of quantumness based on the mutual incompatibility of quantum states. We show that such a quantity can be experimentally measured with an interferometric setup and that, when an arbitrary bipartition of a given composite system is introduced, it detects the one-way quantum correlations restricted to one of the two subsystems. We finally show that, by combining only two projective measurements and carrying out the interference procedure, our measure becomes an efficient universal witness of quantum discord and non-classical correlations.

One-way deficit and quantum phase transitions in XY model and extended Ising model

Originating in questions regarding work extraction from quantum systems coupled to a heat bath, quantum deficit, a kind of quantum correlations besides entanglement and quantum discord, links quantum thermodynamics with quantum correlations. In this paper, we evaluate the one-way deficit of two adjacent spins in the bulk for the $XY$ model and its extend model: the extended Ising model. We find that the one-way deficit susceptibility is able to characterize the quantum phase transitions in the $XY$ model and even the topological phase transitions in the extend Ising model. This study may enlighten extensive studies of quantum phase transitions from the perspective of quantum information processing and quantum computation, including finite-temperature phase transitions, topological phase transitions and dynamical phase transitions of a variety of quantum many-body systems.

Connecting two Gaussian cluster states by quantum entanglement swapping.

Cluster state is an important resource for one-way quantum computation and quantum network. In this paper, we present a scheme for connecting two Gaussian cluster states by entanglement swapping, which can be used to connect two local quantum networks composed by cluster states. The connection schemes between different types of four-mode cluster states are analyzed and we show that the structure of the output states after entanglement swapping may be not the same as that of the input states. The entanglement of the obtained new cluster states are presented when suitable feedforward schemes are applied in the entanglement swapping process. By using optimal gains in the classical channel and inseparability criteria, the requirement of squeezing parameters for obtaining entanglement of output states are reduced. The presented scheme provides a concrete reference for constructing quantum networks with cluster states.

Gaussian one-way thermal quantum cryptography with finite-size effects

We study the impact of finite-size effects on the security of thermal one-way quantum cryptography. Our approach considers coherent/squeezed states at the preparation stage, on the top of which the sender adds trusted thermal noise. We compute the key rate incorporating finite-size effects, and we obtain the security threshold at different frequencies. As expected finite-size effects deteriorate the performance of thermal quantum cryptography. Our analysis is useful to quantify the impact of this degradation on relevant parameters like tolerable attenuation, transmission frequencies at which one can achieve security.

Optimization of One-Way Quantum Computation Measurement Patterns

In one-way quantum computation (1WQC) model, an initial highly entangled state called a graph state is used to perform universal quantum computations by a sequence of adaptive single-qubit measurements and post-measurement Pauli-X and Pauli-Z corrections. The needed computations are organized as measurement patterns, or simply patterns, in the 1WQC model. The entanglement operations in a pattern can be shown by a graph which together with the set of its input and output qubits is called the geometry of the pattern. Since a one-way quantum computation pattern is based on quantum measurements, which are fundamentally nondeterministic evolutions, there must be conditions over geometries to guarantee determinism. Causal flow is a sufficient and generalized flow (gflow) is a necessary and sufficient condition over geometries to identify a dependency structure for the measurement sequences in order to achieve determinism. Previously, three optimization methods have been proposed to simplify 1WQC patterns which are called standardization, signal shifting and Pauli simplification. These optimizations can be performed using measurement calculus formalism by rewriting rules. However, maintaining and searching these rules in the library can be complicated with respect to implementation. Moreover, serial execution of these rules is time consuming due to executing many ineffective commutation rules. To overcome this problem, in this paper, a new scheme is proposed to perform optimization techniques on patterns with flow or gflow only based on their geometries instead of using rewriting rules. Furthermore, the proposed scheme obtains the maximally delayed gflow order for geometries with flow. It is shown that the time complexity of the proposed approach is improved over the previous ones.