Distributed Quantum Computation Research Articles

Bidirectional state transfer between superconducting and microwave-photon qubits by single reflection

The number of superconducting qubits contained in a single quantum processor is increasing steadily. However, to realize a truly useful quantum computer, it is inevitable to increase the number of qubits much further by distributing quantum information among distant processors using flying qubits. A key element towards this goal is a deterministic quantum interaction between superconducting-atom and propagating microwave-photon qubits. Here, we confirm the bidirectional state transfer between them, which completes by simply reflecting the photon at the atom. The averaged fidelity of the photon-to-atom (atom-to-photon) state transfer reaches 0.826 (0.801), limited mainly by the lifetime of the atom qubit. The present technology would be useful for future distributed quantum computation with superconducting qubits. Published by the American Physical Society 2024

All-optical spin access via a cavity-broadened optical transition in on-chip hybrid quantum photonics

Hybrid quantum photonic systems connect classical photonics to the quantum world and promise to deliver efficient light-matter quantum interfaces while leveraging the advantages of both, the classical and the quantum, subsystems. However, combining efficient, scalable photonics and solid-state quantum systems with desirable optical and spin properties remains a formidable challenge. In particular, the access to individual spin states and coherent mapping to photons remains unsolved for hybrid systems. In this paper, we demonstrate all-optical initialization and readout of the electron spin of a negatively charged silicon-vacancy center in a nanodiamond coupled to a silicon nitride photonic crystal cavity. We characterize relevant parameters of the coupled emitter-cavity system and determine the silicon-vacancy center’s spin-relaxation and spin-decoherence rate. Our results mark a key step towards the realization of a hybrid spin-photon interface based on silicon nitride photonics and the silicon-vacancy center’s electron spin in nanodiamonds with potential use for quantum networks, quantum communication, and distributed quantum computation. Published by the American Physical Society 2024

Low-cost nonlocal Toffoli gate in a linear quantum network topology

Although a Toffoli gate can be equivalently implemented using several single-qubit and two-qubit gates, it will consume much resource, two of which are nonlocal controlled-NOT (CNOT) gates acting on two non-adjacent nodes, especially in distributed quantum computation (DQC). We, for the first time, employ an ancillary qubit to construct a nonlocal Toffoli gate for DQC in linear network topology. The ancillary-qubit-based scheme needs fewer qubits, quantum gates, and entanglement states than that based on quantum teleportation scheme and the entanglement swapping scheme. We also analyze the performance of the three proposed schemes under different application scenarios, and present their pros and cons. Our work will help to implement DQC in noisy intermediate-scale quantum (NISQ) era.

Privacy-preserving quantum federated learning via gradient hiding

Distributed quantum computing, particularly distributed quantum machine learning, has gained substantial prominence for its capacity to harness the collective power of distributed quantum resources, transcending the limitations of individual quantum nodes. Meanwhile, the critical concern of privacy within distributed computing protocols remains a significant challenge, particularly in standard classical federated learning (FL) scenarios where data of participating clients is susceptible to leakage via gradient inversion attacks by the server. This paper presents innovative quantum protocols with quantum communication designed to address the FL problem, strengthen privacy measures, and optimize communication efficiency. In contrast to previous works that leverage expressive variational quantum circuits or differential privacy techniques, we consider gradient information concealment using quantum states and propose two distinct FL protocols, one based on private inner-product estimation and the other on incremental learning. These protocols offer substantial advancements in privacy preservation with low communication resources, forging a path toward efficient quantum communication-assisted FL protocols and contributing to the development of secure distributed quantum machine learning, thus addressing critical privacy concerns in the quantum computing era.

Superadiabatic-based shortcuts for the fast generation of multi-partite W states of distant transmon qubits

We propose an efficient scheme for the fast generating three-partite W states of distant transmon qubits. With the help of superadiabatic shortcuts technology, we construct shortcuts to adiabaticity (STA) passage. The Rabi frequencies of the designed driving pulses in the scheme can be expressed by the superpositions of Gaussian functions. These make our scheme more feasible in the experiment. Compare with the adiabatic case, we show that the preparation of the target state can be greatly accelerated. We analyze the influences of decoherent factors on the fidelity of W states, and numerical results show our proposal is suitable to generate high fidelity three-partite W states. In addition, the present scheme can also be generalized to prepare n-partite W states of distant transmon qubits. This work may useful applications for the realization of distributed quantum computation.

DECENTRALIZED QUANTUM COMPILATION FRAMEWORK: EMPOWERING DISTRIBUTED QUANTUM COMPUTING THROUGH MODULARITY

