Single-click protocol for remote state preparation with a weak coherent pulse source

The single-click protocol enhances remote state preparation by using a weak coherent pulse source and phase-stabilized links to increase preparation rates while maintaining fidelity, addressing limitations in existing protocols.

WO2026216996A9PCT designated stage Publication Date: 2026-11-19TECH UNIV DELFT +2
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
PCT/NL2026/050102
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2026-04-10
Publication Date
2026-11-19

AI Technical Summary

Technical Problem

Existing remote state preparation protocols in quantum computing are limited by the rate at which remote states can be prepared without a loss in fidelity, particularly when using weak coherent pulse sources.

Method used

A single-click protocol that utilizes a weak coherent pulse source at the client node, phase-stabilized quantum communication links, and a measurement node for detecting a single photon event to validate the remote state preparation, allowing higher preparation rates without fidelity loss.

Benefits of technology

The single-click protocol enables efficient remote state preparation at higher rates with maintained fidelity, leveraging a weak coherent pulse source and phase-stabilized links to achieve comparable or better performance than traditional double-click protocols.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure NL2026050102_19112026_PF_FP_ABST
    Figure NL2026050102_19112026_PF_FP_ABST
Patent Text Reader

Abstract

The present disclosure presents a single-click protocol for use in a quantum network, nodes of such quantum network, and related methods. The quantum network includes client nodes, server nodes, and measurement nodes, wherein at least one client node is operatively coupled via a first quantum communication link with at least one measurement node, and wherein at least one server node is operatively coupled via a second quantum communication link with the at least one measurement node, wherein the at least one server node and the at least one client node are configured to transmit quantum states toward the measurement node for remote state preparation, and wherein the server node and the client node are configured to receive heralding signals from the measurement node, wherein the measurement node is configured to transmit the heralding signals upon using a single-click protocol.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] Single-click protocol for remote state preparation with a weak coherent pulse source

[0002] Technical field

[0003] The present disclosure relates to a quantum network, a server node, a client node, and a measurement node for operating in said quantum network, as well as methods of employing a single-click protocol in those nodes.

[0004] Background

[0005] Quantum computing is an advanced field of computing that leverages the principles of quantum mechanics to process information in fundamentally different ways compared to classical computers. Unlike classical bits, which represent data as Os or 1s, quantum bits (qubits) can exist in multiple states simultaneously due to superposition. This allows quantum computers to perform complex calculations at unprecedented speeds.

[0006] The hardware required to perform these complex calculations can be substantial, such that it becomes unwieldy for users to have such a quantum computer in their homes. Accordingly, it is more beneficial for a client to have control over the state of a remote qubit at a sever (also known as remote state preparation), which performs the computation and sends the results back to the client while keeping the data and computation private. Such a method is known as blind quantum computing and ensures privacy and security in quantum computations. Furthermore, this allows the client to delegate the quantum computation, while the client itself only has limited quantum capabilities.

[0007] In an example remote state preparation scenario, a pulse is emitted from the client towards the server, and the server on the other hand also emits a pulse towards the client. An intermediate measurement node is then used to validate the success of the remote state preparation by means of interference of the pulses coming from both the client and the server. The problem of existing protocols for remote state preparation is that the rate at which the remote states are prepared is limited.

[0008] Accordingly, it is the goal of the disclosure to provide a method which can be performed at a higher rate without a loss in fidelity.

[0009] Summary

[0010] A summary of aspects of certain examples disclosed herein is set forth below. It should be understood that these aspects are presented merely to provide the reader with a brief summary of these certain embodiments and that these aspects are not intended to limit the scope of this disclosure. Indeed, this disclosure may encompass a variety of aspects and / or a combination of aspects that may not be set forth.

[0011] Throughout the disclosure, the following abbreviations may be used:

[0012] BSM = Bell-state measurement;

[0013] CNOT = controlled-NOT;

[0014] DC = double-click;

[0015] DSC = double-single-click;

[0016] SC = single-click.

[0017] A first aspect of the disclosure pertains to a quantum network comprising at least one client node, at least one server node, and at least one measurement node, wherein the at least one client node is operatively coupled via a first quantum communication link with the at least one measurement node, and wherein the at least one server node is operatively coupled via a second quantum communication link with the at least one measurement node, wherein the at least one server node and the at least one client node are configured to transmit quantum states toward the measurement node for remote state preparation, and wherein the server node and the client node are configured to receive heralding signals from the measurement node, wherein the measurement node is configured to transmit the heralding signals upon successfully detecting a quantum state in a single-click protocol.

[0018] The benefit of the quantum network according to the disclosure is that remote states can be prepared by the client to be used by the server efficiently at a high rate without a loss in fidelity, because the single-click protocol only relies on the detection of only one photon at the measurement node. With a general loss factor in such quantum networks the likelihood of observing a click is linear with the photon number (i.e., photon arrival probability) for the single-click protocol, whereas the likelihood ofobserving two clicks goes quadratically. An unexpected advantage is that with the single-click protocol for remote state preparation in some key regimes, even a higher rate can be achieved at the same fidelity than with the standard double-click protocol.

[0019] In a particular example, the first quantum communication link and the second quantum communication link are phase stabilized in order to maintain the phase of the transmitted quantum state.

[0020] The phase of the remote prepared state is encoded in the phase of the transmitted quantum state. In order to circumvent the influence of (environmental) effects in / on the first / second quantum links phase stabilization is required.

[0021] Phase stabilization can be achieved through several methods. Examples thereof encompass using phase self-stabilized multiplexing systems formed by components such as beam displacers and half-wave plates. These components help eliminate the relative phase between different signal paths, ensuring stable phase relationships.

[0022] Said method may utilize time-multiplexing to stabilize the phase by passing photons through waveplates or beam splitters, which cause phase shifts and can lead to interference effects that help stabilize the phase.

[0023] Alternatively, reference optical signals may be utilized to track relative phase delays of entangled photons, and phase-correction signals are generated to maintain the relative phases via adjustable phase-delay elements.

[0024] In an example of the quantum network, the measurement node is configured to perform the single-click protocol, wherein the single-click protocol at the measurement node comprises:

[0025] - receiving quantum states from the at least one client node and the at least one server node;

[0026] - detecting a single photon event, defining a click, using a Bell-state measurement device; and

[0027] - transmitting a heralding signal to the client node and the server node upon said detection.

[0028] In another example of the quantum network, the server node is configured to perform the single-click protocol, wherein the single-click protocol at the server node comprises:

[0029] - storing a single quantum state in a memory qubit;

[0030] - emitting a quantum signal towards the measurement node;

[0031] - receiving a heralding signal.

[0032] The benefit of the single-click protocol according to the disclosure is that only one single photon event, also known as one single-click, is required to determine whether a state was remotely prepared correctly or not. This allows to achieve higher rates, while for some key regimes even achieving similar or better fidelity than the double-click protocol.

[0033] In a further example of the quantum network, the at least one client node comprises a weak coherent pulse for transmitting quantum states.

[0034] The inventors have found that by using a weak coherent pulse source at the client side of the quantum network, preferably the client node not comprising a quantum memory, the client node can be constructed having low quantum capabilities, thereby relieving the costs of a client node in a quantum network tremendously.

[0035] A weak coherent pulse source is thus a practical and inexpensive way to approximate a single-photon source. It is typically created using a faint laser, which emits light pulses with an average photon number less than one. In the context of quantum key distribution, a weak coherent pulse source can be used to generate light pulses that are phase-modulated and attenuated to ensure that the average number of photons per pulse is less than one. This helps in maintaining the security of the communication by making it difficult for an eavesdropper to gain information about the transmitted key.

[0036] In yet another example of the quantum network, the first quantum communication link and the second quantum communication link are optical communication interfaces.

[0037] In a further example, the at least one measurement node comprises a Bell state measurement device, thereby defining a bell state measurement station in the quantum network.

[0038] In a particular example thereof, the Bell-state measurement device comprises a beamsplitter and at least one single photon detector, the Bell-state measurement device preferably comprising an optical delay line, and more preferably comprising two single photon detectors.

[0039] A Bell state measurement device is an essential tool in quantum information science. Typically, it performs a joint measurement on two quantum states to determine their entangled state, also known as a Bell state. The Bell states are four specific maximally entangled quantum states of two qubits. The device uses quantummechanics principles such as superposition and entanglement to measure these states. According to the disclosure only a single measurement is performed by the Bell-state measurement device to determine the remotely prepared state.

[0040] In an example of the quantum network, the quantum network comprises at least one quantum repeater provided in between the at least one client node and the at least one server node.

[0041] In an example thereof, the at least one quantum repeater comprises a plurality of quantum repeaters arranged in a quantum repeater chain.

[0042] The inventors have found that for achieving long-distance quantum communication links, quantum repeaters are crucial components, since they address the problem of signal loss and noise in quantum communication links. Typically, they work by creating entanglement between distant nodes through a process called entanglement swapping. This involves dividing the communication distance into shorter segments, entangling qubits at each segment, and then swapping the entanglement to extend it over the entire distance. Quantum repeaters are essential for quantum key distribution (QKD) and other quantum communication protocols, as they allow for secure transmission of quantum information over long distances.

[0043] In an example of the quantum network, the quantum repeater comprises:

[0044] - at least one photon source for emitting at least one photon;

[0045] - at least two quantum memories, wherein one of the at least two quantum memories is configured to be entangled with the at least one photon;

