THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY (Q3528819): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quantum Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Kolmogorov complexity based on classical descriptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithmic entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programmable Quantum Gate Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of uniform quantum circuit families and quantum Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can a Universal Quantum Computer Be Fully Quantum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative limits on the ability of a Maxwell demon to extract work from heat / rank
 
Normal rank

Latest revision as of 17:26, 28 June 2024

scientific article
Language Label Description Also known as
English
THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references