Pith. Sign in

RECORD

Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Evan E. Dobbs, Robert Basmadjian, Alexandru Paler, Joseph S. Friedman

Quantum Physics · Submitted 26 Jun 2021

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.

how it is stated · asserted 0.62 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2106.13998 (version 1)
Pith IDYFQXYKCY, Pith's permanent record of this paper and its review
CitationAlexandru Paler, Evan E. Dobbs, Joseph S. Friedman, Robert Basmadjian. "Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network." arXiv:2106.13998 (2021). https://pith.science/paper/YFQXYKCY
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,184 input tokens.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.36 · human participants 0.02 · controlled comparison 0.04 · randomized assignment 0.01 · states quantitative result 0.06 · compares with prior results 0.08 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Predicting the optimum SWAP depth of a quantum circuit is useful because it informs the compiler about the amount of necessary optimization. Fast prediction methods will prove essential to the compilation of practical quantum circuits. In this paper, we propose that quantum circuits can be modeled as queuing networks, enabling efficient extraction of the parallelism and duration of SWAP circuits. To provide preliminary substantiation of this approach, we compile a quantum multiplier circuit and use a queuing network model to accurately determine the quantum circuit parallelism and duration. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Predicting the optimum SWAP depth of a quantum circuit is useful because it informs the compiler about the amount of necessary optimization. background 1.00 0.06 0.04 asserted 0.97
s1 Fast prediction methods will prove essential to the compilation of practical quantum circuits. background 0.89 0.05 0.06 asserted 0.56
s2 In this paper, we propose that quantum circuits can be modeled as queuing networks, enabling efficient extraction of the parallelism and duration of SWAP circuits. contribution 0.74 0.47 0.40 hedged possibility 0.57
s3 To provide preliminary substantiation of this approach, we compile a quantum multiplier circuit and use a queuing network model to accurately determine the quantum circuit parallelism and duration. method 0.45 0.96 0.22 asserted 0.90
s4 Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation. interpretation 0.88 0.52 0.38 asserted 0.62

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.99.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Predicting the optimum SWAP depth of a quantum circuit is useful because it informs the compiler about the amount of necessary optimization. Fast prediction methods will prove essential to the compilation of practical quantum circuits. In this paper, we propose that quantum circuits can be modeled as queuing networks, enabling efficient extraction of the parallelism and duration of SWAP circuits. To provide preliminary substantiation of this approach, we compile a quantum multiplier circuit and use a queuing network model to accurately determine the quantum circuit parallelism and duration. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites

Cites as background 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.