[0046] - at least one Bell state measurement, BSM, device.

[0047] In a particular example thereof, the photon source is a single photon emitter.

[0048] The above-mentioned elements have been identified to be relevant in order to technically achieve the quantum state swapping, wherein the quantum repeater establishes an entanglement between two internal quantum memories which are in quantum communication with two neighboring nodes, respectively. Such that the two neighboring nodes effectively become entangled or in quantum communication.

[0049] Preferably a single photon source is utilized for this.

[0050] In another example, the quantum network may be configured for quantum key distribution.

[0051] The benefit of the single-click protocol for quantum key distribution is that it works over repeaters and therefore it can be extended over larger distances compared to ‘normal’ QKD.

[0052] Quantum key distribution may be performed between two clients with repeaters in between. The first repeater may then act as a server node. The client node and this server node are adapted to encode information into the emitted quantum states, and are adapted to filter measurements on the respective quantum memory qubits, wherein the client node and the server node are adapted to compare measurement bases and are adapted to maintain measurement bases that matched.

[0053] The above-mentioned steps allow two client nodes to generate and share a cryptographic key using quantum mechanical principles. Both client nodes send their quantum states, where the state is dependent on phase and photon presence / absence. These quantum states are transmitted over the quantum network, and the client nodes perform measururements on the quantum statesusing randomly selected bases. The clients then perform a filtering process to retain only the bits where their measurement bases matched. This is followed by classical error correction to reconcile any discrepancies and privacy amplification to eliminate any partial information that may have been obtained by an eavesdropper, resulting in a final shared secret key that is provably secure against interception.

[0054] A second aspect of the disclosure pertains to a server node for use in a quantum network as described above, wherein the server node comprises:

[0055] - at least one quantum memory qubit;

[0056] - at least one photon source for emitting at least one photon;

[0057] - a controller for preparing a qubit-photon entanglement between the quantum memory qubit and the at least one photon.

[0058] According to the disclosure, and preferably in blind quantum computing, the server node is equipped with greater quantum resources than a client node. The above-mentioned elements are the minimum for performing remote state preparation, wherein a quantum state is stored in the at least one quantum memory and remote state preparation is performed by emitting at least one photon, which is entangled with the quantum state in the at least one quantum memory as a qubit-photon entanglement.

[0059] In an example, the server node further comprises further quantum computing means for performing quantum computing on the at least one quantum memory qubit.

[0060] Once the remote state is validated, it is intended for the server node to perform further quantum computing on the stored quantum state in the at least one quantum memory, such further computations may include quantum searches, prime number factorization, etcetera. In case that the server node is utilized for blind quantum computing, it should be understood that the server node comprises at least three quantum memory qubits of which at least one quantum memory qubit is photonemissive. The latter may be achieved by incorporation of a single photon source and a quantum memory qubit, such that qubit-photon entanglement is achieved.

[0061] In another example of the server node, the at least one photon source and the quantum memory are combined into one element.

[0062] In a further example of the server node, the at least one photon source is a single photon emitter.

[0063] A third aspect of the disclosure pertains to a client node for use in a quantum network as described above. The client node comprising:

[0064] - at least one weak coherent pulse source.

[0065] As mentioned before, particularly for blind quantum computing, it is desired that the client does not require a lot of quantum capabilities. Accordingly, the inventors have found that requiring at least one weak coherent pulse source (and optical elements like waveplates to control the phase) is sufficient for the client to perform remote state preparation. Note that other classical communication channels may also be required to transmit the instructions for the computation and / or provide other information to the server node. However, from a quantum perspective of the remote state preparation, a weak coherent pulse source suffices.

[0066] In a further example, of the client node, the weak coherent pulse comprises a pulsed laser and preferably a neutral density, ND, filter, which is tuned such that the average photon number per pulse is smaller than 1. Accordingly, pulses for remote state preparation can be transmitted effectively without requiring expensive tools, thereby keeping the quantum capabilities of the client node small and financially interesting.

[0067] A fourth aspect of the disclosure pertains to a measurement node for use in a quantum network as described above. The measurement node is configured to perform the single-click protocol, wherein the measurement node comprises:

[0068] a Bell-state measurement device configured to receive quantum states from the at least one client node and the at least one server node, and further configured to detect a single photon event, defining a single-click;

[0069] and wherein the measurement node is configured to transmit a heralding signal to the at least one client node and to the at least one server node upon said detection.

[0070] The benefit of the measurement node according to the disclosure is that it can validate a remotely prepared state requiring only one single-click, photon detection event, without the loss of fidelity compared to the double-click protocol.

[0071] It should be understood that the quantum network would still need a measurement node acting as a validator for the remotely prepared state. These quantum repeaters function by performing a so-called entanglement swap, wherein quantum states in the two quantum memories of the quantum repeater are entangled with each other and each respective quantum state is entangled with a further node (i.e. quantum repeater, client node, true measurement node, or server node).

[0072] In a further example of the measurement node, the at least one photon source is a single photon source.

[0073] As mentioned in relationship to the server node, it is preferred to utilize a single photon source.

[0074] A fifth aspect of the disclosure pertains to a method of employing a single-click protocol for remote state preparation, performed by a measurement node as described above. The method comprises receiving quantum states from at least one client node and at least one server node, detecting a single photon event, defining a single-click, using a Bell-state measurement device, and transmitting a heralding signal to the at least one client node and to the at least one server node upon said detection.

[0075] A sixth aspect of the disclosure pertains to a method for remote state preparation, performed by a client node as described above. The method comprises emitting a pulse of light with an average photon number of less than 1, and receiving at least one heralding signal.

[0076] A seventh aspect of the disclosure pertains to a method for remote state preparation, performed by a server node as described above. The method comprisesstoring at least one quantum state in a memory qubit, emitting at least one quantum signal towards the measurement node, and receiving at least one heralding signal.

[0077] In an example of the method performed by a server node, the steps of storing, emitting and receiving comprise storing one single quantum state, emitting one single quantum signal, and receiving one single heralding signal, respectively.

[0078] The benefits of the methods according to the disclosure are that remote states can be prepared by client nodes which have only little quantum capabilities on server nodes which comprise large quantum capabilities by means of a financially interesting photon source. The measurement node in between performs the validation of the remotely prepared state and communicates via classical communication channels to the client node and server node, whether the attempt was successful of not. It also gives some information to the client node about the type of entanglement that was found (the measurement outcome discloses this). Upon a successful attempt the server node can perform the quantum computations of which the results are communicated back to the client node. That way, long distance (blind) quantum computing can be achieved with a client node, the client node itself not having the quantum capabilities to perform said quantum computation.

[0079] Furthermore, the benefit of the methods according to the disclosure are that higher rates to remote state preparation can be achieved, without a loss in fidelity as compared to a double-click protocol, since a remote state according to the disclosure can be validated requiring only one single-click (photon detection event).

[0080] Throughout the documents the wording “click” is used to indicate a photon detection event. It should be understood by the expert in the field that single photon detectors, such as avalanche detectors or SPADs, are used for detecting photon events. In a non-limiting example, a detector indicates that it has detected a single photon when the photon is absorbed in the active semiconductor electronic element, which creates a current spike in the internal electronics of the photon detector. With very precise internal clocks the exact timing or an incident photon is returned as a measurement signal indicating a binary result of detection (YES / NO) and the corresponding time stamp.

[0081] Furthermore, it should be understood that the wording “single-click” indicate that the photon detector observes one single photon detection event in a particular time window. Typically, the time window is related to the repetition rate of the pulses ofphoton source of both the client node and the server node. Given a Bell-state measurement device comprising a beamsplitter and two single photon detectors, in a single-click protocol, it suffices when only one of the two photon detectors observed a photon event. Whereas in a double-click protocol, both photon detectors of the Bellstate measurement device need to click within the same time-window.

[0082] All in all, the quantum network, the client node, the measurement node, the server node, and the method for remote state preparation for each node, respectively, offer an efficient both in speed and in cost way of preparing remote states, initiated by a client node, on a sever node for further quantum computing.

[0083] The server node can be a quantum computer, or a node with quantum computing capabilities.

[0084] Brief description of the Drawings

[0085] Embodiments of the present disclosure will now be described, by way of example only, with reference to the accompanying schematic drawings in which corresponding reference symbol indicate corresponding parts, in which:

[0086] Fig. 1A illustrates a known double-click protocol;

[0087] Fig. 1B illustrates a single-click protocol according to the present disclosure;

[0088] Fig. 1C illustrates a double-single-click protocol disclosed in the present disclosure;

[0089] Figs. 2A-2B are graphs illustrating trade-offs between fidelity and rate for a known double-click protocol, a double-single-click protocol disclosed in the present disclosure and a single-click protocol according to the present disclosure;

[0090] Fig. 3 illustrates local operations in the double-single-click protocol;

[0091] Figs. 4A-4C are graphs illustrating performance differences between a known double-click protocol, a double-single-click protocol disclosed in the present disclosure and a single-click protocol according to the present disclosure;

[0092] Fig. 5 shows a schematic drawing of an example embodiment of a repeater QKD protocol between two clients;

[0093] Figs. 6A-6B are alternative value plots of Fig. 4A;

[0094] Figs. 7A-7B are alternative value plots of Fig. 4B; and

[0095] Figs. 8A-8B are alternative value plots of Fig. 4C.