Quantum algorithms require large resources in terms of qubit number, much larger than those available with current NISQ processors. With the network and communication functionalities provided by the Quantum Internet, Distributed Quantum Computing (DQC) is considered as a scalable approach for increasing the number of available qubits for computational tasks. For DQC to be effective and efficient, a quantum compiler must find the best partitioning for the quantum algorithm and then perform smart remote operation scheduling to optimize EPR pair consumption. At the same time, the quantum compiler should also find the best local transformation for each partition. In this paper we present a modular quantum compilation framework for DQC that takes into account both network and device constraints and characteristics. We implemented and tested a quantum compiler based on the proposed framework with some circuits of interest, such as the VQE and QFT ones, considering different network topologies, with quantum processors characterized by heavy hexagon coupling maps. We also devised a strategy for remote scheduling that can exploit both TeleGate and TeleData operations and tested the impact of using either only TeleGates or both. The evaluation results show that TeleData operations may have a positive impact on the number of consumed EPR pairs, while choosing a more connected network topology helps reduce the number of layers dedicated to remote operations. Keywords— Distributed quantum computing (DQC), quantum compilation, quantum Internet

Near-term distributed quantum computation using mean-field corrections and auxiliary qubits

Distributed quantum computation is often proposed to increase the scalability of quantum hardware, as it reduces cooperative noise and requisite connectivity by sharing quantum information between distant quantum devices. However, such exchange of quantum information itself poses unique engineering challenges, requiring high gate fidelity and costly non-local operations. To mitigate this, we propose near-term distributed quantum computing, focusing on approximate approaches that involve limited information transfer and conservative entanglement production. We first devise an approximate distributed computing scheme for the time evolution of quantum systems split across any combination of classical and quantum devices. Our procedure harnesses mean-field corrections and auxiliary qubits to link two or more devices classically, optimally encoding the auxiliary qubits to both minimize short-time evolution error and extend the approximate scheme’s performance to longer evolution times. We then expand the scheme to include limited quantum information transfer through selective qubit shuffling or teleportation, broadening our method’s applicability and boosting its performance. Finally, we build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms. To characterize our technique, we introduce a non-linear perturbation theory that discerns the critical role of our mean-field corrections in optimization and may be suitable for analyzing other non-linear quantum techniques. This fragmented pre-training is remarkably successful, reducing algorithmic error by orders of magnitude while requiring fewer iterations.

Performing Distributed Quantum Calculations in a Multi-cloud Architecture Secured by the Quantum Key Distribution Protocol

Quantum computing (QC) is an emerging area that yearly improves and develops more advances in the number of qubits and the available infrastructure for public users. Nowadays, the main cloud service providers (CSP) are implementing different mechanisms to support access to their quantum computers, which can be used to perform small experiments, test hybrid algorithms and prove quantum theories. Recent research work have discussed the low capacity of using quantum computers in a single CSP to perform quantum computation that are needed to solve different experiments for real world problems. Thus, there are needs for computing powers in the form of qubits from multi-cloud environment. Quantum computing in a multi-cloud environment requires security of the communicating channels. A well known algorithm in quantum cryptography for this purpose is the quantum key distribution (QKD) protocol. This enables the sender and receiver of a message to know when a third party eavesdropped any data from the insecure quantum channel. To address the low capacity issue, this research develops and tests the use of heterogeneous quantum computers located on different CSP to distribute quantum calculations between them by leveraging the channel security provided by the QKD protocol. The achieved results show over 88.1% of correct distributed quantum computation results without error correction methods, 96.8% of correct distributed quantum computation results using error correction methods and over 98.8% correct authorisation detection in multi-cloud environments. This demonstrates that quantum calculations can be distributed between different CSP while securing the channel with the QKD protocol at the same time.

Distributed Quantum Computing via Integrating Quantum and Classical Computing

Distributed Quantum Computing via Integrating Quantum and Classical Computing

Virtual Quantum Resource Distillation.

Distillation, or purification, is central to the practical use of quantum resources in noisy settings often encountered in quantum communication and computation. Conventionally, distillation requires using some restricted "free" operations to convert a noisy state into one that approximates a desired pure state. Here, we propose to relax this setting by only requiring the approximation of the measurement statistics of a target pure state, which allows for additional classical postprocessing of the measurement outcomes. We show that this extended scenario, which we call "virtual resource distillation," provides considerable advantages over standard notions of distillation, allowing for the purification of noisy states from which no resources can be distilled conventionally. We show that general states can be virtually distilled with a cost (measurement overhead) that is inversely proportional to the amount of existing resource, and we develop methods to efficiently estimate such cost via convex and semidefinite programming, giving several computable bounds. We consider applications to coherence, entanglement, and magic distillation, and an explicit example in quantum teleportation (distributed quantum computing). This work opens a new avenue for investigating generalized ways to manipulate quantum resources.

