Pith. sign in

REVIEW 4 cited by

Design and synthesis of scalable quantum programs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.07372 v2 pith:UK67SZ7O submitted 2024-12-10 quant-ph

Tomer Goldfriend , Israel Reichental , Amir Naveh , Lior Gazit , Nadav Yoran , Ravid Alon , Shmuel Ur , Shahak Lahav
show 37 more authors
Eyal Cornfeld Avi Elazari Peleg Emanuel Dor Harpaz Tal Michaeli Nati Erez Lior Preminger Roman Shapira Erik Michael Garcell Or Samimi Sara Kisch Gil Hallel Gilad Kishony Vincent van Wingerden Nathaniel A. Rosenbloom Ori Opher Matan Vax Ariel Smoler Tamuz Danzig Eden Schirman Guy Sella Ron Cohen Roi Garfunkel Tali Cohn Hanan Rosemarin Ron Hass Klem Jankiewicz Karam Gharra Ori Roth Barak Azar Shahaf Asban Natalia Linkov Dror Segman Ohad Sahar Niv Davidson Nir Minerbi Yehuda Naveh
This is my paper
classification quant-ph
keywords quantumapproachprogramdesignessentialmethodsmodelprograms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity. The approach is based on the true abstraction of the problem. The quantum program is expressed in terms of a high-level model together with constraints and objectives on the final program. Advanced synthesis algorithms transform the model into a low-level quantum program that meets the user's specification and is directed at a stipulated hardware. This separation of description from implementation is essential for scale. The technology adapts electronic design automation methods to quantum computing, finding feasible implementations in a virtually unlimited functional space. The results show clear superiority over the compilation and transpilation methods used today. We expect that this technological approach will take over and prevail as quantum software become more demanding, complex, and essential.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. High-level quantum structured programs as quantum registers compositions

    quant-ph 2026-08 conditional novelty 6.0 of 10

    A formal framework for structured quantum programming where operations act on entire quantum registers, demonstrated by a quantum SMT solver prototype.

  2. Efficient Quantum Control via Automatic Control Skips

    quant-ph 2025-05 conditional novelty 6.0 of 10

    A generic algorithm automatically identifies conjugation-pair subcircuits that can skip control in quantum circuits, with an NP-hardness proof and a dynamic-programming approximation showing large practical reductions.

  3. Quantum Circuits for Quantum Spatial Search on $d$-Dimensional Lattices

    quant-ph 2026-07 conditional novelty 5.0 of 10

    Opposite directions are encoded so they differ in only the least significant coin qubit, letting the flip-flop shift's direction reversal be a single X gate in explicit lattice-search circuits.

  4. Implementation of a quantum linear solver for the Vlasov-Ampere equation

    quant-ph 2025-07 conditional novelty 4.0 of 10

    A Qmod/Classiq block-encoding circuit for the linearized Vlasov-Ampere system is implemented and benchmarked, with CX counts about two orders of magnitude below a rigid Qiskit baseline.

Pith tools