[0096] The figures are intended for illustrative purposes only, and do not serve as restriction of the scope of the protection as laid down by the claims.

[0097] Detailed description

[0098] It will be readily understood that the components of the embodiments as generally described herein and illustrated in the appended figures could be arranged and designed in a wide variety of different configurations. Thus, the following more detailed description of various embodiments, as represented in the figures, is not intended to limit the scope of the present disclosure but is merely representative of various embodiments. While the various aspects of the embodiments are presented in drawings, the drawings are not necessarily drawn to scale unless specifically indicated.

[0099] The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the present disclosure is, therefore, indicated by the appended claims rather than by this detailed description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

[0100] Reference throughout this specification to features, advantages, or similar language does not imply that all of the features and advantages that may be realized with the present disclosure should be or are in any single example of the present disclosure. Rather, language referring to the features and advantages is understood to mean that a specific feature, advantage, or characteristic described in connection with an embodiment is included in at least one embodiment of the present disclosure. Thus, discussions of the features and advantages, and similar language, throughout this specification may, but do not necessarily, refer to the same example.

[0101] Furthermore, the described features, advantages, and characteristics of the present disclosure may be combined in any suitable manner in one or more embodiments. One skilled in the relevant art will recognize, in light of the description herein, that the present disclosure may be practiced without one or more of the specific features or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments of the present disclosure. Reference throughout this

[0102] specification to "one embodiment," "an embodiment," or similar language means that a particular feature, structure, or characteristic described in connection with the indicated embodiment is included in at least one embodiment of the present disclosure. Thus, the phrases "in one embodiment," "in an embodiment," and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.

[0103] Introduction

[0104] Remote state preparation (RSP) allows one party to remotely and securely prepare a specific quantum state on another party’s qubit, using classical information combined with shared entanglement resources. One party, called a client, can be a quantum device with low quantum capabilities, specifically, it does not need a quantum memory. In quantum networks, it has potential applications in areas such as blind quantum computing (BQC), memory-assisted quantum key distribution (QKD), and QKD over repeater nodes.

[0105] A key motivation in applications such as QKD and BQC is to minimize quantum hardware requirements for clients, allowing them to perform tasks such as measuring or sending quantum states while offloading complex operations to the server. Other types of clients have been proposed for BQC, like a client that only performs single qubit gates or even a completely classical client, in combination with multiple noncommunicating servers, though these clients do not allow for QKD.

[0106] In the following, a scenario where clients prepare and send quantum states will be described. While generating single photons remains technologically challenging, weak coherent pulse (WCP) sources offer a practical alternative: they are not perfect single-photon sources as they emit more than one photon with non-zero probability, but they have much lower cost, are simpler to implement and can be easily modulated to the optimal parameters. Despite their limitations, WCP sources are widely used in QKD due to well-developed techniques that manage multiphoton emissions. Recently, WCP-based approaches have also been explored for BQC.

[0107] In quantum networks, two protocols are widely used for entanglement generation: the known double-click and known single-click protocols. Double-click requires two photons, one from each participating node, to arrive at a BSM station, a scenario often hindered by high losses. The known single-click protocol, on the otherhand, requires only one photon to reach the BSM, thereby significantly increasing the success rate, though at the cost of a lower fidelity.

[0108] Whereas RSP requires entanglement, the entanglement does not need to be stored in both nodes, such that one of the nodes can have lower hardware requirements. When it comes to RSP with a WCP source on the client side, traditionally there is a focus only on the double-click protocol.

[0109] The present disclosure presents that single-click can also enhance RSP protocols with a WCP client. To this end, the present disclosure introduces two novel approaches to performing RSP using a client with a WCP source: single-click and double-single-click. Note that throughout this disclosure “single-click” is used to refer to the improved single-click solution of the present disclosure, whereas “known single-click” refers to the known single-click solution. Double-single-click repeats the single-click protocol and uses a CNOT gate aiming to mitigate the need for phase stabilization.

[0110] The present disclosure further confirms that single-click can indeed achieve higher rates than double-click for the same fidelity, consistent with findings from entanglement generation. It has been found that that double-single-click can also achieve higher rates than double-click.

[0111] The present disclosure further shows that, interestingly, single-click and double-single-click do not inherently suffer from lower fidelity compared to double-click, as the known single-click protocol does in entanglement generation, such that single-click and double-single-click have a strict advantage over double-click in certain regimes.

[0112] Potential applications of the single-click and double-click protocols can be found in BQC and for QKD in repeater networks, where the increased speed provided by single-click and double-single-click protocols could facilitate longer-distance and more robust quantum communication setups.

[0113] RSP protocols

[0114] In the present disclosure, three remote state preparation protocols are considered for performing RSP between a client equipped with a WCP source, and a quantum server, equipped with quantum memory that can emit memory-entangled photons. In all cases a BSM station is required between the client and the server. Mathematically speaking, the exact position of the BSM (in the middle, closer to clientor closer to the server) is irrelevant, as the fiber losses can be taken into account by adjusting the efficiencies r]c, rs. However, positioning the BSM directly next to the server has some advantages: it reduces the number of nodes needed in the network and it allows for faster RSP attempts. As in most regimes, there can be a limitation in the repetition rate of the server, having the BSM close to the server allows for a reduction of classical communication time. The server can quickly receive success / failure signals, and reset for the next attempt, while the client can continuously send pulses at a high rate.

[0115] Figs. 1A-1C are diagrams illustrating the three remote state preparation protocols. The square represents the server 1, with a dot denoting an emitting qubit, while the hexagon represents the client 2 equipped with a weak coherent pulse source. Both client 2 and server 1 send their quantum states (depicted as pulses in Figs. 1A-1C) to the BSM station 3.

[0116] In the known double-click protocol shown in Fig. 1A, a two-mode encoding is used, such as polarization or time-bin, while in the single-click protocol of the present disclosure shown in Fig. 1B and double-single-click protocol of the present disclosure shown in Fig. 1C a presence-absence encoding is applied in a single-mode configuration. The double-click protocol of Fig. 1 A and the double-single-click protocol of Fig. 1C both require two photons to be detected, but the double-single-click protocol of Fig. 1 C advantageously allows for re-trying of each node separately, as the photons are entangled with separate memory qubits.

[0117] Two lines are drawn in Fig. 1C to illustrate the pulses coming from the two different memory qubits, it is not required to have two separate paths to the BSM 3. The server’s 1 qubit is entangled with the emitted light, which, along with the client’s 2 light, is mixed on a beam-splitter and analyzed by the BSM 3. Upon successful detection, the server’s 1 qubit is projected into a state selected by the client 2.

[0118] This terminology is analogous to that used in entanglement generation, where the double-click protocol uses orthogonal modes such as polarization or time-bin encoding to carry the quantum information of the photons. The single-click protocol uses a presence-absence encoding, allowing entanglement to be formed with only one photon arriving at the BSM 3. The double-single-click protocol repeats the single-click protocol to eliminate the need for phase stabilization in certain regimes.

[0119] Model

[0120] In the following, each calculation may follow the same steps. First, the input states from the client and server may be characterized. Here, states are created on the equator of the Bloch sphere, i.e., states typically of the form

[0121]

[0122] for some angle 6, which are states sufficient for, e.g., QKD and BQC.

[0123] A loss channel with loss probability 1 -r / c and 1 -qsmay be applied to the client 2 and server 1 state, respectively. These losses capture all losses and inefficiencies in the system: emission inefficiency, coupling to fiber, inefficiencies due to frequency conversion, loss in fiber and detector inefficiencies. After, the photon(s) arriving at the beamsplitter of the BSM 3 may be considered, where beam splitter transformations are applied to the combined client-server state. Then, projection operators may be applied for the measurement, allowing to find the density matrix of the final remotely prepared state as well as the probability of this measurement outcome. From this, the (dimensionless) rate per attempt time T (in single-click and double-click equal to the success probability of an attempt) may be constructed and the fidelity with respect to the target state |+e>, as F = | (+e| p |+e) |.

[0124] Double-click protocol

[0125] In the known double-click protocol, the server 1 prepares a Bell state, consisting of the server qubit and the server photon, the latter encoded in, e.g., time-bin or polarization. The client 2 emits a WCP with amplitude a = |aj in equal superposition of the photon encoding, with a relative phase 0. The phase of the WCP pulse is assumed to be randomized over time for security. If the BSM 3 detects a photon in both states of the encoding, the operation is successful and |+e) = (|0) + e'e|1 » / ^2 is prepared on the server 1. The relative phase between the WCPs determines the phase of the prepared state. With this, the fidelity of the remotely prepared state may be computed, and the RSP success probability as the rate times the time per attempt T and find:

[0126]

[0127] and

[0128]

[0129] In the last lines, the approximation |o|2« 1 is used. A derivation of the protocol is further described under the heading ‘Appendix A’ in the description below.

[0130] From this it can be seen that the fidelity approaches one as the mean photon number approaches zero, which is also shown in Figs 2A-2B where trade-offs between fidelity and rate for the three RSP protocols (i.e., double-click, double-single-click and single-click) are compared: Fig. 2A without phase noise and Fig. 2B with phase noise of Osc = O'DSC = 0.5 rad. This example analysis assumes a server efficiency of ps= 0.13 and a detector efficiency of < J = 0.7. The plotted values are for a mean photon number, as emitted by the client, below 0.5.

