A proof system for disjoint parallel quantum programs

DOI10.1016/j.tcs.2021.10.025zbMath1478.68047OpenAlexW3211906515MaRDI QIDQ2055965

Yuan Feng, Li Zhou, Yangjia Li, Ming Sheng Ying

Publication date: 1 December 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.10.025

zbMATH Keywords

entanglementparallel programsquantum programmingquantum Hoare logic

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Quantum computation (81P68) Logic in computer science (03B70) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Formal semantics of a classical-quantum language ⋮ Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs ⋮ Quantum random access stored-program machines

Uses Software

• Forest
• openQASM
• QPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toward automatic verification of quantum programs
• Verification of sequential and concurrent programs
• An axiomatic proof technique for parallel programs
• Proof rules for the correctness of quantum programs
• Parallel Quantum Computation and Quantum Codes
• Exact Quantum Algorithms for the Leader Election Problem
• Quantum entanglement
• Convergence and Decomposition for Tensor Products of Hilbert Space Operators
• A Logic for Formal Verification of Quantum Programs
• Proving the Correctness of Multiprocess Programs
• DYNAMIC QUANTUM LOGIC FOR QUANTUM PROGRAMS
• Towards a quantum programming language
• Quantum advantage with shallow circuits
• Efficient distributed quantum computing
• Quantum weakest preconditions
• LQP: the dynamic logic of quantum information

This page was built for publication: A proof system for disjoint parallel quantum programs