Pages that link to "Item:Q885683"
From MaRDI portal
The following pages link to Entropy and algorithmic complexity in quantum information theory (Q885683):
Displaying 9 items.
- Entropy and computation: the Landauer-Bennett thesis reexamined (Q280506) (← links)
- Quantum dynamical entropies and Gács algorithmic entropy (Q406106) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Entropy lower bounds for quantum decision tree complexity (Q1847373) (← links)
- Fiber entropy and algorithmic complexity of random orbits (Q2676615) (← links)
- COMPLEXITY, INFORMATION, ENERGY (Q3526535) (← links)
- (Q3679101) (← links)
- COMPLEXITY MEASURE: A QUANTUM INFORMATION APPROACH (Q4904811) (← links)
- On G\'acs' quantum algorithmic entropy (Q4997291) (← links)