Entanglement Purification with Quantum LDPC Codes and Iterative Decoding

Recent constructions of quantum low-density parity-check (QLDPC) codes provide optimal scaling of the number of logical qubits and the minimum distance in terms of the code length, thereby opening the door to fault-tolerant quantum systems with minimal resource overhead. However, the hardware path from nearest-neighbor-connection-based topological codes to long-range-interaction-demanding QLDPC codes is likely a challenging one. Given the practical difficulty in building a monolithic architecture for quantum systems, such as computers, based on optimal QLDPC codes, it is worth considering a distributed implementation of such codes over a network of interconnected medium-sized quantum processors. In such a setting, all syndrome measurements and logical operations must be performed through the use of high-fidelity shared entangled states between the processing nodes. Since probabilistic many-to-1 distillation schemes for purifying entanglement are inefficient, we investigate quantum error correction based entanglement purification in this work. Specifically, we employ QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing (DQC), e.g. for fault-tolerant Steane syndrome extraction. This protocol is applicable beyond the application of DQC since entanglement distribution and purification is a quintessential task of any quantum network. We use the min-sum algorithm (MSA) based iterative decoder with a sequential schedule for distilling 3-qubit GHZ states using a rate 0.118 family of lifted product QLDPC codes and obtain an input fidelity threshold of ≈0.7974 under i.i.d. single-qubit depolarizing noise. This represents the best threshold for a yield of 0.118 for any GHZ purification protocol. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of 3-qubit GHZ states to construct a scalable GHZ purification protocol.

Upper bounds for the clock speeds of fault-tolerant distributed quantum computation using satellites to supply entangled photon pairs

Upper bounds for the clock speeds of fault-tolerant distributed quantum computation using satellites to supply entangled photon pairs

The quantum internet: an efficient stabilizer states distribution scheme

Quantum networks are a fundamental component of quantum technologies, playing a pivotal role in advancing distributed quantum computing and laying the groundwork for the future quantum internet. They offer a scalable modular architecture for quantum chips and support infrastructure for measurement-based quantum computing. Furthermore, quantum networks serve as the backbone of the quantum internet, ensuring high levels of security. Notably, the advantages of quantum networks in communication are contingent upon entanglement distribution, which faces challenges such as high latency in protocols relying on Bell pair distribution and bipartite entanglement swapping. Additionally, algorithms designed for multipartite entanglement routing encounter intractability issues, rendering them unsolvable within polynomial time. In this paper, we explore a novel approach to distribute graph states in quantum networks, leveraging local quantum coding (LQC) isometries and multipartite states transfer. We also present single-use bounds for stabilizer states distribution. Analogous to network coding, these bounds are attainable when appropriate isometries and stabilizer codes are selected for relay nodes, resulting in reduced latency in entanglement distribution. We further demonstrate the protocol’s advantages across various network performance metrics.

Coherent light scattering from a telecom C-band quantum dot

Quantum networks have the potential to transform secure communication via quantum key distribution and enable novel concepts in distributed quantum computing and sensing. Coherent quantum light generation at telecom wavelengths is fundamental for fibre-based network implementations, but Fourier-limited emission and subnatural linewidth photons have so far only been reported from systems operating in the visible to near-infrared wavelength range. Here, we use InAs/InP quantum dots to demonstrate photons with coherence times much longer than the Fourier limit at telecom wavelength via elastic scattering of excitation laser photons. Further, we show that even the inelastically scattered photons have coherence times within the error bars of the Fourier limit. Finally, we make direct use of the minimal attenuation in fibre for these photons by measuring two-photon interference after 25 km of fibre, demonstrating finite interference visibility for photons emitted about 100,000 excitation cycles apart.

Entanglement-efficient bipartite-distributed quantum computing

