Quantum programming with mixed states
From MaRDI portal
Recommendations
Cites work
- A single quantum cannot be cloned
- Guarded commands, nondeterminacy and formal derivation of programs
- 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 1775384 (Why is no real title available?)
- Logical Reversibility of Computation
- Quantum entanglement: criteria and collective tests
- States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
Cited in
(13)- Proof rules for the correctness of quantum programs
- Probabilistic bisimulations for quantum processes
- Compiling quantum programs
- Control aspects of quantum computing using pure and mixed states
- Computing with highly mixed states (extended abstract)
- Computing with highly mixed states
- Reasoning about general quantum programs over mixed states
- scientific article; zbMATH DE number 1775384 (Why is no real title available?)
- Mimicking quantum mechanics using reactive programming
- qGCL
- scientific article; zbMATH DE number 5498842 (Why is no real title available?)
- Programming of channels in generalized probabilistic theories
- Quantum loop programs
This page was built for publication: Quantum programming with mixed states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864175)