Pith. sign in

Quantum Algorithms and Simulation for Parallel and Distributed Quantum Computing

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

A viable approach for building large-scale quantum computers is to interlink small-scale quantum computers with a quantum network to create a larger distributed quantum computer. When designing quantum algorithms for such a distributed quantum computer, one can make use of the added parallelization and distribution abilities inherent in the system. An added difficulty to then overcome for distributed quantum computing is that a complex control system to orchestrate the various components is required. In this work, we aim to address these issues. We explicitly define what it means for a quantum algorithm to be distributed and then present various quantum algorithms that fit the definition. We discuss potential benefits and propose a high-level scheme for controlling the system. With this, we present our software framework called Interlin-q, a simulation platform that aims to simplify designing and verifying parallel and distributed quantum algorithms. We demonstrate Interlin-q by implementing some of the discussed algorithms using Interlin-q and layout future steps for developing Interlin-q into a control system for distributed quantum computers.

fields

quant-ph 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Introducing the Quantum Economic Advantage Online Calculator

quant-ph · 2025-08-28 · conditional · novelty 5.0

An open-access web calculator forecasts when quantum computers will beat price-equivalent classical machines, and its robustness analysis shows Shor-style advantage dates are stable while Grover-style dates depend heavily on user assumptions.

citing papers explorer

Showing 1 of 1 citing paper.

  • Introducing the Quantum Economic Advantage Online Calculator quant-ph · 2025-08-28 · conditional · none · ref 12 · internal anchor

    An open-access web calculator forecasts when quantum computers will beat price-equivalent classical machines, and its robustness analysis shows Shor-style advantage dates are stable while Grover-style dates depend heavily on user assumptions.