In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by entanglement-assisted local operations and classical communication. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. To this end, we extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] implementing each nonlocal controlled-unitary gate locally with one maximally entangled pair to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally using one maximally entangled pair. In particular, two types of packing processes are introduced as the building blocks, namely the distributing processes and embedding processes. Each distributing process distributes corresponding gates locally with one entangled pair. The efficiency of entanglement is then enhanced by embedding processes, which merge two non-sequential distributing processes and hence save the entanglement cost. We show that the structure of distributability and embeddability of a quantum circuit can be fully represented by the corresponding packing graphs and conflict graphs. Based on these graphs, we derive heuristic algorithms for finding an entanglement-efficient packing of distributing processes for a given quantum circuit to be implemented by two parties. These algorithms can determine the required number of local auxiliary qubits in the DQC. We apply these algorithms for bipartite DQC of unitary coupled-cluster circuits and find a significant reduction of entanglement cost through embeddings. This method can determine a constructive upper bound on the entanglement cost for the DQC of quantum circuits.

Detection of network and genuine network quantum steering

The quantum network correlations play significant roles in long distance quantum communication, quantum cryptography and distributed quantum computing. Generally it is very difficult to characterize the multipartite quantum network correlations such as nonlocality, entanglement and steering. In this paper, we propose the network and the genuine network quantum steering models from the aspect of probabilities in the star network configurations. Linear and nonlinear inequalities are derived to detect the network and genuine network quantum steering when the central party performs one fixed measurement. We show that our criteria can detect more quantum network steering than that from the violation of the n-locality quantum networks. Moreover, it is shown that biseparable assemblages can demonstrate genuine network steering in the star network configurations.

Hyper-parallel nonlocal CNOT operation assisted by quantum-dot spin in a double-sided optical microcavity

Implementation of controlled-NOT (CNOT) operation between different nodes in a quantum communication network nonlocally plays an important role in distributed quantum computation. We present a protocol for implementation of hyper-parallel nonlocal CNOT operation via hyperentangled photons simultaneously entangled in spatial-mode and polarization degrees of freedom (DOFs) assisted by quantum-dot spin in a double-sided optical microcavity. The agent Alice lets photons traverse the double-sided optical microcavity sequentially and applies single-qubit measurements on the electron and the hyperentangled photon. The agent Bob first performs corresponding unitary operations according to Alice’s measurement results on his hyperentangled photon, and then lets photons traverse the double-sided optical microcavity sequentially and performs the single-qubit measurements on the electron and the hyperentangled photon. The hyper-parallel nonlocal CNOT operation can be implemented simultaneously in spatial-mode and polarization DOFs if Alice performs single-qubit operations in accordance with Bob’s measurement results. The protocol has the advantage of having high channel capacity for long-distance quantum communication by using a hyperentangled state as the quantum channel.

Variational quantum eigensolvers in the era of distributed quantum computers

Variational quantum eigensolvers in the era of distributed quantum computers

Deterministic Bell state measurement with a single quantum memory

Entanglements serve as a resource for any quantum information system and are deterministically generated or swapped by a joint measurement called complete Bell state measurement (BSM). The determinism arises from a quantum nondemolition measurement of two coupled qubits with the help of readout ancilla, which inevitably requires extra physical qubits. We here demonstrate a deterministic and complete BSM with only a nitrogen atom in a nitrogen-vacancy (NV) center in diamond as a quantum memory without relying on any carbon isotopes, which are the extra qubits, by exploiting electron‒nitrogen (14N) double qutrits at a zero magnetic field. The degenerate logical qubits within the subspace of qutrits on the electron and nitrogen spins are holonomically controlled by arbitrarily polarized microwave and radiofrequency pulses via zero-field-split states as the ancilla, thus enabling the complete BSM deterministically. Since the system works under an isotope-free and field-free environment, the demonstration paves the way to realize high-fidelity quantum repeaters for long-haul quantum networks and quantum interfaces for large-scale distributed quantum computers.

An integrated microwave-to-optics interface for scalable quantum computing.

Microwave-to-optics transduction is emerging as a vital technology for scaling quantum computers and quantum networks. To establish useful entanglement links between qubit processing units, several key conditions must be simultaneously met: the transducer must add less than a single quantum of input-referred noise and operate with high efficiency, as well as large bandwidth and high repetition rate. Here we present a design for an integrated transducer based on a planar superconducting resonator coupled to a silicon photonic cavity through a mechanical oscillator made of lithium niobate on silicon. We experimentally demonstrate its performance with a transduction efficiency of 0.9% with 1 μW of continuous optical power and a spectral bandwidth of 14.8 MHz. With short optical pulses, we measure the added noise that is limited to a few photons, with a repetition rate of up to 100 kHz. Our device directly couples to a 50 Ω transmission line and can be scaled to a large number of transducers on a single chip, laying the foundations for distributed quantum computing.