[0131] The mean photon number approaching zero, however, also means that the probability of success approaches zero, as no photons get send to the BSM 3. With the increase in the mean photon number, the probability of a successful event increases, but with that, the fidelity drops due to the increased probability of multiphoton events. This is true for all three protocols in the absence of phase noise.

[0132] Single-click protocol

[0133] The present disclosure presents a new and improved method for preparing quantum states remotely over a quantum network using readily available weak laserpulses. The single-click protocol only requires detecting one photon (=light particle) instead of the usual two.

[0134] Remotely preparing quantum states may be used for various applications within quantum networks, such as long-distance quantum key distribution or blind quantum computing.

[0135] The single-click protocol improves on existing protocols, allowing to perform the applications faster and / or with higher quality in key regimes (depending on how good the systems are).

[0136] Remote state preparation with a weak coherent pulse (WCP) source using double-click has been demonstrated experimentally and is proven secure for blind quantum computing. Both the known double-click and the known single-click protocols are used for entanglement generation in quantum networks (different from remote state preparation, and it does not use a weak coherent pulse). There are shortcomings in the known protocols. The known single-click protocol used in entanglement generation has not been extended for use in remote state preparation with a weak coherent pulse. The weak coherent pulse is more readily available than single-photon sources, so that makes the application more accessible. The known single-click protocol in entanglement generation is proven faster (i.e., it can be performed at higher rate) than the double-click protocol, though at lower fidelity (=quality). It has been found that the single-click protocol of the present disclosure for remote state preparation with a weak coherent pulse provides a similar speedup, though without the loss in fidelity compared to the double-click protocol.

[0137] The single-click protocol of the present disclosure solves these shortcomings as follows. The single-click protocol of the present disclosure relies on the detection of only one photon at an intermediate BSM, whereas the previous double-click protocol relies on two photons arriving. As photons get lost very easily in quantum networks, needing two photons is unlikelyA2, whereas one photon is only unlikelyA1. The phase of the remotely prepared state is then encoded in the phase of the weak coherent pulse, and the balance between the states |0> and |1> is determined by the 'balance' of probabilities of photons arriving from either side. By contrast, in the double-click protocol, the weak coherent pulse is prepared directly in the target state and the other party sends out a Bell state.

[0138] Another advantages of the single-click protocol of the present disclosure is that, as stated before, the single-click protocol provides not only the expected speed-up compared to double-click, it has been found that it also performs at comparable-or-higher fidelity in key regimes.

[0139] The present disclosure thus presents a single-click protocol for remote state preparation using WCPs. Inspired by the known single-click protocol in entanglement generation, the single-click protocol relies on only one signal from the server or the client, instead of both. The single-click protocol of the present disclosure differs from known protocols, amongst others, in that a state is remotely prepared, being faster and / or better in key regimes.

[0140] The single-click protocol may be summarized as follows:

[0141] • The client sends out a coherent state with displacement a = |o|e“'e, this displacement ends up being the phase in the remotely prepared state, hence phase stabilization is required along the path of this pulse. The server sends out a single photon when its memory qubit is in the bright state, denoted |1) (and no photon otherwise). The probability of the server being in the bright state is dependent on the bright state parameter f. The optimal value can be estimated for f based on the losses in the system (server inefficiencies, fiber loss, detector inefficiencies) and the mean photon number of the WCP (i.e., the intensity of the laser). Note that the WCP typically includes a low intensity pulsed laser, which sends out a pulse with a normally distributed probability of different photon numbers, where the mean photon number is lower than one, making it approximate a single photon source with some higher-emission events.

[0142] • The pulses from the client and server travel to an intermediate BSM, consisting of a beamsplitter and two photon detectors. The RSP is heralded when exactly one detector clicks.

[0143] It has been found that this single-click protocol performs better, i.e., it remotely prepares with a higher rate and / or fidelity, in key regimes compared to the double-click protocol.

[0144] In the following, a more detailed description of the single-click protocol of the present disclosure follows.

[0145] In the single-click protocol of the present disclosure, the client 2 may send out a coherent state with complex amplitude a = |cr|e—l6. The server 1 may initially be in a superposition state

[0146]

[0147] where f is the bright state parameter. The server 1 may send out a single photon if its memory qubit is in the bright state, denoted 11 >, and no photon otherwise, denoted |0). With that, the input states may be described by:

[0148]

[0149] where \ jc) (|< 's>) is the state emitted by the client 2 (server 1).

[0150] The state remotely prepared at the server 1 typically depends on two factors: (1) The balance of probabilities for a photon arriving from each side, where equal probabilities create a state on the equator of the Bloch sphere. These probabilities are determined by the losses on the server 1 sides, the losses on the client 2 side r / c, the mean photon number of the WCP, |aj2, and the bright state parameter f of the emitter at the server 1. (2) The phase 0 of the WCP, since the state coming from the server 1 has a constant phase (assumed to be zero for simplicity), this introduces a phase difference of 6 between the states produced when a photon originating from the server 1 side (heralding the server 1 in the bright state) and the client 2 side (heralding the server 1 in the dark state) arrives at the BSM 3.

[0151] To create the target state |+e), there should be equal probability of the photon arriving at the BSM 3 from the client 2, as from the server 1. Note that, unlike for double-click, only states can be prepared on a fixed latitude of the Bloch sphere (here, the equator); changing latitude requires either the server 1 to change its bright state parameter, or the client 2 to change the laser intensity. While this could in principle be done, this possibility may be omitted for simplicity.

[0152] After applying the loss channels, beam splitter transformations and detector projectors to the combined client-server state, the fidelity of the remotely prepared state may be computed with respect to the target state |+0), optimized over f, and the RSP success probability as the rate times the time per attempt r and find:

[0153]

[0154] and

[0155]

[0156] In the approximation on the last line it is assumed that |o|2« 1. Again, a derivation of the protocol is further described under the heading ‘Appendix A’ in the description below.

[0157] In Fig. 2A, the rate-fidelity trade-off for the single-click protocol is shown. Just like for double-click, it can be seen that the fidelity approaches one as the rate approaches zero, which happens for the mean photon number |o|2— ► 0. The fidelity in above equations 2 and 6 are both a linear function of |o|2, but the fidelity of doubleclick has twice the negative slope of single-click in the small |cr|2limit. Combined with a different scaling in the rate, it has been found that there is a more favorable ratefidelity trade-off for single-click, characterized by a less-steep slope in Fig. 2A.

[0158] Double-single-click protocol

[0159] The present disclosure further presents a new and improved method for preparing quantum states remotely over a quantum network using readily available weak laser pulses using a double-single-click protocol, building on the above described single-click protocol. The double-single-click protocol allows to prepare thequantum states faster or of higher quality, while reducing some technical overhead introduced by the single-click protocol.

[0160] Remotely preparing quantum states may be used for various applications within quantum networks, such as long-distance quantum key distribution or blind quantum computing.

[0161] The double-single-click protocol further improves on existing protocols, allowing to perform the applications faster and / or with higher quality in key regimes (depending on how good the systems are).

[0162] The double-single-click protocol of the present disclosure involves two remotely prepared states of the form |+_theta>=(|0> + eA(i theta)| 1 >) / sqrt(2) by the single-click protocol of the present disclosure, which are then combined using a CNOT gate. After measuring the target qubit, the remaining qubit has a phase that is the phase difference between the two remotely prepared states. With this, any change in phase in the transmission gets 'deleted' as long as they are the same between the two singleclick-prepared states, such that there is no need to phase stabilize (as long as the change in phase is the same between the two single-click-prepared states), while still having advantages over the known double-click protocol.

[0163] The present disclosure thus further presents a double-single-click protocol for remote state preparation using WCPs. It builds upon the single-click protocol, aiming to eliminate the need for phase stabilization while still providing an advantage over the known double-click protocol in key regimes. The double-single-click protocol is to remotely prepare states of the form |+e) = (|0) + e'e|1 )) / A / 2 for any phase 0 using a WCP-based client.

[0164] The single-click protocol may be summarized as follows:

[0165] • Perform the single-click protocol until successful twice, remotely preparing the states |+s?) and |+e2> (where 0 = 0? - 02).

[0166] • After two qubits have been remotely prepared, the server performs a CNOT gate on the two qubits and measures the target qubit. The resulting qubit is kept if the measured qubit was in the state |0) and discarded otherwise, excluding state where an even number of photons have been emitted.

[0167] The second step leaves the final qubit with a phase that is the difference of the two phases of the remotely prepared qubits. With this, some change in phase between the time of emission and the time of detection is ‘deleted’ as long as this phase changeis the same for the two qubits, eliminating the need for phase stabilization. This reduces the technical overhead of the single-click protocol, while still providing an advantage over the known double-click protocol in terms of rate and / or fidelity of the remotely prepared qubit in key regimes.

[0168] In the following, a more detailed description of the double-single-click protocol of the present disclosure follows.

