Network-assisted collective operations for efficient distributed quantum computing

• URL: http://arxiv.org/abs/2502.19118v1
• Date: Wed, 26 Feb 2025 13:13:13 GMT
• Title: Network-assisted collective operations for efficient distributed quantum computing
• Authors: I. F. Llovo, G. Díaz-Camacho, N. Costas, A. Gómez,
• Abstract summary: We propose protocols for the distribution of collective quantum operations between remote quantum processing units.<n>These protocols allow for collective multicontrolled and multitarget gates to be executed in network architectures similar to those used for high-performance computing.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose protocols for the distribution of collective quantum operations between remote quantum processing units (QPUs), a requirement for distributed quantum computing. Using only local operations and classical communication (LOCC), these protocols allow for collective multicontrolled and multitarget gates to be executed in network architectures similar to those used for high-performance computing. The types of gates that can be implemented following this scheme are discussed. The Bell pair cost for a single distributed multicontrolled gate is estimated, arriving to a single additional Bell pair over the theoretically optimal calculation with pre-shared entanglement, demonstrating better scalability when compared to current proposals based on entanglement swapping through a network, and bounds are calculated for general diagonal gates. A recipe is provided for the lumped distribution of gates such as arbitrarily-sized Toffoli and multicontrolled Z, and $R_{zz}(\theta)$ gates. Finally, we provide an exact implementation of a distributed Grover's search algorithm using this protocol to partition the circuit, with Bell pair cost growing linearly with the number of Grover iterations and the number of partitions.

Related papers

• Multi-Target Rydberg Gates via Spatial Blockade Engineering [47.582155477608445]
  Multi-target gates offer the potential to reduce gate depth in syndrome extraction for quantum error correction. We propose single-control-multi-target CZotimes N gates on a single-species neutral-atom platform. We synthesise smooth control pulses for CZZ and CZZZ gates, achieving fidelities of up to 99.55% and 99.24%, respectively.
  arXiv  Detail & Related papers  (2025-04-21T17:59:56Z)
• Efficient compilation of quantum circuits using multi-qubit gates [0.0]
  We present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit entangling gates. We numerically test our compilation and show that, compared to conventional realizations with two-qubit gates, our compilations improves the logarithm of quantum volume by $20%$ to $25%$.
  arXiv  Detail & Related papers  (2025-01-28T19:08:13Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Realization of Scalable Cirac-Zoller Multi-Qubit Gates [5.309268373861329]
  The universality in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits. Here, we take advantage of novel performance benefits of long ion chains to realize fully programmable and scalable high-fidelity Cirac-Zoller gates.
  arXiv  Detail & Related papers  (2023-01-18T14:34:24Z)
• Entanglement-efficient bipartite-distributed quantum computing [1.2878452281783466]
  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.
  arXiv  Detail & Related papers  (2022-12-24T08:45:44Z)
• Controlled Gate Networks Applied to Eigenvalue Estimation [0.28106259549258145]
  We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates.
  arXiv  Detail & Related papers  (2022-08-29T12:46:46Z)
• Scalable fast benchmarking for individual quantum gates with local twirling [1.7995166939620801]
  We propose a character-cycle benchmarking protocol and a character-average benchmarking protocol only using local twirling gates. We numerically demonstrate our protocols for a non-Clifford gate -- controlled-$(TX)$ and a Clifford gate -- five-qubit quantum error-correcting encoding circuit.
  arXiv  Detail & Related papers  (2022-03-19T13:01:14Z)
• Approaching the theoretical limit in quantum gate decomposition [0.0]
  We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
  arXiv  Detail & Related papers  (2021-09-14T15:36:22Z)
• 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)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.