arXiv:2505.14519 · Quantum Science and Technology

Distributed quantum computing with black-box subroutines

Xiang Xu, Yuandong Liu, Sha Shi, Yun-Jiang Wang, Dongsheng Wang

Published Aug 1, 2025• 1 citation

Abstract

Abstract In this work, we propose a generic protocol of distributed quantum computing when there are arbitrary unknown subroutines. It can be applied to scale up quantum computing by connecting a few quantum chips together, to the estimation task of unknown parameters or processes for the reduction of circuit depth, and also to quantum cryptography to construct secure protocols. Our protocol builds upon a few techniques we develop, such as the oblivious quantum teleportation and control, which can circumvent quantum no-go theorems on the manipulation of unknown objects. Furthermore, we demonstrate that this protocol can be physically implemented using currently available quantum computing platforms. These results suggest that our framework could provide a foundation for developing more advanced quantum algorithms and protocols in the future.

DOI: 10.1088/2058-9565/adf6d5

Related papers

Implementing quantum control for unknown subroutines

Nicolai Friis, Vedran Dunjko, Wolfgang Dür +1 more

We present setups for the practical realization of adding control to unknown subroutines, supplementing the existing quantum optical scheme for black-box control with a counterpart for the quantum control of the ordering of sequences of operations. We also provide schemes to realize either task using trapped ions. These practical circumventions of recent no-go theorems are based on existing technologies. We argue that the possibility to add control to unknown operations in practice is a common feature of many physical systems. Based on the proposed implementations we discuss the apparent contradictions between theory and practice.

arXiv:1401.8128Physical Review AMar 13, 201499 citations

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.

Yehuda Lindell, Benny Pinkas B

Abstract. We show an efficient secure two-party protocol, based on Yao’s construction, which provides security against malicious adversaries. Yao’s original protocol is only secure in the presence of semi-honest adversaries. Security against malicious adversaries can be obtained by applying the compiler of Goldreich, Micali and Wigderson (the “GMW compiler”). However, this approach does not seem to be very practical as it requires using generic zero-knowledge proofs. Our construction is based on applying cut-and-choose techniques to the original circuit and inputs. Security is proved according to the ideal/real simulation paradigm, and the proof is in the standard model (with no random oracle model or common reference string assumptions). The resulting protocol is computationally efficient: the only usage of asymmetric cryptography is for running O(1) oblivious transfers for each input bit (or for each bit of a statistical security parameter, whichever is larger). Our protocol combines techniques from folklore (like cut-and-choose) along with new techniques for efficiently proving consistency of inputs. We remark that a naive implementation of the cut-and-choose technique with Yao’s protocol does not yield a secure protocol. This is the first paper to show how to properly implement these techniques, and to provide a full proof of security. Our protocol can also be interpreted as a constant-round black-box reduction of secure two-party com-putation to oblivious transfer and perfectly-hiding commitments, or a black-box reduction of secure two-party computation to oblivious transfer alone, with a number of rounds which is linear in a sta-tistical security parameter. These two reductions are comparable to Kilian’s reduction, which uses OT alone but incurs a number of rounds which is linear in the depth of the circuit [18]. 1

Jan 1, 20080 citations

Quantum Computation Security Protocol Based on Quantum Decoherence

Jincheng Zhang

This paper proposes a novel security protocol for distributed computation leveraging the phenomenon of quantum decoherence. The protocol aims to mitigate the risk of malicious participants interfering with the computation's outcome. It constructs a quantum computing network and employs quantum decoherence techniques to encrypt and verify the computation process, guaranteeing the integrity and security of the results. Unlike existing distributed computation security protocols that primarily rely on classical cryptography, which are vulnerable to attacks, this approach offers a fundamentally different defense mechanism based on the inherent properties of quantum mechanics. The core of the protocol resides in the unpredictable nature of quantum decoherence, making it significantly more resilient to adversarial manipulation. This research contributes to the emerging field of quantum-secured distributed computing, exploring a viable pathway for robust and secure computation across distributed quantum networks.

Sep 2, 20260 citations

Formalization of Quantum Protocols using Coq

Jaap Boender, Florian Kammüller, Rajagopal Nagarajan

Quantum Information Processing, which is an exciting area of research at the intersection of physics and computer science, has great potential for influencing the future development of information processing systems. The building of practical, general purpose Quantum Computers may be some years into the future. However, Quantum Communication and Quantum Cryptography are well developed. Commercial Quantum Key Distribution systems are easily available and several QKD networks have been built in various parts of the world. The security of the protocols used in these implementations rely on information-theoretic proofs, which may or may not reflect actual system behaviour. Moreover, testing of implementations cannot guarantee the absence of bugs and errors. This paper presents a novel framework for modelling and verifying quantum protocols and their implementations using the proof assistant Coq. We provide a Coq library for quantum bits (qubits), quantum gates, and quantum measurement. As a step towards verifying practical quantum communication and security protocols such as Quantum Key Distribution, we support multiple qubits, communication and entanglement. We illustrate these concepts by modelling the Quantum Teleportation Protocol, which communicates the state of an unknown quantum bit using only a classical channel.

arXiv:1511.01568Electronic Proceedings in Theoretical Computer ScienceNov 4, 201528 citations

A Distributed Architecture for Secure Delegated Quantum Computation

Shuquan Ma, Changhua Zhu, Dongxiao Quan +1 more

In this paper, we propose a distributed secure delegated quantum computation protocol, by which an almost classical client can delegate a (dk)-qubit quantum circuit to d quantum servers, where each server is equipped with a 2k-qubit register that is used to process only k qubits of the delegated quantum circuit. None of servers can learn any information about the input and output of the computation. The only requirement for the client is that he or she has ability to prepare four possible qubits in the state of (|0⟩+eiθ|1⟩)/2, where θ∈{0,π/2,π,3π/2}. The only requirement for servers is that each pair of them share some entangled states (|0⟩|+⟩+|1⟩|−⟩)/2 as ancillary qubits. Instead of assuming that all servers are interconnected directly by quantum channels, we introduce a third party in our protocol that is designed to distribute the entangled states between those servers. This would simplify the quantum network because the servers do not need to share a quantum channel. In the end, we show that our protocol can guarantee unconditional security of the computation under the situation where all servers, including the third party, are honest-but-curious and allowed to cooperate with each other.

EntropyJun 7, 20226 citations

Based on Multi-Variable Quantum Entanglement for Distributed Quantum Computing

Jincheng Zhang

This paper explores a novel approach to distributed quantum computing centered around leveraging multi-variable quantum entanglement. Traditional distributed quantum computing primarily relies on the entanglement of single qubits, which inherently limits computational power. This research proposes a framework that utilizes multi-variable entanglement to construct a more robust and powerful distributed quantum computing network. The core concept involves building a network of entangled quantum systems, facilitating the distributed computation of quantum algorithms. The theoretical foundation rests on the principles of entangled state manipulation and distributed quantum computation theory. We demonstrate that this approach offers a significant advancement over existing methods, potentially unlocking capabilities unattainable with single-qubit entanglement. The primary goal is to present a viable pathway toward scalable distributed quantum computation utilizing the inherent complexity of multi-variable entanglement. This work outlines the key components and theoretical underpinnings of this new paradigm, emphasizing its potential impact on future quantum computing architectures. ---

Aug 28, 20260 citations