[0169] The double-single-click protocol of the present disclosure involves performing the single-click protocol twice, thus remotely preparing two qubits as described above for the single-click protocol. It may be assumed that the first qubit is not affected during the generation of the second qubit, meaning that decoherence is not included, giving an upper bound to the achievable fidelity. After successfully heralding two clicks, the resulting qubits are in a state where either zero ( / ' |00>), one (|01 > or 110» or two (| 11 >) photons have been emitted by the server emitter. A CNOT gate may then be applied to the two remotely prepared qubits, followed by a measurement of the target qubit. A post-selection may be performed on the target state being in |0>, excluding state where an even number of photons have been emitted, similar to the double-click protocol.

[0170] Then, the phase of the final qubit corresponds to the difference of the first two qubits, as depicted in Fig. 3 showing local operations in the double-single-click protocol. In Fig. 3, some random phase that gets added through phase wandering gets canceled out after applying a CNOT gate and measuring the target qubit, as long as the random phase is the same for the two qubits.

[0171] With this, the need for phase stabilization is advantageously mitigated if the phase stays constant between the two emissions. A detailed analysis of the protocol leads to the following expressions for rate and fidelity:

[0172]

[0173] and

[0174]

[0175] Again it is approximated for |cr|2« 1, and a detailed derivation is described under the heading ‘Appendix A” below.

[0176] In Fig. 2A it can be seen that the double-single-click line lies between those for double-click and single-click, as there is a same scaling of F with |o|2as for doubleclick (see Equations 2 and 8 above), but a different scaling in the rate (see Equations 1 and 7 above).

[0177] Phase noise

[0178] Small fluctuations in the system may cause the true phase of the WCP to drift over time. In the double-click protocol, with time-bin or polarization encoding, thesephase shifts are not problematic because it is only sensitive to phase differences between two co-propagating orthogonal modes. Typically, these modes are close enough in time or have no fluctuating birefringence, so that any phase changes between the two modes are negligible. In contrast, phase shifts present a challenge for the single-click protocol, necessitating active phase stabilization. The double-single-click protocol aims to eliminate this technical overhead by “deleting” the overall phase of two successful single-click operations, leaving only the phase difference between the two clicks as noise.

[0179] Note that with that, double-single-click does not combat phase noise, instead it combats the technical requirement of phase stabilization. The CNOT and its effect on the qubits is depicted in Fig. 3. This approach is effective only if the phase drift between the two successes is small, which requires sufficiently fast remote preparation.

[0180] Despite phase stabilization in single-click and the CNOT operation in double-single-click, some residual phase noise will likely appear in both protocols. In single-click, this may arise from imperfections in the phase stabilization process. In double-single-click, the phase noise stems from drift between the first and second clicks, which depends on the time interval between them (T) and the linewidth of the optical field and drift of optical elements (Av), i.e., the rate at which the phase evolves. Phase noise may be modeled in single-click and double-single-click as affecting the final state in similar ways, but to differing extents. To account for this, introduce two variables may be introduced to represent the standard deviation of phase noise: asc for single-click and ODSC for double-single-click.

[0181] The value of a.sc may be determined through experimental characterization of the setup, while ODSC may be estimated using STTAZ T, jf limited by optical linewidth.

[0182] It may be assumed that phase noise follows a Gaussian distribution with standard deviation o. This results in a phase noise factor of XnOise = e“A2 / 2, which modifies the fidelity equations for single-click and double-single-click. Without noise, these fidelities, given in above Equations 6 and 8, take the form F = (1 + x) / 2; with noise, they become Fnoise = (1 +xXn0 / se) / 2. Additional details are provided below under the heading ‘Appendix A 5’.

[0183] In Fig. 2B the effect of the phase noise term on the single-click and double-single-click results can be seen. While the rate of the protocols is not affected by thephase noise, it lowers the maximal achievable fidelity, effectively pushing the ratefidelity line downwards. Here, it is chosen to plot Osc = QDSC for comparison. These two parameters will likely not be the same in a real-life system, as the noise has a different origin for each protocol.

[0184] Comparison and discussion

[0185] From the formulas for the fidelity without phase noise, see above Equations (2), (6) and (8), it can be seen that the first order contributions in |cr|2are 1 - r?c(4 - 3 / 7s)|a| / 16 / sfor single-click and double-click, and 1 - / c(4 - 3ps)\a\ / 8psfor double-single-click. This infidelity can be intuitively understood as a client photon reaching the detector in the same mode as the server photon. Either the server photon is lost, contributing with 1 - ps, or the server photon reaches the detector and bunches with the client photon, contributing with ps / 4. In the double-single-click protocol there are two chances to introduce this error, leading to an extra factor of 2. For the small values of |o|2considered in this disclosure, the fidelity will thus be very similar across the three protocols. However, the performance of the protocols depends heavily on the rate and the phase noise.

[0186] Thus, to compare the performance of the three protocols, their fidelity and rate are considered in different scenarios. This may be done by varying the intensity of the client laser a, the amount of phase noise in the single-click and double-single-click protocols Osc and ODSC and the efficiency of the server ps. Other parameters that may be considered are the efficiency on the client side, pc, determined mostly by fiber loss, and the single photon detector efficiency pd, however it may not be required to vary over these.

[0187] In an example scenario, the client 2 and server 1 may be separated by 25 km of optical fiber, resulting in a transmission probability of pc= 0.32 for the client pulse to reach the BSM 3, which may be located at the server 1. The same rates and fidelities can be achieved for other distances, by simply adjusting a, for this reason, pcis not considered as a parameter to vary, but it is noted as it affects the values of a. Adjusting a will affect the security, and might thus lead to an overhead on the full (QKD or BQC) protocol. This effect is not considered in this example. Similarly, pd may be set as Pd = 0.7, as varying the detection efficiency has the same effect as varying psand pc, which does not give new insights in trade-offs.

[0188] It is observed that increasing a enhances the rate but reduces the fidelity, leading to a trade-off explored for the three different protocols in Figs. 2A-2C. For Figs. 2A-2C, the efficiency of the server 1 has been set to rjs = 0.13 based on an emission probability of 0.53 and a successful telecom frequency conversion probability of 0.25, representing the state-of-the-art. A scenario with no phase noise is shown in Fig. 2A, and additionally a scenario is shown for what happens when a phase noise is introduced of a standard deviation of asc = QDSC = 0.5 radians for both single-click and double-single-click in Fig. 2B. With this, the laser intensity of the client 2 is varied between |cr|2= 0.001 and |o|2= 0.5.

[0189] From Fig. 2A it can be seen that the single-click protocol can achieve the highest rates, followed by double-single-click, with double-click having the lowest rate for any a. Unlike in entanglement generation or when using only single photons, the single-click and double-single-click protocols provide similar fidelity for a given | cr|2to doubleclick which gives it a strict advantage over double-click in the absence of phase noise.

[0190] From Fig. 2B it can be seen that in the regime of low rates, the double-click protocol can obtain a higher fidelity. This is due to phase noise lowering the maximally achievable fidelity for single-click and double-single-click. In a scenario without phase noise (Fig. 2A), the fidelity approaches unity for all protocols. To achieve a reasonable rate, the laser power must, however, be increased. This higher |o|2causes an increase in the infidelity of the three protocols, with the greatest impact on the double-click protocol, as there |cr|2needs to be increased the most for the same increase in rate.

[0191] For single-click, the required increase in |o|2, and thereby the increase in infidelity, is the lowest. Thus, for a specific rate, the single-click protocol can yield a higher fidelity than the

[0192] double-click protocol.

[0193] To determine which protocol is most advantageous under various conditions, scenarios are evaluated across different server 1 efficiencies (factoring in detector efficiency: r]s— qsr]d) and levels of phase noise for specific target fidelities or rates. Figs. 4A-4C illustrates these findings as a non-limiting example, with blocks color-coded (in grey scales) to indicate the most advantageous protocol. From each of Figs.

[0194] 4A-4C, the optimal RSP protocol, i.e., double-click, double-single-click, or single-click, can be determined for a given target fidelity or rate, across varying levels of phase noise osc and < JDSC (standard deviation in radians), and server efficiency. For eachcombination of parameters, the smallest | or|2may be determined at which the target is met (if achievable) and identify the protocol that performs best. The best-performing protocol is represented by grey scale: double-click (light grey), double-single-click (mid grey), and single-click (dark grey).

[0195] Fig. 4A shows the regions where each scheme provides the highest rate for a target fidelity of 0.98. Here, the phase noise of the double-single-click protocol is fixed to be ODSC = 0.5, but r]s and osc are varied. It can be seen that single-click outperforms double-click in low-osc regimes, with occasional jumps based on server efficiency. This is because, in high-osc regions, single-click and double-single-click fail to achieve the target fidelity, leaving double-click as the only viable option. Near the boundary between the single-click and double-click regions, single-click approaches its maximum fidelity and achieves the target at a lower rate than double-click. Here, higher server efficiencies favor double-click more significantly than single-click, further shrinking single-click’s advantageous region. However, unless the target fidelity is close to the single-click maximum, single-click generally provides higher rates than double-click.

[0196] The size of single-click’s advantage region decreases with increasing target fidelity and increases with lower target fidelity, as the target fidelity determines where single-click becomes infeasible. Double-single-click does not exhibit a clear advantage in any region, but appears on the boarder between the single-click and double-click regions when Oosc 0.3 rad. However, as will also be discuss below, double-single-click provides an advantage over single-click in terms of technical demand in the form of phase stabilization.

[0197] In Fig. 4B, the scheme is identified achieving the highest fidelity for a target rate of 0.01, again setting oDsc = 0.5. It can be seen that double-click outperforms single-click and double-single-click only in scenarios with high asc and efficient servers. As the target rate decreases, the size of double-click’s advantage region increases, while it decreases for higher target probabilities, double-single-click gains some advantage over double-click and single-click when the server efficiency is low, but osc is high. Naturally, this region gets smaller when ODSC is higher and larger when ODSC is lower.

