Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Foundations of Quantum Programming (Extended Abstract)

Mingsheng Ying

Published Jan 1, 2010• 6 citations
Publisher
DOI
10.1007/978-3-642-17164-2_2

Related papers

Foundations of Quantum Programming

Elsevier eBooks•Jan 1, 2024•9 citations

Foundations of Quantum Programming

Elsevier eBooks•Jan 1, 2016•93 citations

A Practical Specification Language for Automatic Quantum Program Verification

Wei-Lun Tsai, Yu‐Fang Chen, Ondřej Lengál

Abstract Hoare-style verification provides a principled foundation for reasoning about the correctness of quantum programs, but existing approaches do not allow fully automatic verification. While automata-based verification scales well when specifications are given directly as automata, prior frameworks incur exponential blow-up when translating high-level set-based assertions into automata, which severely limits practicality. We introduce an extended set-based specification language and a specification-to-automata translation algorithm whose complexity is linear in the number of qubits, enabled by controlled automaton construction and qubit reordering. The resulting compact automata enable fully automatic Hoare-style verification of fixed-qubit quantum programs at previously infeasible scales, while substantially improving expressiveness without compromising efficiency.

Lecture notes in computer science•Jan 1, 2026•0 citations

The Heisenberg Interpretation of Quantum Mechanics (Extended Abstract)

Armin Nikkhah Shirazi

This extended abstract was submitted to the "Foundations 2020: The 20th UK and European Conference on Foundations of Physics"

•Feb 2, 2019•0 citations

Foundational Design of Multi-Modal Typed Programming Language for Quantum-Classical Hybrid Computing System

Shota Arakaki, Masao Hirokawa

As quantum computing hardware advances toward practical implementation, the design of high-level programming languages for quantum-classical hybrid systems remains a critical challenge. Current quantum programming approaches lack unified abstractions that seamlessly integrate classical and quantum computation. This paper proposes a foundational framework for a high-level quantum-classical hybrid programming language based on multi-modal type theory. Our approach formulates quantum-classical hybrid computation as staged computation, where classical computation generates and executes quantum programs. We adapt type systems and operational semantics from prior research in classical staged computation to this framework. This research provides a theoretical foundation for implementing interpreters and compilers that uniformly handle both classical and quantum computation.

International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA)•Feb 5, 2026•0 citations

Quantum programming: From theories to implementations

Mingsheng Ying, Yuan Feng, Runyao Duan +2 more

Chinese Science Bulletin•May 31, 2012•12 citations
Abstract Hoare-style verification provides a principled foundation for reasoning about the correctness of quantum programs, but existing approaches do not allow fully automatic verification. While automata-based verification scales well when specifications are given directly as automata, prior frameworks incur exponential blow-up when translating high-level set-based assertions into automata, which severely limits practicality. We introduce an extended set-based specification language and a specification-to-automata translation algorithm whose complexity is linear in the number of qubits, enabled by controlled automaton construction and qubit reordering. The resulting compact automata enable fully automatic Hoare-style verification of fixed-qubit quantum programs at previously infeasible scales, while substantially improving expressiveness without compromising efficiency.
As quantum computing hardware advances toward practical implementation, the design of high-level programming languages for quantum-classical hybrid systems remains a critical challenge. Current quantum programming approaches lack unified abstractions that seamlessly integrate classical and quantum computation. This paper proposes a foundational framework for a high-level quantum-classical hybrid programming language based on multi-modal type theory. Our approach formulates quantum-classical hybrid computation as staged computation, where classical computation generates and executes quantum programs. We adapt type systems and operational semantics from prior research in classical staged computation to this framework. This research provides a theoretical foundation for implementing interpreters and compilers that uniformly handle both classical and quantum computation.