Pith. Sign in

RECORD

ScaffCC: Scalable Compilation and Analysis of Quantum Programs

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
Ali JavadiAbhari, Shruti Patil, Daniel Kudrow, Jeff Heckey, Alexey Lvov, Frederic T. Chong, Margaret Martonosi

Quantum Physics · Submitted 7 Jul 2015

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

The authors' main claim Our work focuses on bridging the gap between high-level quantum algorithm specifi- cations and low-level physical implementations, while providing good scalability to larger and more interesting problems

how it is stated · asserted 0.99 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1507.01902 (version 1)
Pith IDW3RIPUHI, Pith's permanent record of this paper and its review
CitationAlexey Lvov, Ali JavadiAbhari, Daniel Kudrow, Frederic T. Chong, Jeff Heckey, Margaret Martonosi, Shruti Patil. "ScaffCC: Scalable Compilation and Analysis of Quantum Programs." arXiv:1507.01902 (2015). https://pith.science/paper/W3RIPUHI
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-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,246 input tokens, $0.0002 reported.

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

The abstract, sentence by sentence

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

We present ScaffCC, a scalable compilation and analysis framework based on LLVM, which can be used for compiling quantum computing applications at the logical level. Drawing upon mature compiler technologies, we discuss similarities and differences between compilation of classical and quantum programs, and adapt our methods to optimizing the compilation time and output for the quantum case. Our work also integrates a reversible-logic synthesis tool in the compiler to facilitate coding of quantum circuits. Lastly, we present some useful quantum program analysis scenarios and discuss their implications, specifically with an elaborate discussion of timing analysis for critical path estimation. Our work focuses on bridging the gap between high-level quantum algorithm specifi- cations and low-level physical implementations, while providing good scalability to larger and more interesting problems

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 We present ScaffCC, a scalable compilation and analysis framework based on LLVM, which can be used for compiling quantum computing applications at the logical level. contribution 1.00 0.88 0.23 asserted 1.00
s1 Drawing upon mature compiler technologies, we discuss similarities and differences between compilation of classical and quantum programs, and adapt our methods to optimizing the compilation time and output for the quantum case. method 0.77 0.83 0.08 asserted 0.97
s2 Our work also integrates a reversible-logic synthesis tool in the compiler to facilitate coding of quantum circuits. contribution 0.70 0.90 0.05 asserted 1.00
s3 Lastly, we present some useful quantum program analysis scenarios and discuss their implications, specifically with an elaborate discussion of timing analysis for critical path estimation. contribution 0.97 0.86 0.10 asserted 0.99
s4 Our work focuses on bridging the gap between high-level quantum algorithm specifi- cations and low-level physical implementations, while providing good scalability to larger and more interesting problems contribution 0.66 0.77 0.35 asserted 0.99

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from argument 0.67.

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

We present ScaffCC, a scalable compilation and analysis framework based on LLVM, which can be used for compiling quantum computing applications at the logical level. Drawing upon mature compiler technologies, we discuss similarities and differences between compilation of classical and quantum programs, and adapt our methods to optimizing the compilation time and output for the quantum case. Our work also integrates a reversible-logic synthesis tool in the compiler to facilitate coding of quantum circuits. Lastly, we present some useful quantum program analysis scenarios and discuss their implications, specifically with an elaborate discussion of timing analysis for critical path estimation. Our work focuses on bridging the gap between high-level quantum algorithm specifi- cations and low-level physical implementations, while providing good scalability to larger and more interesting problems

Human review

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

How the literature uses it

3 arXiv papers cite this in 4 sentences

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

Papers citing it · 2 sentences without a confident label

Cites it as background 2 papers

Discussion

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