Entanglement-efficient bipartite-distributed quantum computing
- URL: http://arxiv.org/abs/2212.12688v3
- Date: Wed, 29 Nov 2023 01:33:52 GMT
- Title: Entanglement-efficient bipartite-distributed quantum computing
- Authors: Jun-Yi Wu, Kosuke Matsui, Tim Forrer, Akihito Soeda, Pablo
Andr\'es-Mart\'inez, Daniel Mills, Luciana Henaut, Mio Murao
- Abstract summary: In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit can be extended through distributed quantum computing.
To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol.
We extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally.
- Score: 1.2878452281783466
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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.
Related papers
- Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML)
At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
arXiv Detail & Related papers (2024-11-13T23:56:20Z) - Generalised Circuit Partitioning for Distributed Quantum Computing [0.30723404270319693]
This work introduces a graph-based formulation which allows joint optimisation of gate and state teleportation cost.
Using a basic genetic algorithm, improved performance over state-of-the-art methods is obtained in terms of both average e-bit cost and time scaling.
arXiv Detail & Related papers (2024-08-02T17:59:51Z) - Distributed Quantum Computing across an Optical Network Link [0.0]
We experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules.
We deterministically teleport a controlled-Z gate between two circuit qubits in separate modules, achieving 86% fidelity.
As photons can be interfaced with a variety of systems, this technique has applications extending beyond trapped-ion quantum computers.
arXiv Detail & Related papers (2024-06-30T21:32:10Z) - Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Compiler for Distributed Quantum Computing: a Reinforcement Learning Approach [6.347685922582191]
We introduce a novel compiler that prioritizes reducing the expected execution time by jointly managing the generation and routing of EPR pairs.
We present a real-time, adaptive approach to compiler design, accounting for the nature of entanglement generation and the operational demands of quantum circuits.
Our contributions are twofold: (i) we model the optimal compiler for DQC using a Markov Decision Process (MDP) formulation, establishing the existence of an optimal algorithm, and (ii) we introduce a constrained Reinforcement Learning (RL) method to approximate this optimal compiler.
arXiv Detail & Related papers (2024-04-25T23:03:20Z) - Circuit Knitting Faces Exponential Sampling Overhead Scaling Bounded by Entanglement Cost [5.086696108576776]
We show that the sampling overhead of circuit knitting is exponentially lower bounded by the exact entanglement cost of the target bipartite dynamic.
Our work reveals a profound connection between virtual quantum information processing via quasi-probability decomposition and quantum Shannon theory.
arXiv Detail & Related papers (2024-04-04T17:41:13Z) - Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems.
We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators.
The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
arXiv Detail & Related papers (2022-08-01T12:48:48Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - A dynamic programming approach for distributing quantum circuits by
bipartite graphs [1.3249509346606656]
Near-term large quantum computers are not able to operate as a single processing unit.
It is required to partition a quantum circuit into smaller parts, and then each part is executed on a small unit.
In this study, a dynamic programming algorithm is proposed to minimize the number of communications in a distributed quantum circuit.
arXiv Detail & Related papers (2020-05-03T11:08:37Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.