We develop a formal model for distributed measurement-based quantum computations, adopting an agent-based view, such that computations are described locally where possible. Because the network quantum state is in general entangled, we need to model it as a global structure, reminiscent of global memory in classical agent systems. Local quantum computations are described as measurement patterns. Since measurement-based quantum computation is inherently distributed, this allows us to extend naturally several concepts of the measurement calculus, a formal model for such computations. Our goal is to define an assembly language, i.e. we assume that computations are well-defined and we do not concern ourselves with verification techniques. The operational semantics for systems of agents is given by a probabilistic transition system, and we define operational equivalence in a way that it corresponds to the notion of bisimilarity. With this in place, we prove that teleportation is bisimilar to a direct quantum channel, and this also within the context of larger networks.
Distributed computing seems to be a natural approach to overcome size limitations of quantum computers in terms of number of qubits. But one lacks an efficient distribution approach to deal systematically with potential algorithms. This work proposes suitable quantum probes to reduce measurements in distributed sub-systems. Probes are introduced in the context of distributed Grover search. These are shown to be indeed efficient. The latter can be generalized to be applicable to other distributed algorithms of interest.
We study prepare-and-measure experiments where the sender (Alice) receives trusted quantum inputs but has an untrusted state-preparation device and the receiver (Bob) has a fully-untrusted measurement device. A distributed-sampling task naturally arises in such scenario, whose goal is for Alice and Bob to reproduce the statistics of his measurements on her quantum inputs using a fixed communication channel. Their performance at such task can certify quantum communication (QC), and this is formalised by measurement-device-independent QC witnesses. Furthermore, we prove that QC can provide an ad…
We study measurements on various subsystems of the output of a universal 1 to 2 cloning machine, and establish a correspondence between these measurements at the output and effective measurements on the original input. We show that one can implement sharp effective measurement elements by measuring only two out of the three output systems. Additionally, certain complete sets of sharp measurements on the input can be realised by measurements on the two clones. Furthermore, we introduce a scheme that allows to restore the original input in one of the output bits, by using measurements and classi…
We investigate the information provided about a specified distributed apparatus of n units in the measurement of a quantum state. It is shown that, in contrast to such measurement of a classical state, which is bounded by log (n+1) bits, the information in a quantum measurement is bounded by 3.7 x n^(1/2) bits. This means that the use of quantum apparatus offers an exponential advantage over classical apparatus.
Single-site measurement in a distributed macroscopic antiferromagnet is considered; we show that it can create antiferromagnetic sublattices at macroscopic scale. We demonstrate that the result of measurement depends on the symmetry of the ground state: for the easy-axis case the Neel state is formed, while for the easy-plane case unusual ``fan'' sublattices appear with unbroken rotational symmetry, and a decoherence wave is generated. For the latter case, a macroscopically large number of measurements is needed to pin down the orientation of the sublattices, in spite of the high degeneracy of…
This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a computational model for distributed systems, particularly those architectures which rely on probabilistic entangling operations. We review the theoretical underpinnings of one-way quantum computation and discuss the practical issues related to exploiting the one-way model in distributed architectures.
In a distributed quantum computer scalability is accomplished by networking together many elementary nodes. Typically the network is optical and inter-node entanglement involves photon detection. In complex networks the entanglement fidelity may be degraded by the twin problems of photon loss and dark counts. Here we describe an entanglement protocol which can achieve high fidelity even when these issues are arbitrarily severe; indeed the method succeeds with finite probability even if the detectors are entirely removed from the network. An experimental demonstration should be possible with ex…
We show that free-space diffraction of photons distributes highly useful entanglement: the receivers of the propagated modes can do a distributed quantum computation using only linear optics and photon counting. The distributed computation requires classical communication between receivers, however, similar to standard measurement-based computation, that communication is of purely random outcomes and so can be indistinguishable from noise. The speculation in the title arises from the further observation that the natural way for a circumspect civilization to hide their photonic entanglement dis…
To apply network coding for quantum computation, we study the distributed implementation of unitary operations over all separated input and output nodes of quantum networks. We consider a setting of networks where quantum communication between nodes is restricted to sending just a qubit, but classical communication is unrestricted. We analyze which N-qubit unitary operations are implementable over cluster networks by investigating transformations of a given cluster network into quantum circuits. We show that any two-qubit unitary operation is implementable over the butterfly network and the gr…
This paper studies a scheme of two spatially distant oscillator systems that are connected by Gaussian fields and examines distributed entanglement generation between two continuous-mode output Gaussian fields that are radiated by the oscillators. It is demonstrated that using measurement-feedback control while a non-local effective entangling operation is on can help to enhance the Einstein-Podolski-Rosen (EPR)-like entanglement between the output fields. The effect of propagation delays and losses in the fields interconnecting the two oscillators, and the effect of other losses in the system…
We consider the task of faithfully simulating a distributed quantum measurement, wherein we provide a protocol for the three parties, Alice, Bob and Eve, to simulate a repeated action of a distributed quantum measurement using a pair of non-product approximating measurements by Alice and Bob, followed by a stochastic mapping at Eve. The objective of the protocol is to utilize minimum resources, in terms of classical bits needed by Alice and Bob to communicate their measurement outcomes to Eve, and the common randomness shared among the three parties, while faithfully simulating independent rep…
Bipartitioning of Graph States for Distributed Measurement-Based Quantum Computing
SINTEF Digital（SINTEF数字研究所）；Fraunhofer Institute for Computer Graphics Research IGD（弗劳恩霍夫计算机图形研究IGD研究所）；Technical University of Darmstadt（达姆施塔特工业大学）；NTT DATA（NTT数据公司）
The manifestation of measurements, randomly distributed in time, on the evolution of quantum systems are analyzed in detail. The set of randomly distributed measurements (RDM) is modeled within the renewal theory, in which the distribution is characterized by the probability density function (PDF) W(t) of times t between successive events (measurements). The evolution of the quantum system affected by the RDM is shown to be described by the density matrix satisfying the stochastic Liouville equation. This equation is applied to the analysis of the RDM effect on the evolution of a two level sys…
A plethora of applications hinge on a network or an array of sensors to undertake measurement tasks. A rule of thumb for sensing is that a collective measurement taken by $M$ independent sensors can improve the sensitivity by $1/\sqrt{M}$, known as the standard quantum limit (SQL). Quantum resources such as entanglement and squeezed light can be harnessed to surpass the SQL. Distributed quantum sensing is an emerging subject dedicated to investigating the performance gain enabled by entangled states shared by multiple sensors in tackling different measurement problems. This Review formulates d…
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate. Moreover, to model concurrent and distributed quantum computations, as well as quantum communication protocols, quantum to quantum communications which move qubits physically from one place to another must also be taken into account. Inspired by classical process algebras, which provide a framework for modeling cooperating computations, a process algebraic notation is defined, named QPAlg for Qua…
We consider experimentally feasible chains of trapped ions with pseudo-spin 1/2, and find models that can potentially be used to implement error-resistant quantum computation. Similar in spirit to classical neural networks, the error-resistance of the system is achieved by encoding the qubits distributed over the whole system. We therefore call our system a ''quantum neural network'', and present a ''quantum neural network model of quantum computation''. Qubits are encoded in a few quasi-degenerated low energy levels of the whole system, separated by a large gap from the excited states, and la…
In this work, we consider the task of faithfully simulating a quantum measurement, acting on a joint bipartite quantum state, in a distributed manner. In the distributed setup, the constituent sub-systems of the joint quantum state are measured by two agents, Alice and Bob. A third agent, Charlie receives the measurement outcomes sent by Alice and Bob. Charlie uses local and pairwise shared randomness to compute a bivariate function of the measurement outcomes. The objective of three agents is to faithfully simulate the given distributed quantum measurement acting on the given quantum state wh…
We show that the correlations in stochastic outputs of time-distributed weak measurements can be used to study the dynamics of an individual quantum object, with a proof-of-principle setup based on small Faraday rotation caused by a single spin in a quantum dot. In particular, the third order correlation can reveal the "true" spin decoherence, which would otherwise be concealed by the inhomogeneous broadening effect in the second order correlations. The viability of such approaches lies in that (1) in weak measurement the state collapse which would disturb the system dynamics occurs at a very …
Spatially distributed problems are often approximately modelled in terms of partial differential equations (PDEs) for appropriate coarse-grained quantities (e.g. concentrations). The derivation of accurate such PDEs starting from finer scale, atomistic models, and using suitable averaging, is often a challenging task; approximate PDEs are typically obtained through mathematical closure procedures (e.g. mean-field approximations). In this paper, we show how such approximate macroscopic PDEs can be exploited in constructing preconditioners to accelerate stochastic simulations for spatially distr…