[0198] To find the effect that different ratios of osc to dose has on the advantage regions, risis fixed to 0.3 and again it is found which protocol provides the highest fidelity given a target rate of 0.01, these regions are shown in Fig. 4C. Here, it can be seen that thedivide between single-click and double-single-click is advantageous depending on the noise levels occurring in each protocol. The high-noise regime in which double-click provides an advantage shrinks when the server efficiency is lower, and grows when it is higher. Additionally, increasing the server efficiency pushes down, towards lower ODSC, the border line between single-click and double-single-click, and decreasing it will push the line up.

[0199] Alternative examples to the selected values for these plots are described under the heading ‘Appendix B’ in the description below, which can be used to visualize the explained effects of parameter changes of the form ‘when parameter x increases / decreases, y happens’.

[0200] Overall, it has been found that double-click is advantageous under high phase noise, high server efficiency, or high fidelity targets. It has been found that single-click performs better with less efficient servers, lower phase noise, or when high rates are desired. It has been found that double-single-click can gain an advantage if Oosc is small compared to osc- Notably, protocols requiring multiple remotely prepared qubits (e.g., in BQC) may benefit more from higher-rate, lower-fidelity RSPs due to the impact of decoherence.

[0201] A potential drawback of the single-click protocol is the need for phase stabilization, which can be technologically challenging to implement. The double-single-click protocol may alleviate this need, when two consecutive successes of the single-click protocol are close enough in time so that the phase has not shifted significantly, otherwise aDsc will grow too large.

[0202] Therefore, one needs to be able to either re-excite the memory qubit very fast, or have enough multiplexing capabilities. Notably, even if double-single-click does not give advantageous performance over single-click, eliminating the need for phase stabilization may still make it favorable, as long as CJDSC is low enough to provide an advantage over double-click. Double-click has the advantage of not needing phase stabilization and also having a negligible amount of phase noise, though the increased rate of single-click and double-single-click over double-click can lead to an overall higher fidelity for multi-qubit states when including decoherence.

[0203] Some noise sources have been left out of the above analysis. For example, infidelity in the server matter-photon state and decoherence of the server memory. For a single RSP in single-click and double-click, decoherence will be minimal, becausethe BSM 3 is assumed to be directly next to the server 1, and thus the RSP will be heralded almost instantaneously.

[0204] However, in the double-single-click protocol, decoherence will affect the fidelity of the final remotely prepared state if the time between the two single-click successes is long. This effect is not taken into account here, as it would take many assumptions on the setup (e.g., server repetition rate, multiplexing capabilities, cutoff time for the memory) in order to quantify this, making it a less generally applicable comparison. Therefore, the fidelity given here for the double-single-click protocol can be taken as an upper bound for the achievable fidelity with decoherence. To a certain extent, the amount of infidelity decoherence adds to the final remotely prepared state can be adjusted while sacrificing on rate by setting a window, sometimes referred to as a cutoff time, for the two clicks.

[0205] Applications

[0206] RSP finds impactful applications across multiple domains within a quantum network, for example in blind quantum computing protocols (BQC). In addition to BQC, it has been found that the RSP protocols according to the present disclosure in combination with a repeater chain can produce perfectly correlated bits across long distances (see also Fig. 5) and there are possibilities for the RSP schemes to be part of a quantum key distribution (QKD) protocol.

[0207] Fig. 5 shows a schematic drawing of an example embodiment of a repeater QKD protocol between two clients A and 8. The untrusted third party has prepared a long distance entangled pair between nodes S? and S2 (not shown). Client A (8) remotely prepares a qubit of the form |+e) on node Szi (SB). Once remote state preparation succeeds for client A (8), a local BSM is performed between nodes

[0208]

[0209] and S? SB and S2).

[0210] RSP for long distance communication.- RSP enables long distance communication over a repeater chain. For a schematic drawing, reference is made to the example of Fig. 5, where two clients are wanting to establish a key with each other, and a repeater chain between them. Note that detailed calculations are presented under the heading ‘Appendix C’ in the description below. The clients A and 8 remotely prepare a qubit of the form |+e) on the first nodes of the repeater chain: S^ and SB. Once A and 8 have both succeeded in remotely preparing their qubits, shared

[0211] entanglement between SA and SB can be used to swap the states to the same node, where a BSM can be performed between the two remotely prepared qubits. A and B use the reported measurement patterns as part of the protocol to align their bit values (with B flipping his bit when necessary), the security of the protocol does not rely on trusting these measurements. Instead, security is guaranteed through subsequent parameter estimation and privacy amplification steps between A and B.

[0212] In measurement-device-independent (MDI) QKD, the security of the protocol is independent on how the BSM is performed. Therefore, a protocol that uses RSP and teleportation across a repeater chain can be equivalent to an MDI QKD protocol that uses a simple BSM. In ‘Appendix C’ below it is shown that these protocols for RSP are compatible with existing QKD security proofs.

[0213] RSP for BQC.- BQC using double-click RSP with a WCP-based client has been proven secure (which improves on by eliminating the need for photon counting, adding verifiability and providing scaling in terms of number of samples with respect to the transmittance of the channel). A common technique used in security proofs both in QKD and BQC with WCP sources is to phase randomize the WCP, effectively getting rid of the coherences within the WCP. This assumption cannot be made in the single-click security proof, as it is relied on the phase of the WCP to define the phase of the remotely prepared state. In double-single-click, however, the phase of the remotely prepared state depends on the phase difference between the first and the second click, such that the pulses can be phase randomized, as long as the randomization is equal for both pulses. This may allow extending standard security proofs to double-single-click.

[0214] Conclusions

[0215] The present disclosure introduces two powerful new protocols for remote state preparation using weak coherent pulses: single-click and double-single-click. In single-click, the phase transferred onto the remotely prepared state is encoded in the weak coherent pulse of the client, while the photon-emission probability of the server is adjusted to balance photon arrival probabilities at the BSM station. Double-single-click repeats this process twice and applies a CNOT gate to the resulting qubits, effectively canceling out random phase fluctuations between the pulses and eliminating the need for phase stabilization when the clicks occur faster than the phase fluctuations.

[0216] It has been found that:

[0217] 1. The single-click protocol consistently achieves higher rates than double-click while maintaining comparable fidelity levels. This is in contrast to entanglement generation, where obtaining a higher rate due to switching from double-click to single-click comes at a cost of lowered fidelity. This represents a significant advantage for practical implementations where high preparation rates are crucial;

[0218] 2. For systems with low server efficiency, high target rates, or modest fidelity requirements, single-click offers clear advantages over double-click. This is especially relevant for quantum computing applications requiring multiple remote state preparations;

[0219] 3. The double-single-click protocol provides a practical middle ground - while delivering more modest rate improvements over double-click, it can eliminate the need for phase stabilization when the system can perform attempts fast enough that the phase remains stable between consecutive successes.

[0220] The choice between these protocols depends on specific experimental constraints, e.g.,:

[0221] • Use single-click when maximum rate is paramount and phase stabilization is feasible;

[0222] • Consider double-single-click when phase stabilization is challenging but system speeds allow for sufficiently low phase noise between consecutive clicks;

[0223] • Stick with double-click for applications requiring maximum fidelity for a single qubit or when providing a low phase noise environment for single-click and double-single-click is not feasible

[0224] Throughout this disclosure, it has been demonstrated how these protocols can be applied to quantum key distribution over repeater chains using existing measurement-device-independent protocols. The path forward for blind quantum computing applications appears promising, particularly given recent security proofs for double-click-based protocols.

[0225] Appendix A: Derivation of rate and fidelity formulas

[0226] In this Appendix A, example calculations are presented for finding the success probability and fidelity of a single remotely prepared qubit state using non-photon number resolving detectors. In these calculations, the target state is given by |+e>, forsome angle 0. Detailed calculations will be presented for the single-click protocol. As the derivation for the other protocols are very similar, only the results for the doubleclick and double-single-click protocols will be presented for brevity.

[0227] Losses will be considered, which can be due to server inefficiencies, detector inefficiencies, fiber losses, losses due to frequency conversion or any other. It is assumed that no other imperfections aside from the WCP source not being a perfect single-photon source and the phase noise is as discussed in Appendix 5 below. Le., in this Appendix A perfect gates are assumed, and it is assumed that the server 1 emits with perfect fidelity and no decoherence.

[0228] Appendix A1: Double-click

[0229] For double-click, the client 2 sends out a WCP with displacement a, lets it fall onto a beamsplitter and includes a phase shift for one of the arms. This can be a polarizing beamsplitter in the case of polarization encoding, or a regular beamsplitter with delay line in the case of time-bin encoding. The server 1 will emit a photon entangled with the state of the qubit. is set to = 1 / / 2 to maximize the fidelity; this means the server 1 and photon qubits form a Bell state.

[0230] The input states may thus be given by:

[0231]

[0232] Now, losses are introduced for both the server 1 and client 2 photons. Furthermore, the light is subjected in both the early and late time bins (assuming timebin encoding) to a BSM. The operation will succeed if a photon is detected in both time bins. The density matrix and fidelity of the remotely prepared qubit and success probability of the protocol are:

[0233]

[0234] Appendix A2: Single-click

[0235] The client 2 sends out a coherent state with displacement a = |cr|el8. The server

