Blind Quantum Research Articles

Blind Quantum Machine Learning with Quantum Bipartite Correlator.

Distributed quantum computing is a promising computational paradigm for performing computations that are beyond the reach of individual quantum devices. Privacy in distributed quantum computing is critical for maintaining confidentiality and protecting the data in the presence of untrusted computing nodes. In this Letter, we introduce novel blind quantum machine learning protocols based on the quantum bipartite correlator algorithm. Our protocols have reduced communication overhead while preserving the privacy of data from untrusted parties. We introduce robust algorithm-specific privacy-preserving mechanisms with low computational overhead that do not require complex cryptographic techniques. We then validate the effectiveness of the proposed protocols through complexity and privacy analysis. Our findings pave the way for advancements in distributed quantum computing, opening up new possibilities for privacy-aware machine learning applications in the era of quantum technologies.

Requirements for upgrading trusted nodes to a repeater chain over 900 km of optical fiber

Abstract We perform a numerical study of the distribution of entanglement on a real-world fiber grid connecting the German cities of Bonn and Berlin. The connection is realized using a chain of processing-node quantum repeaters spanning roughly 900 kilometers. Their placement is constrained by the fiber grid we consider, resulting in asymmetric links. We investigate how minimal hardware requirements depend on the target application, as well as on the number of repeaters in the chain. We find that requirements for blind quantum computing are markedly different than those for quantum key distribution, with the required coherence time being around two and a half times larger for the former. Further, we observe a trade-off regarding how target secret-key rates are achieved when using different numbers of repeaters: comparatively low-quality entangled states generated at a high rate are preferred for higher numbers of repeaters, whereas comparatively high-quality states generated at a lower rate are favored for lower numbers of repeaters. To obtain our results we employ an extensive simulation framework implemented using NetSquid, a discrete-event simulator for quantum networks. These are combined with an optimization methodology based on genetic algorithms to determine minimal hardware requirements.

Hardware requirements for trapped-ion-based verifiable blind quantum computing with a measurement-only client

Abstract In blind quantum computing (BQC), a user with a simple client device can perform a quantum computation on a remote quantum server such that the server cannot gain knowledge about the computation. Here, we numerically investigate hardware requirements for verifiable BQC using an ion trap as server and a distant measurement-only client. While the client has no direct access to quantum-computing resources, it can remotely execute quantum programs on the server by measuring photons emitted by the trapped ion. We introduce a numerical model for trapped-ion quantum devices in NetSquid, a discrete-event simulator for quantum networks. Using this, we determine the minimal hardware requirements on a per-parameter basis to perform the verifiable BQC protocol. We benchmark these for a five-qubit linear graph state, with which any single-qubit rotation can be performed, where client and server are separated by 50 km. Current state-of-the-art ion traps satisfy the minimal requirements on a per-parameter basis, but all current imperfections combined make it impossible to perform the blind computation securely over 50 km using existing technology. Using a genetic algorithm, we determine the set of hardware parameters that minimises the total improvements required, finding directions along which to improve hardware to reach our threshold error probability that would enable experimental demonstration. In this way, we lay a path for the near-term experimental progress required to realise the implementation of verifiable BQC over a 50 km distance.

Regularities and Anomalies in Neon Matrix Shifts of Hydrogen-Bonded O-H Stretching Fundamentals.

O-H bond stretching vibrations in hydrogen-bonded complexes embedded into cryogenic neon matrices are subtly downshifted from cold gas phase reference wavenumbers. To the extent that this shift is systematic, it enables neon matrices as more universally applicable spectroscopic benchmark environments for quantum chemical predictions. Outliers are indicative of either an assignment problem in one of the two cryogenic experiments or they reveal interesting dynamics or structural effects on the complexes as a function of the environment. We compile 6 literature-known pairs of experimental data in jet and neon matrix expansions and realize a 6-fold expansion of that number through targeted matrix isolation and/or slit jet expansion spectroscopy presented in this work. In many cases, the neon matrix shift is less than the uncertainty of the currently best-performing blind quantum chemical predictions for the gas phase, but in specific cases, it may exceed the currently achievable theoretical accuracy. Some evidence for a positive correlation of the matrix shift with the hydrogen bond shift is found, similar to observations for helium nanodroplets. Outliers in particular for water acting as a donor are discussed, and in a few cases they call for a future reinvestigation. Substantial improvement in the correlation of the matrix shift with the hydrogen bond shift is achieved for ketone monohydrates by removing a vibrational resonance. New insights into nitrile hydration isomerism are obtained, and the linear OH stretching spectrum of the jet-cooled ammonia-water complex is presented for the first time. Vibrational spectroscopy in weakly perturbing solid rare gas quantum matrices for the benchmarking of gas phase theory and future explicit theoretical treatments of the quantum matrix environment to better understand the outliers are both encouraged.

