Pages that link to "Item:Q1044836"
From MaRDI portal
The following pages link to Quantum implicit computational complexity (Q1044836):
Displaying 9 items.
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- An automated deductive verification framework for circuit-building quantum programs (Q2233453) (← links)
- QPCF: higher-order languages and quantum circuits (Q2331073) (← links)
- Formalization of metatheory of the Quipper quantum programming language in a linear logic (Q2331074) (← links)
- A higher-order characterization of probabilistic polynomial time (Q2343130) (← links)
- A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations (Q2401638) (← links)
- On session types and polynomial time (Q2971079) (← links)
- On quantum lambda calculi: a foundational perspective (Q2973238) (← links)
- $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations (Q2988843) (← links)