[0236] 1 sends out a single photon when its memory qubit is in the bright state, denoted |1)

[0237] (and no photon otherwise). The probability of the server 1 being in the bright state is dependent on the bright state parameter. Thus, the following are the start states:

[0238] Ik) = x / 1 - k 100) + £ |11). (A5)

[0239]

[0240] Losses 1 - r]cand 1 - rjsare introduced on the client 2 and server 1 states. This transforms the client state to

[0241]

[0242] by effectively rescaling the mean photon number for the WCP, and the server 1 is represented by the density-matrix:

[0243]

[0244] meaning the system is given by the density matrix Pays — As ® | x / kQX IA L The 50 / 50 beamsplitter transforms the client 2 and server 1 photons into a plus and minus modes with the annihilation operators a± = (as±ac) / X2, where ac(as) is the annihilation operator of the client (server) photon. A photon detector is placed in both paths, and will be referred to as plus and minus detectors, respectively. It is assumed that a signal comes from the plus detector while the minus detector stays silent, corresponding to the measurement operator (1 - l0+)(0+l) j0-)(0-l, leading to density matrix:

[0245]

[0246] where tr^ is the trace over the photon subspace, 0-) is the state of no photons in the minus detector, and the denominator is the probability of obtaining a click in the plus detector, Psq+- The numerator is given by:

[0247]

[0248] Next, the denominator PSq+ is derived:

[0249]

[0250] where the success probability is Psc = 2Psq+, as PSq+ = Psci- The density matrix after the heralding click is then:

[0251]

[0252] Next, the fidelity is found with respect to our target state |+e) as F = | (+s| psc |+s) | and find:

[0253]

[0254] This fidelity can be maximized with respect to the bright state parameter f, leading to:

[0255]

[0256] Here, the last expression is the expansion up to first order in the mean photon number from the client 2, as it is wanted to be in a regime where the client 2 sends out a weak pulse. The calculations are continued with the exact expression, not the first order expansion. The fidelity becomes:

[0257]

[0258] Similarly, the expression for the optimized bright state parameter in the success probability is substituted to find:

[0259]

[0260] From this, the rate can be calculated as the success probability multiplied by the time per attempt T. The ‘dimensionless rate’ RT is used in the analysis, as this allows to compare it to the double-single-click protocol, where one does not speak of a success probability per attempt (as two successes are needed).

[0261] Appendix A3: Double-single-click

[0262] For double-single-click, the single-click protocol is performed twice. The state after the two successful clicks is psys= Psc ® Psc, with psc as in Equation A10 presented above. Then, a CNOT gate is performed on the two prepared qubits, followed by a measurement on the target qubit. The state is only accepted if this qubit is in the bright state |1). As the CNOT gate and measurement ensures that the two qubits were measured in different states, the fidelity is no longer dependent on the bright state parameter. The density matrix and the fidelity of the remotely prepared state are:

[0263]

[0264] A success probability of the process is not considered, as it is assumed that the first qubit is stored, while waiting for the second qubit to be generated. Instead, assessments are made in terms of the rate, assuming a fixed time for each attempt. It is considered that the two qubits are prepared on the server 1 in parallel, meaning, the dimensionless rate will be:

[0265]

[0266] where Psc is the single-click success probability, with displacement o7\?2; the first (second) term in the parentheses corresponds to the time it takes to prepare the first (second) qubit and PCNOT is the probability that the measurement after the CNOT gate yields the correct outcome. As Psc is small, the approximated version for the success probability is used. The bright state parameter which maximizes the success probability is chosen, yielding the expression:

[0267]

[0268] Appendix A4: Single-click with photon number resolving detectors

[0269] If photon number resolving detectors are assumed, for single-click the transformation now reads:

[0270] (Alfl)

[0271]

[0272] which leads to the probability of success of obtaining a click in the ”plus”-mode is:

[0273]

[0274] The state after the heralding becomes:

[0275]

[0276] To obtain the ideal state, the same relation between and |cr| is found as the scheme without photon number resolving detectors. The total success probability under this condition becomes:

[0277]

[0278] The density matrix then becomes:

[0279]

[0280] Thus the improvement of using number resolving detectors over non-photon number resolving detectors is the factor of 1 - pson the first order term in the intensity of the laser, and perfect fidelity is found if there are no losses on the server 1 side.

[0281] Appendix A5: Phase noise

[0282] Phase noise in this system arises from different underlying causes in the three protocols. For single-click the phase of the coherent state 6 will change as it travels to the BSM 3. The coherent state is thus transformed to the density matrix:

[0283]

[0284] where 5e is the added phase noise, and pse is the distribution of the phase noise. This noise means the remotely prepared state is of the form:

[0285]

[0286] where a, b and c are the positive real coefficients of the single-click density matrix. It is assumed pse to be a Gaussian distribution with variance cr2sc. In principle one should use a wrapped Gaussian distribution, but it will not change our results, as there will be integration over a periodic function. This leads to the average fidelity:

[0287]

[0288] In the double-single-click and double-click protocols, the density matrix will be transformed by the noise such that:

[0289]

[0290] where 0i (O2) is the random phase added to the first (second) coherent state. The remotely prepared state will take the form:

[0291]

[0292] where a, b and c can be found from Equations A15 and A2 for double-single-click and double-click, respectively. As, it is the difference between the two phase noises 61 and 02 which matters, a change of variable will be made to such that 61 62 + 5e, this yields the density matrix:

[0293]

[0294] where qse is marginal distribution over the variable 5e. For double-click it can be assumed qse to be very close to a delta function as the two coherent state co-propagate with a different polarization for the polarization encoding, or with a very slow time delay for the time-bin encoding. For double-single-click, however, the phase noise depends on the time between consecutive clicks. The shorter the time between successful clicks, the narrower the probability distribution of the phase noise. Assuming qse is a Gaussian distribution with variance O2DSC, the following fidelity is obtained:

[0295]

[0296] Appendix B: Alternative value plots

[0297] Figs. 6A-6B show alternative value plots for an optimal RSP protocol (doubleclick, double-single-click, or single-click) for a given target fidelity, across varying levels of phase noise oSc and oDsc (standard deviation in radians), and server efficiency. Alternative values for Fig. 4A are shown, with in Fig. 6A a protocol that gives the highest rate given a target fidelity of 0.97 for CTDSC = 0.5 rad, and in Fig. 6B a protocol that gives the highest rate given a target fidelity of 0.97 for oDsc = 0.25 rad.

[0298] Figs. 7A-7B show alternative value plots for an optimal RSP protocol (doubleclick, double-single-click, or single-click) for a given target fidelity, across varying levels of phase noise osc and ODSC (standard deviation in radians), and server efficiency. Alternative values for Fig. 4B are shown, with in Fig. 7A a protocol that gives the highest fidelity given a target rate of 0.03r1for CTDSC = 0.5 rad, and in Fig. 7B a protocol that gives the highest fidelity given a target rate of 0.01 r-1ODSC = 0.25 rad.

[0299] Figs. 8A-8B show alternative value plots for an optimal RSP protocol (doubleclick, double-single-click, or single-click) for a given target fidelity, across varying levels of phase noise osc and ODSC (standard deviation in radians), and server efficiency. Alternative values for Fig. 4C are shown, with in Fig. 8A a protocol that gives the highest fidelity given a target rate of 0.03r-1for rp = 0.3, and in Fig. 8B a protocol that gives the highest fidelity given a target rate of 0.01 r1for ps= 0.1.

[0300] Appendix C: Purified protocols for quantum key distribution

[0301] To analyze the security of QKD over a repeater chain using these RSP protocols, they may be converted to a purified entanglement-based protocol. In such a purified protocol, two clients 2, Alice and Bob, aim to create entanglement between them. Under the assumption that Alice and Bob’s devices are secure and trusted, the purified protocol is not differentiable from the real protocol by any eavesdropper on the quantum channel. The data and data processing performed by the clients 2 is also the same for the purified protocol as for the real protocol. This allows to analyze the security of the setup depicted in Fig. 5 for performing QKD by examining the equivalent entanglement-based protocol. In the following, the single-click and double-click purified protocol is described in detail to show how entanglement may be formed between Alice and Bob.

[0302] Appendix C1: Single-click

[0303] Here, it is show that the single-click protocol for remote state preparation (RSP-single-click) of the present disclosure in combination with the setup depicted in Fig. 5 may be used to implement a twin-field type protocol. The security proof given by Curty-Azuma-Lo in the so-called CAL19 protocol may be followed. In the following, first the steps of the CAL19 protocol are recapped, and then it is illustrated how the RSP-single-click protocol allows to produce perfectly correlated bits and its compatibility with the CAL19 security proof.

[0304] The Cal 19 protocol may be summarized as follows:

[0305] (i) In each round of the Cal 19 protocol Alice and Bob can choose between two basis, the key generation basis K and the test basis T. These bases are chosen with probability PK and pr, respectively. When the basis chosen is K, Alice (Bob) also chooses a random bit ka(kb). When the random bit is ka= 0 (kb = 0) Alice (Bob) prepares the coherent state |oa) ( | 0,)), while for ka= 1 (kb = 1 ), she (he) prepares | - aa) (|- Ob)). When the basis chosen is T, Alice prepares a phase-randomized WCP Pa.3A Pb.pE) with a mean photon number randomly picked from a set S = {|>6,|2}i.

[0306] (ii) Alice and Bob send their prepared optical pulses through their corresponding channels.

