Compiling quantum programs

DOI10.1007/S00236-005-0165-3zbMath1079.68020OpenAlexW2072765545MaRDI QIDQ2484067

Paolo Zuliani

Publication date: 2 August 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-005-0165-3

zbMATH Keywords

quantum guarded-command language

Mathematics Subject Classification ID

Quantum computation (81P68) Theory of compilers and interpreters (68N20)

Related Items (6)

Termination of nondeterministic quantum programs ⋮ A framework for quantum-classical cryptographic translation ⋮ Quantum loop programs ⋮ Generalised quantum weakest preconditions ⋮ Quantum fuzzy inference for knowledge base design in robust intelligent controllers ⋮ qGCL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning about faulty quantum programs
• Normal form approach to compiler design
• Probabilistic models for the guarded command language
• Counterfactual computation
• Quantum Programming With Mixed States
• Quantum computational networks
• Guarded commands, nondeterminacy and formal derivation of programs
• Universality in quantum computation
• A universal two-bit gate for quantum computation
• A single quantum cannot be cloned
• Partial correctness for probabilistic demonic programs

This page was built for publication: Compiling quantum programs