Distributed Quantum Computation Research Articles

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.

Realization of a Programmable Multipurpose Photonic Quantum Memory with Over-Thousand Qubit Manipulations

Quantum networks can enable various applications such as distributed quantum computing, long-distance quantum communication, and network-based quantum sensing with unprecedented performances. One of the most important building blocks for a quantum network is a photonic quantum memory which serves as the interface between the communication channel and the local functional unit. A programmable quantum memory which can process a large stream of flying qubits and fulfill the requirements of multiple core functions in a quantum network is still to be realized. Here we report a high-performance quantum memory which can simultaneously store 72 optical qubits carried by 144 spatially separated atomic ensembles and support up to a thousand consecutive write or read operations in a random access way, 2 orders of magnitude larger than the previous record. Because of the built-in programmability, this quantum memory can be adapted on demand for several functions. As example applications, we realize quantum queue, stack, and buffer which closely resemble the counterpart devices for classical information processing. We further demonstrate the storage and reshuffle of four entangled pairs of photonic pulses with probabilistic arrival time and arbitrary release order via the memory, which is an essential requirement for the realization of quantum repeaters and efficient routing in quantum networks. Realization of this multipurpose programmable quantum memory thus constitutes a key enabling building block for future large-scale fully functional quantum networks. Published by the American Physical Society 2024

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

Generating symmetry-protected long-range entanglement

Entanglement between spatially distant qubits is perhaps the most counterintuitive and vital resource for distributed quantum computing. However, despite a few special cases, there is no known general procedure to maximally entangle two distant parts of an interacting many-body system. Here we present a symmetry-based approach, whereby one applies several timed pulses to drive a system to a particular symmetry sector with maximal bipartite long-range entanglement. As a concrete example, we demonstrate how a simple sequence of on-site pulses on a qubit array can efficiently produce multiple stable nonlocal Bell pairs, realizable in present-day atomic and photonic experimental platforms. More generally, our approach paves a route for exotic state preparation by harnessing symmetry. For instance, we show how it allows the creation of long-sought-after superconducting η pairs in a repulsive Hubbard model. Published by the American Physical Society 2024

Efficient high-fidelity flying qubit shaping

Matter qubit to traveling photonic qubit conversion is the cornerstone of numerous quantum technologies such as distributed quantum computing, as well as several quantum internet and networking protocols. We formulate a theory for stimulated Raman emission which is applicable to a wide range of physical systems, including quantum dots, solid-state defects, and trapped ions, as well as various parameter regimes. We find the upper bound for the photonic pulse emission efficiency of arbitrary matter qubit states for imperfect emitters and show a path forward to optimizing the fidelity. Based on these results, we propose a paradigm shift from optimizing the drive to directly optimizing the temporal mode of the flying qubit using a closed-form expression. Protocols for the production of time-bin encoding and spin-photon entanglement are proposed. Furthermore, the mathematical idea to use input-output theory for pulses to absorb the dominant emission process into the coherent dynamics, followed by a non-Hermitian Schrödinger equation approach, has great potential for studying other physical systems. Published by the American Physical Society 2024

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.

GHZ distillation protocols in the presence of decoherence

In this paper, we introduce a novel heuristic approach designed to optimize the performance of Greenberger-Horne- Zeilinger (GHZ) creation and distillation protocols under decoherence. Our methodology converts these protocols into a practical set of instructions, demonstrating, through simulations, the production of higher-quality GHZ states than previously known protocols. This advancement contributes to the field of distributed quantum computing by addressing the need for high-quality entanglement required for operations between different quantum computers.

Frequency-tunable microwave quantum light source based on superconducting quantum circuits

A non-classical light source is essential for implementing a wide range of quantum information processing protocols, including quantum computing, networking, communication and metrology. In the microwave regime, propagating photonic qubits, which transfer quantum information between multiple superconducting quantum chips, serve as building blocks for large-scale quantum computers. In this context, spectral control of propagating single photons is crucial for interfacing different quantum nodes with varied frequencies and bandwidths. Here a deterministic microwave quantum light source was demonstrated based on superconducting quantum circuits that can generate propagating single photons, time-bin encoded photonic qubits and qudits. In particular, the frequency of the emitted photons can be tuned in situ as large as 200 MHz. Even though the internal quantum efficiency of the light source is sensitive to the working frequency, it is shown that the fidelity of the propagating photonic qubit can be well preserved with the time-bin encoding scheme. This work thus demonstrates a versatile approach to realizing a practical quantum light source for future distributed quantum computing.

Multichip multidimensional quantum networks with entanglement retrievability.

Quantum networks provide the framework for quantum communication, clock synchronization, distributed quantum computing, and sensing. Implementing large-scale and practical quantum networks relies on the development of scalable architecture and integrated hardware that can coherently interconnect many remote quantum nodes by sharing multidimensional entanglement through complex-medium quantum channels. We demonstrate a multichip multidimensional quantum entanglement network based on mass-manufacturable integrated-nanophotonic quantum node chips fabricated on a silicon wafer by means of complementary metal-oxide-semiconductor processes. Using hybrid multiplexing, we show that multiple multidimensional entangled states can be distributed across multiple chips connected by few-mode fibers. We developed a technique that can efficiently retrieve multidimensional entanglement in complex-medium quantum channels, which is important for practical uses. Our work demonstrates the enabling capabilities of realizing large-scale practical chip-based quantum entanglement networks.