[0307] (iii) In the central node C both optical pulses are merged in a 50:50 beamsplitter. The result of this interference is registered by the detectors at the output ports of the beamsplitter. The detector at the first output is denominated as Do, and the one on the second port as Dn. These names are used to stress that when the incoming coherent fields have the same phase, in the absence of any source of noise, they should produce a click in Do. Although if the coherent fields have a phase difference of TT, it should be expected to register a click in Da.

[0308] (iv) After the measurement is performed, the central node C announces which detectors clicked. There are four possible click patterns, but Alice and Bob will keep their data only when one click was registered, either on Do or Dn, the rest of cases are ignored.

[0309] (v) The previous steps are repeated N times such that Alice and Bob can collect enough statistics to perform parameter estimation and quantify the amount of information leaked to an eavesdropper.

[0310] (vi) Finally, Alice and Bob perform classical error correction and privacy amplification to obtain a final secret key.

[0311] There are two observations to be made regarding this Call 9 protocol. First, to simplify the explanation, consider that there is only post-select of the clicks in Do and that sources of noise are neglected. Then, it can be seen that all events in the K basis produce perfectly correlated bits for Alice and Bob, i.e., ka= kb. This is desirable for a QKD protocol, since a protocol that in the noiseless scenario would not produce perfect correlations would lead to higher costs for error correction in the post-processing stage.

[0312] Next, an example embodiment of a protocol according to the present disclosure will be detailed, which is based on the scheme for RSP-single-click.

[0313] The single-click RSP based protocol may be summarized as follows:

[0314] (i) A qubit in server nodes SA and SB (see Fig. 5), which are at the border of the repeater chain, is prepared in the state

[0315]

[0316] +£ 10, with the bright-state parameter of the server qubit. Repeater nodes S? and S2 share entanglement of the form

[0317]

[0318] (ii) Alice and Bob both prepare the state:

[0319]

[0320] which combines the state of the photon, with a is a positive real number, with the state of Alice’s or Bob’s register.

[0321] (iii) The server node SA emits a photon entangled with a qubit at the node. Here, it is assumed that here are perfect efficiencies and photon number resolving detectors, meaning RSP can be performed on SA / B with perfect fidelity (see also Appendix

[0322] A4). Then, performing a BSM between Alice and node SA leads to an entangled state between Alice’s register and the node:

[0323]

[0324] where |±) = (|0) ± 11 >)h / 2. The same is repeated on Bob’s side.

[0325] (iv) The entanglement is propagated through the repeater chain using entanglement swapping until Alice’s and Bob’s registers share this state with neighboring nodes, such as S2 and SB. Then, a BSM is performed on S2 and SB of\ A, S2 ® I B. SB). With this, the state shared by Alice’s and Bob’s registers is projected onto (up to some corrections on Bob’s side depending on the click pattern of the BSM):

[0326]

[0327] This is equals the Bell state |< >+)A, B for= t / v l + t2

[0328] With this, it can be seen that the RSP-single-click based protocol achieves the same functionality as the CAL19 protocol in the noiseless case, both can produce perfectly correlated bits for Alice and Bob. In order to claim that the RSP-single-click based protocol of the present disclosure can produce a secure key, the multi-photon contributions in the WCP used are taken into account. In the CAL19 this is taken into account using the test basis together with a decoy state method. In order to include a test basis, phase-randomizing the sources of Alice and Bob may be applied. And consider a set of different intensities for their pulses in order to also implement the decoy state method.

[0329] Appendix C2: Double-click

[0330] In this protocol, Alice and Bob may send out BB84 states. In the fictious entanglement-based protocol, for the Z basis, Alice and Bob start with a state:

[0331]

[0332] with

[0333]

[0334] where afand b are the creation operators for modes a and b (e.g., horizontal / vertical polarization, early / late time bin), respectively. For the X basis, Alice and Bob start with:

[0335]

[0336] As the server sends out a Bell state of the form

[0337]

[0338] a BSM is performed again with photon-number-resolving detectors, resulting in a perfect Bell state between the register A (B) and the node SA (SB). After this, entanglement can be swapped throughout the repeater chain, creating entanglement between A and B. Similarly tothe single-click case, the decoy state method may be implemented in the test basis, which in this case is the X basis.

[0339] Other variations to the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed invention, from a study of the drawings, the disclosure and the appended claims. In the claims, the word “comprising” does not exclude other elements or steps, and the indefinite article “a” or “an” does not exclude a plurality. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage. Any reference signs in the claims should not be construed as limiting the scope thereof.

Claims

CLAIMS1. A quantum network comprising at least one client node, at least one server node, and at least one measurement node, wherein the at least one client node is operatively coupled via a first quantum communication link with the at least one measurement node, and wherein the at least one server node is operatively coupled via a second quantum communication link with the at least one measurement node, wherein the at least one server node and the at least one client node are configured to transmit quantum states toward the measurement node for remote state preparation, wherein the at least one client node comprises a weak coherent pulse source for transmitting a first quantum state, wherein the at least one server node is configured to transmit a second quantum state, and wherein the server node and the client node are configured to receive heralding signals from the measurement node, wherein the measurement node is configured to transmit the heralding signals upon successfully detecting a quantum state in a single-click protocol, wherein said single-click protocol is defined by a successful detection event corresponding to the arrival of a single photon originating from either the first quantum state or the second quantum state at the measurement node, wherein the potential presence of both quantum states at the measurement node causes quantum interference that determines a final quantum state prepared on a memory qubit of the server node.

2. The quantum network according to claim 1,wherein the measurement node is configured to perform the single-click protocol, wherein the single-click protocol at the measurement node comprises:- receiving quantum states from the at least one client node and the at least one server node;- detecting a single photon event, defining a click, using a Bell-state measurement device; and- transmitting a heralding signal to the client node and the server node upon said detection.

3. The quantum network according to claim 1 or claim 2,wherein the server node is configured to perform the single-click protocol, wherein the single-click protocol at the server node comprises:- storing a single quantum state in a memory qubit;- emitting a quantum signal towards the measurement node;- receiving a heralding signal.

4. The quantum network according to any one of the preceding claims, wherein the first quantum communication link and the second quantum communication link are optical communication interfaces.

5. The quantum network according to any one of the preceding claims, wherein the at least one measurement node comprises a Bell state measurement device, thereby defining a bell state measurement station in the quantum network.

6. The quantum network according to claim 5, wherein the Bell-state measurement device comprises a beamsplitter and at least one single photon detector, the Bell-state measurement device preferably comprising an optical delay line, and more preferably comprising two single photon detectors.

7. The quantum network according to any one of the preceding claims, wherein the quantum network comprises at least one quantum repeater provided in between the at least one client node and the at least one server node8. The quantum network according to claim 7, wherein the at least one quantum repeater comprises a plurality of quantum repeaters arranged in a quantum repeater chain.

9. The quantum network according to claim 7 or claim 8, wherein the quantum repeater comprises:- at least one single photon source for emitting at least one photon;- at least two quantum memories, wherein one of the at least two quantum memories is configured to be entangled with the at least one photon;- at least one Bell-state measurement, BSM, device.

10. The quantum network according to any of the preceding claims, the quantum network being configured for quantum key distribution.

11. A server node for use in a quantum network according to any one of the claims 1-10, wherein the server node comprises:- at least one quantum memory qubit;- at least one photon source for emitting at least one photon;- a controller for preparing a qubit-photon entanglement between the quantum memory qubit and the at least one photon.

12. The server node according to claim 11, further comprising further quantum computing means for performing quantum computing on the one quantum memory qubit.

13. The server node according to claim 11 or claim 12, wherein the at least one photon source and the quantum memory are combined into one element.

14. The server node according to any one of the claim 11-13, wherein the at least one photon source is a single photon emitter.

15. A client node for use in a quantum network according to any one of the claims 1 -10, comprising:- at least one weak coherent pulse source.

16. The client node according to claim 15, wherein the weak coherent pulse source comprises a pulsed laser and preferably a neutral density, ND, filter.

17. A measurement node for use in a quantum network according to any one of the claims 1-10, wherein the measurement node is configured to perform the single-click protocol, wherein the measurement node comprises:a Bell-state measurement, BSM, device configured to receive quantum states from the at least one client node and the at least one server node, and further configured to detect a single photon event, defining a single-click;and wherein the measurement node is configured to transmit a heralding signal to the at least one client node and to the at least one server node upon said detection.

18. The measurement node according to claim 17, wherein the at least one photon source is a single photon source.

19. A method of employing a single-click protocol for remote state preparation, performed by a measurement node according to claim 17 or claim 18, the method comprising receiving quantum states from at least one client node and at least one server node, detecting a single photon event, defining a single-click, using a Bell-state measurement device, and transmitting a heralding signal to the at least one client node and to the at least one server node upon said detection.

20. A method for remote state preparation, performed by a client node according to claim 15 or claim 16, the method comprising emitting a pulse of light with an average photon number of less than 1, and receiving at least one heralding signal.

21. A method for remote state preparation, performed by a server node according to any one of the claims 11-14, comprising storing at least one quantum state in a memory qubit, emitting at least one quantum signal towards the measurement node, and receiving at least one heralding signal.

22. The method according to claim 21, wherein the steps of storing, emitting and receiving comprise storing one single quantum state, emitting one single quantum signal, and receiving one single heralding signal, respectively.