Flexible blind quantum computation with unnecessarily universal quantum servers

Blind quantum computation (BQC) allows clients with limited quantum capabilities to delegate their tasks to powerful quantum servers and still keep their inputs, algorithms, and outputs private. However, in the noisy intermediate-scale quantum (NISQ) era, quantum computers as servers only control limited number of qubits and are not powerful enough. In addition, each of current BQC models is usually suitable for only one type of users. Therefore, this paper offers a flexible BQC (BQCf for short) model for two types of users with different quantum capabilities where any one of two types of users can complete BQC tasks with the help of the other type of users and quantum servers. To be more specific, we propose two BQCf protocols by using the given model. In the first protocol, one user Alice only with the ability to prepare single-qubit states can realize BQC tasks by cooperating with another user Bob who is just capable of performing single-qubit measurements and a quantum server Charlie. Similarly in the second one, Bob can realize BQC tasks by cooperating with Alice and Charlie. In both protocols, the server Charlie only requires a quantum register of small size and performing CZ gates and thus it is unnecessary to be universal and may be less difficult to realize in the short run. Furthermore, both proposed protocols are verifiable, namely that the user can detect whether the server is honest. Finally, examples of the proposed protocols for implementing Deutsch’s algorithms are simulated through Qiskit framework to show their feasibility and correctness.

Half-blind quantum computation with operation teleportation

Blind quantum computation enables a client with limited quantum capabilities to delegate a powerful quantum computer for performing confidential quantum computation. This paper identifies a security loophole in the initial universal half-blind quantum computation protocol and resolves it using operation teleportation. Simultaneously, to minimize quantum resource consumption for both the client and the server, the proposed protocol relies on the universal gate set H, T, and CX, and only necessitates the client’s ability to prepare qubits in the eigenstates of Pauli gates X and Y or measure qubits based on these gates. Finally, a sample example is provided to illustrate the proposed protocol effectively.

Verifiable blind quantum computation over collective-noise

Blind quantum computation(BQC) is a new type of secure quantum computation. In the natural environment, the qubits used in BQC will inevitably be affected by the noise, and the client cannot guarantee the correctness of computational results when the server is dishonest. This paper proposes a verifiable BQC over collective-noise based on quantum error correction to solve these two problems. Furthermore, the proposed protocol needs to expand Alice’s quantum capabilities. The client makes single-qubit measurements on the qubits, encoded and transmitted by the server. As a result, they protect qubits used to compute and utilize single-qubits to verify.

Verifiable Blind Quantum Computing with Trapped Ions and Single Photons.

We report the first hybrid matter-photon implementation of verifiable blind quantum computing. We use a trapped-ion quantum server and a client-side photonic detection system networked via a fiber-optic quantum link. The availability of memory qubits and deterministic entangling gates enables interactive protocols without postselection-key requirements for any scalable blind server, which previous realizations could not provide. We quantify the privacy at ≲0.03 leaked classical bits per qubit. This experiment demonstrates a path to fully verified quantum computing in the cloud.

Single-server blind quantum computing model based on random order rearrangement

Single-server blind quantum computing model based on random order rearrangement

A novel quantum multiparty blind signature scheme based on χ state

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

Universal blind quantum computation with improved brickwork states

Universal blind quantum computation with improved brickwork states

Verifiable Blind Quantum Computation With Identity Authentication for Multi-Type Clients

Verifiable Blind Quantum Computation With Identity Authentication for Multi-Type Clients

Multi-client distributed blind quantum computation with the Qline architecture

Universal blind quantum computing allows users with minimal quantum resources to delegate a quantum computation to a remote quantum server, while keeping intrinsically hidden input, algorithm, and outcome. State-of-art experimental demonstrations of such a protocol have only involved one client. However, an increasing number of multi-party algorithms, e.g. federated machine learning, require the collaboration of multiple clients to carry out a given joint computation. In this work, we propose and experimentally demonstrate a lightweight multi-client blind quantum computation protocol based on a recently proposed linear quantum network configuration (Qline). Our protocol originality resides in three main strengths: scalability, since we eliminate the need for each client to have its own trusted source or measurement device, low-loss, by optimizing the orchestration of classical communication between each client and server through fast classical electronic control, and compatibility with distributed architectures while remaining intact even against correlated attacks of server nodes and malicious clients.

Robust and efficient verification of graph states in blind measurement-based quantum computation

Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. Measurement-based quantum computation (MBQC) is a promising approach for realizing BQC. To obtain reliable results in blind MBQC, it is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. However, previous verification protocols for this task are too resource-consuming or noise-susceptible to be applied in practice. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension in the adversarial scenario, which leads to a robust and efficient protocol for verifying the resource state in blind MBQC. Our protocol requires only local Pauli measurements and is thus easy to realize with current technologies. Nevertheless, it can achieve optimal scaling behaviors with respect to the system size and the target precision as quantified by the infidelity and significance level, which has never been achieved before. Notably, our protocol can exponentially enhance the scaling behavior with the significance level.

