Abstract
Quantum technologies hold the promise of not only faster algorithmic processing of data, via quantum computation, but also of more secure communications, in the form of quantum cryptography. In recent years, a number of protocols have emerged which seek to marry these concepts for the purpose of securing computation rather than communication. These protocols address the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation. We present a review of the progress to date in this emerging area.
Introduction
For almost as long as programmable computers have existed, there has been a strong motivation for users to run calculations on hardware that they do not personally control. Initially, this was due to the high cost of such devices coupled with the need for specialised facilities to house them. Universities, government agencies and large corporations housed computers in central locations where they ran jobs for their users in batches. Over time, computers have become ubiquitous, but demand for centralised resources has not abated. Even today, the use of delegated computation is widespread, in the form of cloud computing.
While we do not yet know how the field of quantum computing will develop, it seems reasonable to speculate that it will follow a similar path. Indeed this speculation is somewhat born out by recent efforts to provide access to rudimentary quantum processors over the Internet.^{1} Today we are in a far better position to enable remote access to quantum computers than was possible with early conventional computers, due to the existence of high speed global communications networks, and the ubiquity of classical processors. Furthermore, the discovery of quantum key distribution protocols^{2, 3} has provided the impetus to develop quantum communication over existing optical fibre networks^{4} These factors only serve to increase the scope for early adoption of delegated quantum computation.
While the option of delegating calculations to remote systems may have strong practical and economic motivation, it opens a myriad of security concerns. In particular, if the computation is performed on untrusted hardware, then this opens the possibility that either the privacy or the integrity of the computation may be compromised. Encryption can be used to hide communication between the client and the server from eavesdroppers, while authentication codes can be used to detect any attempt to modify these messages.^{5} However, such techniques do nothing to counteract the threat posed by a compromised or malicious server. Ideally, to overcome these concerns, one would want a way to delegate tasks to a remote server while ensuring privacy, even from the server executing them, and to ensure the correctness of the result.
In recent years, a number of protocols have emerged which seek to tackle the privacy issues raised by delegated quantum computation. Going under the broad heading of blind quantum computation (BQC), these provide a way for a client to execute a quantum computation using one or more remote quantum servers while keeping the structure of the computation hidden. While the goal of BQC protocols is to ensure only the privacy of the computation, many also allow for verification of the computation being performed, by embedding hidden tests within the computation.
To date, BQC has been considered in a wide range of settings, with varying requirements on the capability of the client and the server or servers. Ultimately, the most desirable setting would be a verifiable BQC protocol which could be performed between a client without any quantum capabilities and a single quantum server. Unfortunately, progress on such a protocol has proved slow. Part of the difficulty is that the server could retain a complete transcript of the communication during the protocol, allowing them to rerun their side of the process many times. Indeed, a nogo result from Morimae and Koshiba ruled out a wide class of potential protocols.^{6} Furthermore, results from classical secure computing create a link between blind computing and computational complexity.^{7} The existence of a sufficiently secure blind computation protocol with a purely classical client and a single quantum server capable of implementing arbitrary quantum computations would create a link between the questions of whether BQP contains NP and whether the polynomial hierarchy collapses.^{8} As a result of these hurdles, it is only very recently that mechanisms which may allow for such functionality have begun to emerge.^{9}
As a result, progress on blind computation has come from considering settings which relax these restrictions somewhat. There are several ways in which this can be done, which can broadly be divided into two categories: settings which relax the requirement that the client be purely classical, and settings which allow for multiple noncommunicating quantum servers. Settings considered in the first category augment the client with some quantum capability which is insufficient for quantum computation unaided. The motivation behind this approach is that it may be plausible to allow the client to prepare or measure single qubit states,^{10, 11} or perhaps to have a small quantum processor of their own.^{12} On the other hand, the second category maintains a classical client, but allows that client to interact with multiple servers.^{13} In all known protocols of this type, the privacy of the computation is only maintained provided that the servers do not communicate. While it is in principle possible to achieve this for short periods by using position to enforce spacelike separation between servers during the protocol, it may be difficult to guarantee blindness indefinitely in any realistic scenario.
Security
Before diving into the protocols which have been proposed to accomplish BQC, it is necessary to clarify what precisely this statement means at a more formal level. Just as many configurations of client and server have been considered in the literature, a variety of security definitions have also been proposed. At an intuitive level, security definitions for this problem seek to capture, at a minimum, the idea that a malicious server or servers should be unable to distinguish between possible computations chosen by the client, based on the information they receive during the protocol. Certain information cannot be hidden. The server will always know the resources they committed to the computation and so can always determine an upper bound on depth and width of the quantum circuit corresponding to the client’s chosen computation. However, it is in principle possible to hide all other aspects of the computation and to pad the circuit so that the circuit dimensions reveal little information about the hidden computation. In formulating a security definition for blind computation, it is hence important to account for this leakage of information. In this section, we will focus primarily on security definitions that are information theoretic in nature, avoiding the necessity for assumptions on the computational power of the adversary which are characteristic of much of modern classical cryptography.
The term ‘blind quantum computation’ was first coined by Arrighi and Salvail^{14} to describe the encryption of instances of certain problems so that they could be delegated while preserving privacy, building upon similar ideas introduced in the classical regime by Feigenbaum.^{15} The first protocol and security definition for securely delegating arbitrary quantum computations, termed ‘universal’ BQC, was introduced in ref. 10. There blindness was defined in the following way. Given a description of a client’s computation x, a protocol was said to be ‘blind while leaking at most L(x)’ if the distribution of classical and quantum information received by the server was fully determined by L(x). The purpose of the function L(x) is to capture information unavoidably leaked, which may differ from protocol to protocol but is most often taken to be the circuit dimensions of the delegated computation. In effect, this definition demands that the information received by the server not depend on any aspect of the client’s chosen computation other than what is captured by L(x). Much of the work on blind computation to date has implicitly or explicitly used some form of this definition. A notable exception to this trend was presented in ref. 16, which made use of a weakened definition, requiring only that attempts to violate the privacy of the computation be detected with high probability, in order to optimise communications overhead.
While the previous definition captures the spirit of BQC, it has certain undesirable features. In particular it does not fully determine how a protocol satisfying that definition will behave as part of a larger system. For example, if the server were to deviate from the protocol, they would still only learn at most L(x). However, if subsequent to the conclusion of the protocol, they were to learn something about the resulting state received by the client, it might be possible for them to infer additional details of the computation. To this end, stronger security definitions for delegated computation have been proposed which seek to fully define the behaviour of BQC protocols^{17} using the abstract cryptography framework of Maurer and Renner.^{18} This is achieved through the use of the notion of an ideal resource, which fully describes the functionality of blind computation without making reference to any particular protocol. This can be thought of as a black box process with several interfaces through which the client and server can interact with it, as shown in Fig. 1a. Several of these interfaces allow for the passing of quantum information, which may in general be in a nonseparable state. Hence the labels on each interface refer to quantum systems rather than to the corresponding states directly, such that, for example, ψ _{A} and ψ _{B} are two subsystems of a compound system ψ _{AB}. The system ψ _{A} represents the description of the client’s computation together with any included quantum input, such that the output of the chosen computation is given by 𝒰(ψ _{A}) for a fixed unitary operator 𝒰 known to both the client and the server. This use of a quantum state to represent the description of the computation as well as the input can be thought of as providing input for a programmable device, which includes both the programme and the input data, and can be done without loss of generality. The system ρ _{A} represents the output obtained by the client, while \({\ell^{\psi_A}}\) represents the leaked information obtained by the server based on the client’s computation. In general, these can all be considered to be quantum states, though for specific use cases they may be classical. A single bit, b, is used to indicate whether the server chooses to deviate from the protocol. The specification of ℬ and the relationship between the output ρ _{A} and the other inputs depends on whether or not verification is included. In the case where only blindness is considered, the description of the ideal resource, denoted 𝒮 ^{blind} is completed by choosing ℬ = (ℰ, ψ _{B}), with ℰ being a completely positive tracepreserving map (capturing the server’s interference with the computation) and ψ _{B} being a quantum system, and fixing ρ _{A} = 𝒰(ψ _{A}) when b = 0 and ρ _{A} = ℰ(ψ _{AB}) when b = 1, where ψ _{AB} is the joint system composed of subsystems ψ _{A} and ψ _{B}. In the case where verification is included, the ideal resource \({\cal S}_{{\rm{verif}}}^{{\rm{blind}}}\) is completed by choosing ℬ to be a single bit c. If c = 0 then ρ _{A} = 𝒰(ψ _{A}), otherwise when c = 1 the output gives some fixed error state ρ _{ A } = err〉〈err orthogonal to the usual output space. Thus c captures the possibility of the server causing an error in the computation, but requires that it be perfectly detectable by the client.
With the ideal resources specified, security definitions can then be given which relate a concrete protocol to the ideal resource. A concrete BQC protocol is composed of a pair of protocols, π _{A} for the client and π _{B} for the server, which interact via a communications channel indicated by ℛ, as illustrated in Fig. 1b. In this framework, a BQC protocol should satisfy two conditions, relating respectively to correctness and blindness, in order to be considered secure. Correctness captures the notion that the output of the proposed protocol actually matches the behaviour of the ideal resource when the server is behaving honestly. We can consider the composition of protocols and resources using αβ to denote the composition of two such objects where the right side interfaces of α match and are connected to the left hand interfaces of β. A protocol is then said to be εcorrect if the quantum channel implemented by π _{A}ℛπ _{B} is εclose in the diamond norm to the channel given by 𝒮⊥_{ B }, where ⊥_{ B } denotes that the server is restricted to behaving honestly (setting b = 0 and c = 0). Here 𝒮 is taken to be either 𝒮 ^{blind} or \({\cal S}_{{\rm{verif}}}^{{\rm{blind}}}\) depending on whether verifiability is included. The blindness condition captures the notion that the server should not be able to learn more than if they were interacting with the ideal functionality, but is stronger than the definition considered earlier. A protocol is ϵblind if π _{A}ℛ is ϵclose to 𝒮σ _{B} for some simulator σ _{B} in the appropriate norm. This is stronger than demanding that the server learn no more than they can from the ideal resource, since it implies that any party having access both to the server and client interfaces of the compound objects cannot distinguish π _{A}ℛ from 𝒮σ _{B}. This is an important feature, since it means that in analysis of larger systems which makes use of blind computation as a component, the concrete BQC protocol can be replaced by an ideal functionality, provided ϵ is sufficiently small. For a more thorough treatment of composable security definitions for blind computation, curious readers are referred to ref. 19.
The above discussion focuses on blindness or the combination of blindness and verifiability, rather than on verifiability alone. A much wider variety of nonequivalent definitions has been considered for this latter property, and a review of all such definitions is beyond the scope of the current manuscript. There does, however, appear to be a deep link between notions of blindness and verification. Several protocols designed primarily to verify quantum computation have turned out to yield BQC protocols with minimal or no changes,^{12, 23} while the notion of embedding hidden traps within a computation, as shown in Fig. 2, has been used to make several BQC protocols verifiable.^{21, 22} Recently, however, several verification schemes have emerged which do not seem to immediately give rise to blind computation protocols,^{24,25,26} and so it remains an open question as to whether or not these are truly independent properties.
BQC with semiclassical clients
Restricted quantum computation
The first BQC protocol is widely attributed to Childs,^{27} who introduced an interactive protocol which allowed a user with restricted quantum capabilities to perform universal quantum computation with the aid of a second party possessing a universal quantum computer (Fig. 3a), while keeping the specifics of the computation hidden. In the scenario originally considered, the client had a large quantum memory with the ability to rearrange qubits and to perform Pauli operations, but lacked the ability to perform nonPauli gates and to perform measurements. The ability to perform Pauli gates allowed the client to encrypt qubits using a quantum onetime pad (i.e. applying a random Pauli to each qubit) before sending them to the server. The client selects a qubit or qubits to perform an operation on, applies a random quantum onetime pad, and transmits them to the server. The server then applies the desired operation before returning the qubits to the client. When encoded in this way, measurements made by the server revealed no information about the state of the encoded qubit, but can be decoded by the client using the onetime pad key. Furthermore, Clifford group gates can be applied by the server directly onto the encrypted state provided that the client update their encryption key. This is due to the fact that given a Clifford group operator C, a multiqubit Pauli operator σ and and quantum state ψ〉, \(C\sigma \left \psi \right\rangle = \sigma 'C\left \psi \right\rangle \) where \(\sigma ' = C\sigma {C^\dag }\). The procedure for implementing nonClifford group gates is a little more involved. Consider the result of the server applying the gate \(T = \left 0 \right\rangle \left\langle 0 \right + {e^{i\frac{\pi }{4}}}\left 1 \right\rangle \left\langle 1 \right\) to a state encrypted with a quantum onetime pad given by the Pauli operator σ. If σ commutes with T, then trivially Tσψ〉 = σTψ〉 and the gate has been successfully applied on the encrypted state. If however σ does not commute with T, then it is because σ contains either an X or Y term corresponding to the qubit on which T is being applied. In this case Tσψ〉 = σT ^{†}ψ〉. While this is not the desired result, it is possible to make a correction by applying the gate S = T ^{2}, which is in the Clifford group and hence can be applied deterministically by the server using the previous procedure. One caveat is that if the server is only requested to apply an S gate following a T gate if σ does not commute with T on the chosen qubit, then information about the encoded state is revealed. In order to avoid this scenario, following each T gate the server must always be requested to perform an S gate. In the case where S is unnecessary, the client simply chooses an ancillary qubit for it to be performed on. Since the qubit is returned to the client between each step, and the onetime pad renewed, there is no mechanism for the server to distinguish between the two cases. As these operations together are sufficient for approximatelyuniversal quantum computation, the client can thus make use of the server to implement an arbitrary quantum computation without revealing their state. This can be extended to hide the full computation by requiring that the server always implement a fixed order of gates (say Hadamard, CNOT, T, S) where the client simply choses to have unwanted gates applied to an ancillary pair of qubits.
A notable feature of this protocol is that the quantum resources required of the client depends on the computation being performed. Furthermore, while Childs discussed the issue of verification, noting that the computation could be verified by a classical client if it resulted in a witness for an instance of a problem in NP and speculating on the use of tomography on a subset of gates as a mechanism for keeping a memoryless server honest, the protocol did not provide a general mechanism for verifying the correctness of general computation. Subsequent work has sought to both reduce the requirements on the client and to ensure verifiability of the computation. Specifically, an alternate approach taken by Aharanov, BenOr and Eban in the context of developing interactive proofs for BQP, which shifts the memory requirement to the server.^{12} In the ABE protocol, the client is used to prepare the initial state for the computation, encoded using a polynomial code introduced in ref. 28, which amounts to a quantum authentication scheme.^{29} This can be done logical qubit by logical qubit, and so the size of the client’s device need not scale as a function of the number of qubits in their chosen computation, but can be as low as 3 qubits (Fig. 3b). The algebraic structure of the encoding allows for the server to implement Clifford gates transversally, provided that the client update their encryption key, and so by making use of gate teleportation using magic states prepared by the client it is possible to implement an approximately universal gate set. Just as in the case of Childs’ protocol, the encoding hides the client’s input state only. However, by making use of a fixed programmable unitary, similar to that used in the composable security definitions discussed earlier, this can be leveraged into a BQC protocol, hiding not only the input but also the intended computation. Furthermore, the use of an authentication code ensures that the computation can be verified with constant probability of error.
State preparation
While the approaches described in the previous section do allow a client with limited quantum capabilities to harness the power of a larger quantum computer, they require reasonably sophisticated apparatus on the client’s side. As we shall see, it is possible to further reduce the complexity of the client’s device. The universal blind quantum computing protocol (UBQC) introduced in ref. 10 manages to hide arbitrary quantum circuits with a client only capable of preparing certain single qubit quantum states. Rather than directly implementing a computation as a series of gates applied to a fixed register of qubits, the UBQC protocol implements the desired circuit as a measurementbased computation.
In order to understand how the UBQC protocol works, it is first necessary to understand how a computation can be expressed in the measurementbased model. In measurementbased quantum computation (MBQC), a quantum computation is expressed as a sequence of singlequbit measurements to be performed on a fixed resource state.^{32} These resource states are known as graph states, due to their correspondence to simple graphs. The resource state corresponding to a particular graph G can be determined as the output of a circuit specified as follows. For each vertex in G, prepare a qubit in the state \(\left + \right\rangle = \frac{1}{{\sqrt 2 }}\left( {\left 0 \right\rangle + \left 1 \right\rangle } \right)\). Then, for each edge e in G, apply a controlledphase gate between the qubits corresponding to the vertices joined by e. Since the controlledphase gates necessarily commute, the state produced by the circuit is independent of the order of these operations. While the original resource states studied in the context of MBQC were cluster states,^{33, 34} the graph for which corresponds to a regular square lattice, the UBQC protocol made use of a different resource state known as a brickwork state, illustrated in Fig. 4. The reason for this was that the initial insight underlying the UBQC protocol allowed the hiding of only measurements which projected onto states in the XYplane of the Bloch sphere. Until very recently cluster states were not known to be universal without the addition of Zbasis measurements, and so a resource state was constructed which required only XYplane measurements. Recent results proving the universality of cluster states with only XYplane measurements imply that the UBQC protocol could be trivially modified to use such states.^{35} For simplicity, in discussing how MBQC implements a computation, we will consider only the case of the brickwork state. Readers interested in a more thorough introduction to this model of computation are referred to ref. 36.
In a measurementbased computation performed on a brickwork state, the planar nature of the underlying graph has a natural interpretation in terms of the circuit model. Each row of vertices, together with the edges connecting them, corresponds to a single logical qubit which is propagated from left to right by a sequence of measurements, as shown in Fig. 4a. The initial state of each such logical qubit is +〉 and initially the state can be thought of as residing at the leftmost vertex in the chain. Each measurement in a basis B _{ θ } = cos(2θ)X + sin(2θ)Y has the effect of propagating the logical qubit on vertex to the right and applying the operator X ^{m} HR _{ Z }(θ), where R _{ Z }(θ) = cosθI + sinθZ and m∈{0, 1} is the outcome of the measurement. This is a consequence of a rotated version of the twoqubit teleportation protocol illustrated in Fig. 4c, d.^{30, 31} The presence of the teleportation byproduct X ^{m} means that subsequent measurement angles need to be adapted to negate this byproduct in order to achieve deterministic computation. Thus the measurement bases will in general depend on the outcomes of previous measurements as well as the intended logic gate they correspond to, a dependency formalised for general graphs by the notion of flow.^{37} The only remaining element unaccounted for, then, are vertical edges in the graph. These can be seen as controlledphase gates between logical qubits which occur when both logical qubits have been propagated onto the vertices linked by a vertical edge. Measurement of the rightmost qubit in each row corresponds to a measurement of the final state of the computation. Taken together, these two elements can be combined to perform more common universal gate sets such as arbitrary local unitary operations and CNOTs as shown in Fig. 4b.
UBQC was the first protocol to take advantage of measurementbased computation in the context of blind computation. It achieves blindness by effectively hiding the measurement bases for a measurementbased computation on a fixed resource state. The UBQC protocol, depicted in Fig. 5, proceeds as follows. The client first encodes their computation as a sequence of measurements at angles ϕ _{ i }, chosen from the set \(A = \left\{ {0,\frac{\pi }{4},\frac{{2\pi }}{4}, \ldots ,\frac{{7\pi }}{4}} \right\}\), in the XYplane on a brickwork state of dimensions N × M, proportional to the dimensions of the quantum circuit corresponding to the desired computation. The client then prepares and sends NM single qubit states \(\left {{\psi _i}} \right\rangle = \frac{1}{{\sqrt 2 }}\left( {\left 0 \right\rangle + {{(  1)}^{{r_i}}}{e^{i\theta_i }}\left 1 \right\rangle } \right)\), where r _{ i } and θ _{ i } are chosen uniformly at random from the sets {0, 1} and A, respectively and transmits them to the server. The server arranges these in a two dimensional grid of N × M qubits and entangled them with controlledphase gates according to the brickwork graph. The computation then proceeds in rounds in which the qubits are measured sequentially, in a fixed order (going from top to bottom, left to right). In the ith round, the client sends a measurement angle \({\delta _i} = {\phi '_i}  {\theta _i}\) to the server, who measures qubit i in this basis and returns the resulting outcome b _{ i } to the client. Here \({\phi '_i}\) denotes updated measurement angle for qubit i adapted from ϕ to account for previous teleportation byproducts. The client then decodes this outcome to obtain a new bit m _{ i } = b _{ i }⊕r _{ i }, which they take to be the true outcome of the measurement. This entire procedure can be seen to be equivalent to the original measurementbased computation chosen by the client since rotations about the Z axis commute with the entangling operations and hence the θ _{ i } terms included in the state preparation and measurement angle cancel. Furthermore, the effect of r _{ i } is equivalent to applying a Z operation to the initial state, which commutes with the entangling operations but anticommutes with the measurement operator, and hence results in a bit flip on the outcome of the measurement result b _{ i }, which is undone in the computation of m _{ i }. It is easy to see that the UBQC protocol satisfies the conditions of the first blindness definition introduced in Section II by noting that only ψ _{ i }〉 depends on r _{ i }, and as these values are random, and a priori unknown to the server, the density matrix for the state received by the server is always maximally mixed, and so fixed and independent of θ _{ i }. Thus only δ _{ i } is dependent on θ _{ i }, which is chosen uniformly at random from the same set as ϕ _{ i } and is a priori unknown to the server, and hence it too is uniformly random and independent of ϕ _{ i } or \({\phi '_i}\). As such, the distribution of messages sent to the server, when averaged over choices of the random variables {r _{1},…,r _{ NM }} and {θ _{1},…,θ _{ NM }} is fixed as the maximally mixed distribution. Blindness under this first definition was proved in ref. 10 while security under the stronger composable definition proved in ref. 19. It is worth noting that while the resource state requires NM qubits, due to the commutation of operations involving nonneighbouring qubits, not every qubit needs to be present in the initial state. Indeed, by postponing each controlledphase operation as long as possible, it is possible to implement this protocol using only N + 1 qubits.
While the original paper introduced a mechanism for verifying the delegated computation based on the use of ancillary ‘trap’ qubits randomly interspersed with the target computation (see Fig. 2a), the analysis of verification given in ref. 10 was incomplete. Subsequently a modified verification technique was proposed based on using physical qubits rather than logical qubits as traps (see Fig. 2b) and proven to suppress arbitrary deviations from the protocol by the server.^{21} The modified BQC protocol also introduced new functionality, making it possible to incorporate hidden Zbasis measurements within a measurement pattern, and allowing for the entanglement graph to be hidden. This modified protocol also satisfies the composable security definitions for perfect blindness (i.e. 0blindness) and ϵblindverifiability discussed in Section II for exponentially small ϵ.^{17} The UBQC protocol can also be used as a method to remotely prepare the states used in the ABE protocol, resulting in a hybrid protocol which requires only single qubit state preparations.^{38}
Measurement
An alternate take on the use of MBQC for blind computation was proposed by Morimae and Fujii,^{11} which changed the role of the client from state preparation to measurement. They noted that if the client were capable of making the adaptive singlequbit measurements necessary to drive a measurementbased computation on a fixed graph state, then a BQC protocol could be achieved by having the server feed the resource state to the client, one qubit at a time, as depicted in Fig. 6. Such a scheme is trivially blind, since the direction of communication is always from server to client, and has been shown to satisfy composable security definitions.^{17, 39} This approach to blind computation can be thought of as dual to the UBQC approach, due to the fact that in quantum mechanics there is a symmetry under postselection between preparation and measurement. As a result, faulttolerance constructions are interchangeable between the two settings, and trapbased verification techniques have been successfully adapted to this setting.^{22} Furthermore, the fact that the server is required only to prepare a fixed state has lead to new approaches to verification based on directly testing that this state has been prepared using stabiliser measurements.^{40, 41}
Arguments have been made in both directions over whether state preparation or measurement is a more practical option for the client’s device. This will of course depend on the physical implementation under consideration. At least at present, however, photons appear to be the only reasonable choice for long range quantum communication. In this setting, there is indeed a case that measurement may be easier than state preparation due to the difficulty of constructing deterministic single photon sources and the relative ease with which photons can be detected at short wavelengths. There are some gaps in this line of reasoning, however, since it has been shown that weak coherent pulses,^{42} easily producible by an attenuated laser, suffice for the state preparation approach. Furthermore, BQC schemes in which the client makes measurements directly on a resource state prepared by the server are extremely susceptible to photon loss and hence require both extremely high efficiency detectors and near lossless communications links. One possible way to take advantage of the best features of each approach is to make use of an a hybrid of the two. It was noted in ref. 10 that the classicalquantum (CQ) correlations between the client and server necessary to implement the UBQC protocol could be achieved by measurements made on half of an entangled state with the other half held by the server. This is simply due to the fact that measuring one qubit of a singlet state in a basis B _{θ} results in the other qubit being projected onto either \(\frac{1}{{\sqrt 2 }}\left( {\left 0 \right\rangle \pm {e^{i\theta }}\left 1 \right\rangle } \right)\) where the sign depends on the outcome of the measurement. Thus by having the server feed the client one half of an entangled pair for each qubit to be prepared, the client can effectively remotely prepare the input states used by the server in statepreparation BQC and verification protocols. Importantly, in this approach failure by the client to detect a photon is not a significant problem, since the procedure can be repeated until remote preparation of the requisite number of qubits has been achieved, resulting in overhead which scales only inversely with the probability of a single measurement attempt succeeding. Thus a client making use of a single low quality detector and lossy links could still make use of BQC. Such hybrid approaches have also shown promise as a route to achieve verification in a deviceindependent fashion by selftesting the underlying singlet states.^{43,44,45}
BQC with multiple servers
The insight discussed in the previous section, that the CQ correlations necessary to implement the UBQC protocol could be achieved through measurements on one half of a bipartite entangled state, immediately gives rise to a version of the UBQC protocol, also introduced in ref. 10, in which the client is entirely classical. This required the addition of a second server which shares an entangled state with the first. Importantly, the two servers are restricted from communicating with each other, with both classical and quantum communication prohibited after the commencement of the protocol. This situation is depicted in Fig. 7. By requesting the second server measure their half of the shared entangled state in a specified random basis, the client can establish that the correct initial distribution of states with the first server without revealing anything about their computation. They can then proceed with the UBQC protocol as usual. While blindness in this setting follows directly from the proof of blindness in the case where the client prepares and transmits quantum states, the situation for verification is more complicated and the argument for security initially proposed in ref. 10 does not hold for the most general adversarial behaviour.
The first schemes to achieve delegation and verification of quantum computation by an entirely classical client to a set of entangled servers were introduced by Reichardt, Unger and Vazirani^{13, 23} based on CHSH games, and by McKague^{46} based on selftesting of graph states. While the structure of the protocols varies significantly, neither disclose the computation to the servers and thus both can be considered blind. The construction considered by Reichardt et al. has the advantage of requiring only two servers, while that of McKague requires a significantly larger number of servers. One advantage of McKague’s protocol over the RUV protocol is that the incurred overhead scales more gently (O(n ^{22}) as compared to O(n ^{8191}) where n is the sum of the number of logical gates and qubits). Subsequent efforts were made to lower this overhead by making use of selftested remote state preparation as input for a verifiable blind computation protocol (that of ref. 21), proposed independently in somewhat different forms in refs. 43 and 45. These managed to reduce the the overhead to O(n ^{4}log n) in the setting of polynomially many servers,^{43} a scaling subsequently also achieved in ref. 47 by other means, and O(n ^{2048}) for the two server setting.^{45} Subsequent work has sought to improve this overhead requirement further.^{44} In this regard, a new (nonblind) selftesting procedure introduced by Natarajan and Vidick,^{26} which does not scale with the number of entangled pairs to be verified shows particular promise.
The above mentioned protocols share at least two common features. Each requires a number of rounds of communication which scales polynomially with depth of the computation and each is either natively blind or can be made blind with trivial adaptations. Recently, however, a class of nonblind verification protocols have emerged based on oneround interactive proofs for the local Hamiltonian which require extremely little communication.^{48, 49} These can be exploited to yield verification a method for verifying delegated quantum computation by constructing a Hamiltonian to encode the chosen computation and its purported output and then executing an interactive proof to verify that the ground state energy of this Hamiltonian is below a fixed threshold.^{24,25,26} This casts into question the link between verification and blindness.
Multiserver approaches have the advantage of eliminating the need for any quantum capability on the part of the client, but this comes at a significant price, both in terms of overhead (particularly for verifiable schemes) and in terms of the additional assumptions regarding a lack of communication between servers. These additional assumptions mean that it is likely impossible in practice to maintain blindness indefinitely, due to the lack of a physical mechanism to prevent communication between servers over arbitrary timescales in an adversarial setting.
Computing on encrypted data and homomorphic encryption
As noted in Section II, BQC can be achieved by applying a fixed unitary operation to an input which encodes the full circuit to be evaluated together with any associated input states. This forms a concrete link to the notion of computing on encrypted data, a regime similar to blind computation but in which the operation to be evaluated is public. This corresponds to the setting initially considered by Childs, as discussed in Section IIIA. Progress on protocols of this type has continued to be made, with Fisher et al. introducing a protocol which reduced the requirements on the client to preparation of specific single qubit states, similar to the requirement for the UBQC protocol, while implementing logic gates in a manner similar to Childs’ original scheme.^{50} This approach necessarily sacrificed the native ability to hide the computation being performed, unless a large programmable circuit were to be implemented. However, the result of this sacrifice was a significant saving in communications requirements over the UBQC protocol in the regime where only the data must be hidden, since Clifford group gates could be evaluated without quantum communication. Furthermore, this protocol has been proven secure under an appropriate composable security definition in a companion paper by Broadbent.^{51} In this context, Broadbent also proposed a mechanism for verifying that a specified computation had been carried out correctly,^{20} formulated as an interactive proof for BQP, making use of hidden computations for which the expected outcome can be computed by the client, similar in spirit to the trap techniques proposed in refs. 10 and 21.
Fisher et al. were far from alone in seeking to reduce the communications overhead required for delegating quantum computation. In the context of BQC the minimum communications requirements have been analysed both in terms of total communication requirements^{16} and in terms of quantum communication requirements^{52} for a number of client settings, with protocols proposed which come close to saturating these lower bounds. Surprisingly, it has been shown that a client with the ability to adaptively prepare multiqubit states can make use of an iterated teleportation procedure in order to delegate certain quantum computations with exponentially less communication than is required to classically describe the circuit being implemented.^{53}
In the world of classical cryptography, the state of the art regarding computation on encrypted data has changed dramatically over the years since the introduction of the first BQC protocols, with the advent of fully homomorphic encryption.^{54} Fully homomorphic encryption schemes allow data to be processed arbitrarily in its encrypted form, without the need for the encryption key. Such encryption schemes allow for computing on encrypted data without need for communication between client and server during the processing. Achieving such a reduction in round complexity in the context of delegated quantum computation would be highly desirable. It should be noted, however, that even in the classical context this has only been achieved by making use of assumptions about the hardness of certain computational problems, such as the approximate shortest vector problem^{55, 56} or the learning with errors problem.^{57} While for many cryptographic problems quantum mechanics has offered to replace computational security guarantees with information theoretic ones, this does not appear to be the case here. Nogo theorems ruling out evaluation of arbitrary quantum circuits on encrypted data with perfect^{58} information theoretic security. Nonetheless some progress has been made on developing quantum analogues of homomorphic encryption. Several works have explored the use of partiallyhomomorphic encryption which support models of computation not classically simulable, including the Boson sampling model,^{59} under weakened information theoretic security guarantees.^{60, 61} Broadbent and Jeffery introduced a homomorphic encryption scheme which leveraged a computationally secure classical homomorphic encryption scheme to enable evaluation of circuits containing only a constant number of nonClifford gates on encrypted quantum data.^{62} In the case of Broadbent and Jeffery’s scheme, the size of the encoding scaled exponentially with the number of nonClifford gates. However subsequent work by Dulek, Schaffner and Speelman reduced this to only polynomial overhead, resulting in a computationally secure levelled homomorphic encryption scheme.^{63} These latter protocols can be seen as part of a wider programme to broaden quantum cryptographic techniques through the incorporation of computational assumptions.^{64} A recent proposal achieves similar functionality to the BroadbentJeffery scheme but under an information theoretic security definition, provided a sufficiently large key is used.^{65} To date, however, no such counterpart to the work of Dulek, Schaffner and Speelman has been found.
Physical implementations
The discussion thus far has focused on theoretical constructions for delegated computation protocols. However, if these protocols are to become anything other than theoretical curiosities, it is important to establish a path to physical realisation. To this end, a number of works have sought to make blind and verifiable computation protocols more accessible to experiment. This has taken several forms. While early proposals noted that their constructions could be made faulttolerant,^{10, 12} significant work has since been put into computing explicit faulttolerance thresholds for blind computation^{66, 67} and dealing with the issue of noise occurring during quantum communication between client and server.^{67,68,69} Issues of faulttolerance have also been examined in the context of verification,^{70,71,72} a subtle topic which is often underexamined in the literature. In the context of multipleserver protocols, the issue of overcoming noisy correlations between servers has also been addressed in the form of entanglement distillation protocols.^{73, 74} Aside from the issue of noise, recent work has also sought enable blind computation based on resource states potentially more amenable to experiment, including proposed BQC protocols based on continuous variables^{75} and the ground states of certain Hamiltonians.^{76} In particular, the adaptation of the UBQC protocol to use clientsupplied weak coherent states, rather than individual qubits, has received significant attention due to the potential to significantly reduce the technological burden on the client.^{42, 77, 78}
To date, several delegated computation protocols have been successfully demonstrated in a quantum optics setting. Barz et al. performed a successful demonstration of the UBQC protocol using a four qubit resource state entangled according to a variety of graphs, corresponding to subgraphs of the brickwork state.^{81} The reported experiments blindly implemented both the Deutsch–Josza algorithm^{82} and Grover’s search algorithm,^{83} although in each case experimental limitations required that only certain measurement were hidden, corresponding to the choice of oracle for each problem. Subsequently, similar experiments were used to demonstration of a verifiable blind computation protocol modified from theoretical work previously presented in ref. 21 The clientmeasuring protocol of Morimae and Fujii has also been demonstrated using a four qubit cluster state,^{84} which included a replication of the verification method used in ref. 85 in the new client setting. Finally, in the paper proposing their protocol for computing on encrypted data, Fisher et al. included an experimental demonstration using photonic qubits, where they demonstrated individual quantum gates sufficient for universal quantum computation.^{50}
Photons are the clear choice for communication between client and server in blind computation protocols. Long distance optical links allowing for the transmission of quantum states have already undergone significant development,^{86,87,88,89} primarily in the context of quantum key distribution, though communication over extreme distances will require networks integrating quantum repeaters.^{90} Secure delegation of quantum computation to remote locations provides an additional application for such networks.^{91} Photons are less well suited to the business of performing large scale computation. This is due to a combination of factors including the destructive nature of current measurement techniques and the difficulty of performing deterministic entangling gates between photonic qubits. Universal computation is nonetheless possible with linear optics,^{92} and architectures well suited to topological measurementbased computation have been proposed.^{93} However, a hybrid system, such as that depicted in Fig. 8, involving matter qubits for computation and photonic qubits for communication may prove a more viable path for scalable BQC.
Conclusions and outlook
Given recent developments in quantum technologies and the longstanding paradigm in classical computing of delegating computationally intensive tasks to shared systems, the emerging interest in delegated quantum computation is both understandable and timely. While the progress discussed in this review illustrates the potential of BQC and related protocols, the field is still in its infancy, with new results coming on a regular basis but with many open questions still remaining. Perhaps the most prominent open question is that of whether or not blind or verifiable computation is possible with a single server and a completely classical client. In this setting, even when multiple nonentangled noncommunicating servers are allowed, the existence of secure protocols for blind and verifiable computation remains an open question. Indeed, the precise relationship between blindness and verification is currently unresolved. In the context of homomorphic encryption, the existence of fully homomorphic quantum encryption under plausible computational assumptions remains open, despite the promising progress of Dulek et al.^{63} In the context of verification, the most significant challenges facing the field include the necessity to drastically reduce overhead and sensitivity to noise of current deviceindependent verification protocols, and the development of methods to verify analogue quantum simulators and other special purpose devices. While some progress has been made on the question of verifying nonuniversal devices,^{93,94,95,96} much more progress in this direction is necessary to fully unlock the potential of such devices. Lastly it should be noted that progress to date has only scratched the surface of the variety of functionality that future quantum networks may unlock. Recent developments, in terms of multiuser blind computation^{97} and publicly verifiable quantum computation,^{98} together with established results on secure multiparty quantum computation^{28, 99, 100} give some indication of the potential for new secure quantum computing protocols beyond the two party setting. Given these open questions, there is the potential for significant theoretical advance in the coming years. Harnessing the latest advances in experimental capabilities to go beyond the current generation of proofofprinciple experiments is also likely to be an important future direction.
References
 1.
Steffen, M., Gambetta, J. M., & Chow, J. M. in SolidState Device Research Conference (ESSDERC), 46th European 17–20 (IEEE, 2016).
 2.
Bennett, C. H. in International Conference on Computer System and Signal Processing 175–179 (IEEE, 1984).
 3.
Ekert, A. K. Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 67, 661 (1991).
 4.
Patel, K. et al. Coexistence of highbitrate quantum key distribution and data on optical fiber. Phys. Rev. X 2, 041010 (2012).
 5.
Ferguson, N., Schneier, B., & Kohno, T. Cryptography engineering: design principles and practical applications (Wiley, 2011).
 6.
Morimae, T., & Koshiba, T. Impossibility of perfectlysecure delegated quantum computing for classical client. Preprint at arXiv:1407.1636 (2014).
 7.
Abadi, M., Feigenbaum, J., & Kilian J. in Proceedings of the nineteenth annual ACM symposium on Theory of computing 195–203 (ACM, 1987).
 8.
Dunjko, V. & Kashefi, E. Blind quantum computing with two almost identical states. Preprint at arXiv:1604.01586 (2016).
 9.
Mantri, A., Demarie, T. F., Menicucci, N. C., & Fitzsimons, J. F. Flow ambiguity: A path towards classically driven blind quantum computation. Preprint at arXiv:1608.04633 (2016).
 10.
Broadbent, A., Fitzsimons, J. & Kashefi, E. in Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium on 517–526 (IEEE, 2009).
 11.
Morimae, T. & Fujii, K. Blind quantum computation protocol in which Alice only makes measurements. Phys. Rev. A 87, 050301 (2013).
 12.
Aharonov, D., BenOr, M. & Eban, E. Proceedings of Innovations in Computer Science (2010).
 13.
Reichardt, W., Unger, F. & Vazirani, U. Classical command of quantum systems. Nature 496, 456 (2013).
 14.
Arrighi, P. & Salvail, L. Blind quantum computation. Int. J. Quant. Inf. 4, 883 (2006).
 15.
Feigenbaum, J. in Conference on the Theory and Application of Cryptographic Techniques 477–488 (Springer, 1985).
 16.
Giovannetti, V., Maccone, L., Morimae, T. & Rudolph, T. G. Efficient universal blind quantum computation. Phys. Rev. Lett. 111, 230501 (2013).
 17.
Dunjko, V., Fitzsimons, J. F., Portmann, C., & Renner, R. in Advances in Cryptology – ASIACRYPT 2014: 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7–11, 2014, Proceedings, Part II (eds Sarkar, P. & Iwata, T.) 406–425, (Springer, 2014).
 18.
Maurer, U. & Renner, R. in In Innovations in Computer Science (2011).
 19.
Dunjko, V., Fitzsimons, J. F., Portmann, C., & Renner, R. Composable security of delegated quantum computation. Preprint at arXiv:1301.3662 (2013).
 20.
Broadbent, A. How to verify a quantum computation. Preprint at arXiv:1509.09180 (2015).
 21.
Fitzsimons, J. F. & Kashefi, E. Unconditionally verifiable blind computation. Preprint at arXiv:1203.5217 (2012).
 22.
Morimae, T. Verification for measurementonly blind quantum computing. Phys. Rev. A. 89, 060302 (2014).
 23.
Reichardt, W., Unger, F., & Vazirani, U. A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games. Preprint at arXiv:1209.0448 (2012).
 24.
Fitzsimons, J. F., & Hajdušek, M. Post hoc verification of quantum computation. Preprint at arXiv:1512.04375 (2015).
 25.
Morimae, T., & Fitzsimons, J. F. Post hoc verification with a single prover. Preprint at arXiv:1603.06046 (2016).
 26.
Natarajan, A., & Vidick, T. Robust selftesting of manyqubit states. Preprint at arXiv:1610.03574 (2016).
 27.
Childs, A. M. Secure assisted quantum computation. Quant. Inf. Comput. 5, 456 (2005).
 28.
BenOr, M., Crépeau, C., Gottesman, D., Hassidim, A., & Smith, A. in 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) 249–260 (IEEE, 2006).
 29.
Barnum, H., Crépeau, C., Gottesman, D., Smith, A., & Tapp, A. in Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on 449–458 (IEEE, 2002).
 30.
Childs, A. M., Leung, D. W. & Nielsen, M. A. Unified derivations of measurementbased schemes for quantum computation. Phys. Rev. A. 71, 032318 (2005).
 31.
Nielsen, M. A. Clusterstate quantum computation. Reports on Mathematical Physics 57, 147 (2006).
 32.
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R. & Van den Nest, M. Measurementbased quantum computation. Nature Physics 5, 19 (2009).
 33.
Raussendorf, R. & Briegel, H. J. A oneway quantum computer. Phys. Rev. Lett. 86, 5188 (2001).
 34.
Raussendorf, R., Browne, D. E. & Briegel, H. J. Measurementbased quantum computation on cluster states. Phys. Rev. A. 68, 022312 (2003).
 35.
Mantri, A., Demarie, T. F. & Fitzsimons, J. F. Universality of quantum computation with cluster states and (X, Y)plane measurements. Scientific Reports 7, 42861 (2017).
 36.
Browne, D. & Briegel, H. J. Lectures on Quantum Information 359–379 (2006).
 37.
Danos, V. & Kashefi, E. Determinism in the oneway model. Phys. Rev. A. 74, 052310 (2006).
 38.
Kapourniotis, T., Dunjko V., & Kashefi E. On optimising quantum communication in verifiable quantum computing. Preprint at arXiv:1506.06943 (2015).
 39.
Morimae, T. & Koshiba, T. Composable security of measuringAlice blind quantum computation. Preprint at arXiv:1306.2113 (2013).
 40.
Hayashi, M. & Morimae, T. Verifiable measurementonly blind quantum computing with stabilizer testing. Phys. Rev. Lett. 115, 220502 (2015).
 41.
Morimae, T. Measurementonly verifiable blind quantum computing with quantum input verification. Phys. Rev. A. 94, 042301 (2016).
 42.
Dunjko, V., Kashefi, E. & Leverrier, A. Blind quantum computing with weak coherent pulses. Phys. Rev. Lett. 108, 200502 (2012).
 43.
Hajdušek, M., PérezDelgado, C. A., & Fitzsimons J. F. Deviceindependent verifiable blind quantum computation. Preprint at arXiv:1502.02563 (2015).
 44.
Gheorghiu, A., Wallden, P. & Kashefi, E. Rigidity of quantum steering and onesided deviceindependent verifiable quantum computation. New. J. Phys. 19, 023043 (2017).
 45.
Gheorghiu, E., Kashefi & Wallden, P. Robustness and device independence of verifiable blind quantum computing. New. J. Phys. 17, 083040 (2015).
 46.
McKague, M. Interactive Proofs for BQP via SelfTested Graph States. Theor. Comput. 12, 1 (2016).
 47.
Hayashi, M. & Hajdusek, M. Selfguaranteed measurementbased quantum computation. Preprint at arXiv:1603.02195 (2016).
 48.
Fitzsimons, J. & Vidick, T. in Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science 103–112 (ACM, 2015), pp. 103–112.
 49.
Ji, Z. Classical verification of quantum proofs. in Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing 885–898 (ACM, 2016).
 50.
Fisher, K. et al. Quantum computing on encrypted data. Nat. Commun. 5, 3074 (2014).
 51.
Broadbent, A. Delegating private quantum computations. Can. J. Phys. 93, 941 (2015).
 52.
Mantri, A., PérezDelgado, C. A. & Fitzsimons, J. F. Optimal blind quantum computation. Phys. Rev. Lett. 111, 230502 (2013).
 53.
PérezDelgado, C. A. & Fitzsimons, J. F. Iterated gate teleportation and blind quantum computation. Phys. Rev. Lett. 114, 220502 (2015).
 54.
Gentry, C. A Fully Homomorphic Encryption Scheme. Ph.D. thesis, Stanford University (2009).
 55.
Micciancio, D. The shortest vector in a lattice is hard to approximate to within some constant. SIAM J. Comput. 30, 2008 (2001).
 56.
Khot, S. Hardness of approximating the shortest vector problem in lattices. J. ACM 52, 789 (2005).
 57.
Regev, O. On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56, 34 (2009).
 58.
Yu, L., PérezDelgado, C. A. & Fitzsimons, J. F. Limitations on informationtheoreticallysecure quantum homomorphic encryption. Phys. Rev. A. 90, 050303 (2014).
 59.
Aaronson, S., & Arkhipov, A. in Proceedings of the fortythird annual ACM symposium on Theory of computing 333–342 (ACM, 2011).
 60.
Rohde, P. P., Fitzsimons, J. F. & Gilchrist, A. Quantum walks with encrypted data. Phys. Rev. Lett. 109, 150501 (2012).
 61.
Tan, S.H., Kettlewell, J. A., Ouyang, Y., Chen L., & Fitzsimons J. F. A quantum approach to homomorphic encryption. Sci. Rep. 6, 33467 (2016).
 62.
Broadbent, A., & Jeffery, S. in Annual Cryptology Conference 609–629 (Springer Berlin Heidelberg, 2015).
 63.
Dulek, Y., Schaffner C., & Speelman, F. in Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14–18, 2016, Proceedings, Part III (eds Robshaw M. & Katz J.) 3–32 (Springer, 2016).
 64.
Alagic, G. et al. in Information Theoretic Security: 9th International Conference, ICITS 2016, Tacoma, WA, USA, August 9–12, 2016, Revised Selected Papers 9 47–71 (Springer, 2016).
 65.
Ouyang, Y., Tan, S.H., & Fitzsimons, J. Quantum homomorphic encryption from quantum codes. Preprint at arXiv:1508.00938 (2015).
 66.
Morimae, T. & Fujii, K. Blind topological measurementbased quantum computation. Nat. Commun. 3, 1036 (2012).
 67.
Chien, C.H., Meter, R. V. & Kuo, S.Y. Faulttolerant operations for universal blind quantum computation. ACM J. Emerg. Technol. Comput. Syst. 12, 9 (2015).
 68.
Takeuchi, Y., Fujii, K., Ikuta, R., Yamamoto, T. & Imoto, N. Blind quantum computation over a collectivenoise channel. Phys. Rev. A 93, 052307 (2016).
 69.
Sheng, Y.B., & Zhou, L., Blind quantum computation with noise environment. Preprint at arXiv:1609.08902 (2016).
 70.
Takeuchi, Y., Fujii, K., Morimae, T., & Imoto, N. Practically verifiable blind quantum computation with acceptance rate amplification. Preprint at arXiv:1607.01568 (2016).
 71.
Kashefi, E. & Wallden, P. Optimised resource construction for verifiable quantum computation. J. Phys. A Math. Theor. 50, 145306 (2017).
 72.
Fujii, K. & Hayashi, M. Verifiable faulttolerance in measurementbased quantum computation. Preprint at arXiv:1610.05216 (2016).
 73.
Morimae, T. & Fujii, K. Secure entanglement distillation for doubleserver blind quantum computation. Phys. Rev. Lett. 111, 020502 (2013).
 74.
Sheng, Y.B. & Zhou, L. Deterministic entanglement distillation for secure doubleserver blind quantum computation. Sci. Rep. 5, 7815 (2015).
 75.
Morimae, T. Continuousvariable blind quantum computation. Phys. Rev. Lett. 109, 230502 (2012).
 76.
Morimae, T., Dunjko, V. & Kashefi, E. Ground state blind quantum computation on AKLT state. Quant. Inf. Comput. 15, 200 (2015).
 77.
Xu, K., & Lo, H.k. Blind quantum computing with decoy states. Preprint at arXiv:1508.07910 (2015).
 78.
Li, Q. Z. Q. Blind quantum computing with decoy states. in Advances in Intelligent Information Hiding and Multimedia Signal Processing: Proceeding of the Twelfth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, Nov., 21–23, 2016, Kaohsiung, Taiwan, Vol. 2, 155 (Springer, 2017).
 79.
Blinov, B., Moehring, D., Duan, L.M. & Monroe, C. Observation of entanglement between a single trapped atom and a single photon. Nature 428, 153 (2004).
 80.
Togan, E. et al. Quantum entanglement between an optical photon and a solidstate spin qubit. Nature 466, 730 (2010).
 81.
Barz, S. et al. Demonstration of blind quantum computing. Science 335, 303 (2012).
 82.
Deutsch, D., & Jozsa, R. Rapid solution of problems by quantum computation. in Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, Vol. 439, 553–558 (The Royal Society, 1992).
 83.
Grover, L. K. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325 (1997).
 84.
Greganti, C., Roehsner, M.C., Barz, S., Morimae, T. & Walther, P. Demonstration of measurementonly blind quantum computing. New. J. Phys. 18, 013020 (2016).
 85.
Barz, S., Fitzsimons, J. F., Kashefi, E. & Walther, P. Experimental verification of quantum computation. Nat. Phys. 9, 727 (2013).
 86.
Peev, M. et al. The SECOQC quantum key distribution network in Vienna. New. J. Phys. 11, 075001 (2009).
 87.
Yin, H.L. et al. Measurementdeviceindependent quantum key distribution over a 404 km optical fiber. Phys. Rev. Lett. 117, 190501 (2016).
 88.
Sun, Q.C. et al. Quantum teleportation with independent sources and prior entanglement distribution over a network. Nat. Photon. 10, 671 (2016).
 89.
Valivarthi, R. et al. Quantum teleportation across a metropolitan fibre network. Nat. Photon. 10, 676 (2016).
 90.
Muralidharan S. et al. Optimal architectures for long distance quantum communication. Sci. Rep. 6, 20463 (2016).
 91.
Van Meter, R. Quantum networking. (Wiley, 2014).
 92.
Knill, E., Laflamme, R. & Milburn, G. J. A scheme for efficient quantum computation with linear optics. Nature 409, 46 (2001).
 93.
Devitt, S. J. et al. Architectural design for a topological cluster state quantum computer. New. J. Phys. 11, 083032 (2009).
 94.
Kapourniotis, T., Kashefi, E. & Datta, A. in LIPIcsLeibniz International Proceedings in Informatics (eds. Flammia, S.T. & Harrow, A.W.) Vol. 27 (Schloss DagstuhlLeibnizZentrum fuer Informatik, 2014).
 95.
Hangleiter, D., Kliesch, M., Schwarz, M. & Eisert, J. Direct certification of a class of quantum simulations. Quant. Sci. Technol. 2, 015004 (2017).
 96.
Carolan, J. et al. On the experimental verification of quantum complexity in linear optics. Nat. Photon. 8, 621 (2014).
 97.
Kashefi, E., & Pappa, A. Blind multiparty quantum computing. Preprint at arXiv:1606.09200 (2016).
 98.
Honda, K. Publicly verifiable blind quantum computation. Preprint at arXiv:1604.00116 (2016).
 99.
Crépeau, C., Gottesman, D. & Smith, A. in Proceedings of the thiryfourth annual ACM symposium on Theory of computing 643–652 (ACM, 2002).
 100.
Colbeck, R. Quantum and relativistic protocols for secure multiparty computation. Preprint at arXiv:0911.3814 (2009).
Acknowledgements
The author thanks Vedran Dunjko, Atul Mantri, Yingkai Ouyang, Christopher Portmann and Renato Renner for helpful comments on the manuscript. The author acknowledges support from the Air Force Office of Scientific Research under AOARD grant FA23861514082 and the Singapore National Research Foundation under NRF Award NRFNRFF201301.
Author information
Affiliations
Contributions
J.F.F. wrote the review in its entirety.
Corresponding author
Ethics declarations
Competing interests
The author declares no competing financial interests.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Fitzsimons, J.F. Private quantum computation: an introduction to blind quantum computing and related protocols. npj Quantum Inf 3, 23 (2017). https://doi.org/10.1038/s4153401700253
Received:
Revised:
Accepted:
Published:
Further reading

StateoftheArt Survey of Quantum Cryptography
Archives of Computational Methods in Engineering (2021)

On the Possibility of Classical Client Blind Quantum Computing
Cryptography (2021)

Quantum network probing with indefinite routing
Quantum Information Processing (2021)

Development of Quantum Interconnects (QuICs) for NextGeneration Information Technologies
PRX Quantum (2021)

An Efficient Public Key Cryptosystem Based on Dihedral Group and Quantum Spin States
IEEE Access (2020)