Compiling quantum programs
From MaRDI portal
Publication:2484067
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1612487 (Why is no real title available?)
- scientific article; zbMATH DE number 108185 (Why is no real title available?)
- scientific article; zbMATH DE number 605806 (Why is no real title available?)
- scientific article; zbMATH DE number 1495264 (Why is no real title available?)
- scientific article; zbMATH DE number 3383043 (Why is no real title available?)
- scientific article; zbMATH DE number 3109251 (Why is no real title available?)
- A single quantum cannot be cloned
- A universal two-bit gate for quantum computation
- Counterfactual computation
- Guarded commands, nondeterminacy and formal derivation of programs
- Normal form approach to compiler design
- Partial correctness for probabilistic demonic programs
- Probabilistic models for the guarded command language
- Quantum computational networks
- Quantum programming with mixed states
- Reasoning about faulty quantum programs
- Universality in quantum computation
Cited in
(8)- Generalised quantum weakest preconditions
- Termination of nondeterministic quantum programs
- Quantum fuzzy inference for knowledge base design in robust intelligent controllers
- A framework for quantum-classical cryptographic translation
- qGCL
- Quantum loop programs
- \(Qcompiler\): quantum compilation with the CSD method
- scientific article; zbMATH DE number 1612487 (Why is no real title available?)
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)