Requirements for a processing-node quantum repeater on a real-world fiber grid

We numerically study the distribution of entanglement between the Dutch cities of Delft and Eindhoven realized with a processing-node quantum repeater and determine minimal hardware requirements for verifiable blind quantum computation using color centers and trapped ions. Our results are obtained considering restrictions imposed by a real-world fiber grid and using detailed hardware-specific models. By comparing our results to those we would obtain in idealized settings, we show that simplifications lead to a distorted picture of hardware demands, particularly on memory coherence and photon collection. We develop general machinery suitable for studying arbitrary processing-node repeater chains using NetSquid, a discrete-event simulator for quantum networks. This enables us to include time-dependent noise models and simulate repeater protocols with cut-offs, including the required classical control communication. We find minimal hardware requirements by solving an optimization problem using genetic algorithms on a high-performance-computing cluster. Our work provides guidance for further experimental progress, and showcases limitations of studying quantum-repeater requirements in idealized situations.

Multi-agent blind quantum computation without universal cluster states

Blind quantum computation (BQC) protocols enable quantum algorithms to be executed on third-party quantum agents while keeping the data and algorithm confidential. The previous proposals for measurement-based BQC require preparing a highly entangled cluster state. In this paper, we show that such a requirement is not necessary. Our protocol only requires pre-shared Bell pairs between delegated quantum agents, and there is no requirement for any classical or quantum information exchange between agents during the execution. Our proposal requires fewer quantum resources than previous proposals by eliminating the need for a universal cluster state.

Semi-device-dependent blind quantum tomography

Extracting tomographic information about quantum states is a crucial task in the quest towards devising high-precision quantum devices. Current schemes typically require measurement devices for tomography that are a priori calibrated to high precision. Ironically, the accuracy of the measurement calibration is fundamentally limited by the accuracy of state preparation, establishing a vicious cycle. Here, we prove that this cycle can be broken and the dependence on the measurement device's calibration significantly relaxed. We show that exploiting the natural low-rank structure of quantum states of interest suffices to arrive at a highly scalable `blind' tomography scheme with a classically efficient post-processing algorithm. We further improve the efficiency of our scheme by making use of the sparse structure of the calibrations. This is achieved by relaxing the blind quantum tomography problem to the de-mixing of a sparse sum of low-rank matrices. We prove that the proposed algorithm recovers a low-rank quantum state and the calibration provided that the measurement model exhibits a restricted isometry property. For generic measurements, we show that it requires a close-to-optimal number of measurement settings. Complementing these conceptual and mathematical insights, we numerically demonstrate that robust blind quantum tomography is possible in a practical setting inspired by an implementation of trapped ions.

A Remote Quantum Error-Correcting Code Preparation Protocol on Cluster States

The blind quantum computation (BQC) protocol allows for privacy-preserving remote quantum computations. In this paper, we introduce a remote quantum error correction code preparation protocol for BQC using a cluster state and analyze its blindness in the measurement-based quantum computation model. Our protocol requires fewer quantum resources than previous methods, as it only needs weak coherent pulses, eliminating the need for quantum memory and limited quantum computing. The results of our theoretical analysis and simulations show that our protocol requires fewer quantum resources compared to non-coding methods with the same qubit error rate.

Blind quantum computation with a client performing different single-qubit gates

In the field of single-server blind quantum computation (BQC), a major focus is to make the client as classical as possible. To achieve this goal, we propose two single-server BQC protocols to achieve verifiable universal quantum computation. In these two protocols, the client only needs to perform either the gate T (in the first protocol) or the gates H and X (in the second protocol). With assistance from a single server, the client can utilize his quantum capabilities to generate some single-qubit states while keeping the actual state of these qubits confidential from others. By using these single-qubit states, the verifiable universal quantum computation can be achieved.

Rate reduction of blind quantum data compression with local approximations based on the unstable structure of quantum states

In this paper, we propose a new protocol for a data compression task, blind quantum data compression, with finite local approximations. The rate of blind data compression is susceptible to approximations even when the approximations are diminutive. This instability originates from the sensitivity of a structure of quantum states against approximations, which makes the analysis of blind compression in the presence of approximations intractable. In this paper, we constructed a protocol that takes advantage of the instability to reduce the compression rate substantially. Our protocol shows a significant reduction in rate for specific examples we examined. Moreover, we apply our methods to diagonal states, and propose two types of approximation methods in this special case. We perform numerical experiments and observe that one of these two approximation methods performs significantly better than the other. Thus, our analysis makes a first step toward general investigation of blind quantum data compression with the allowance of approximations towards further investigation of approximation-rate trade-off of blind quantum data compression.