ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Quantum Compilation”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

quant-phcs.AReess.SYEmpiricalRecentOct 2, 2026

Compiling Together: High-Throughput Distributed Quantum Computing via Multi-Compilation

Yipei Liu, Sen Zhang, Zebo Yang, Lei Yang

This paper improves the efficiency of distributed quantum computing by concurrently executing multiple compilations of the same quantum circuit.

View →
cs.LOcs.PLTheoreticalRecentOct 26, 2026

Connecting Quantum Proof Systems and Hoare Logic

Liyi Li, Zoukarneini Difaizi Tagba, Alex Potanin

The paper presents a new approach to verifying quantum programs using classical automated verifiers.

View →
quant-phcs.DCTheoreticalRecentJul 25, 2026

A Resource Estimation Model for the Hardware-Software Co-Design of Distributed Quantum Architectures

Raymond P. H. Wu, Chathurika Ranaweera, Sutharshan Rajasegarar, Ria Rushin Joseph +2 more

This paper proposes an economic model to optimize the trade-off between entanglement distribution latency and decoherence time in distributed quantum computing.

View →
quant-phcs.AREmpiricalRecentJun 30, 2026

Lazy-Move Compilation for Neutral-Atom Quantum Computers via a Buffer-Relay Fabric

Chen Huang, Jingbo Wang, Zhemin Zhang, Ming Zhong +4 more

The paper introduces BRIDGE, a static buffer-relay fabric for neutral atom quantum computing that achieves higher total fidelity and lower execution time than existing methods by minimizing data motio…

View →
cs.LOcs.PLmath.FATheoreticalRecentJul 25, 2026

Reasoning about Continuous-Variable Quantum Systems

Tianshi Yu, Gilles Barthe, Minbo Gao, Mingsheng Ying +1 more

This paper develops a formal semantics and verification methods for a core continuous-variable quantum programming language, using closed positive quadratic forms as semantic predicates.

View →
quant-phcs.ETcs.SEEmpiricalRecentJun 15, 2026

How Many Shots Are Enough for a Quantum Circuit?

Giuseppe Bisicchia, Alessandro Bocci, Ernesto Pimentel, Antonio Brogi

This paper introduces IncrementalExecution, a novel online framework for optimising the number of shots needed to meet a target accuracy in quantum algorithms.

View →
quant-phcs.CCTheoreticalRecentOct 29, 2026

Clifford synthesis is NP-complete

Søren Fuglede Jørgensen

The paper proves that synthesizing a quantum circuit for a given Clifford operator using a specified amount of resources is NP-complete for several resource models.

View →
cs.PLcs.LOcs.SEEmpiricalRecentSep 28, 2026

Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction

Jingyu Ke, Jingyang Li, Guoqiang Li

Irene is a framework for equivalence checking of hybrid quantum programs.

View →
quant-phcs.SEEmpiricalRecentJul 27, 2026

Systematic Experiment Tracking in Quantum Software: A Case Study of Reservoir Computing with Error Mitigation

Otso Kinanen, Valter Uotila, Vlad Stirbu

This paper discusses experiment tracking in quantum software development, detailing its importance and presenting a case study.

View →
quant-phcs.DSTheoreticalRecentJun 29, 2026

Working with measurement-based computations on qudits

Piotr Mitosek, Miriam Backens

This paper simplifies the definition of qudit flow, a model of quantum computation, and improves its complexity to match qubit flows.

View →