Compiling quantum programs

DOI10.1007/S00236-005-0165-3zbMATH Open1079.68020OpenAlexW2072765545MaRDI QIDQ2484067FDOQ2484067

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)

Cites Work

• Quantum programming with mixed states
• A single quantum cannot be cloned
• Quantum computational networks
• Guarded commands, nondeterminacy and formal derivation of programs
• A universal two-bit gate for quantum computation
• Probabilistic models for the guarded command language
• Universality in quantum computation
• Partial correctness for probabilistic demonic programs
• Normal form approach to compiler design
• Counterfactual computation
• Reasoning about faulty quantum programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• A framework for quantum-classical cryptographic translation
• Generalised quantum weakest preconditions
• Termination of nondeterministic quantum programs
• Quantum fuzzy inference for knowledge base design in robust intelligent controllers
• Title not available (Why is that?)
• qGCL
• Quantum loop programs

This page was built for publication: Compiling quantum programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484067)