Quantum implicit computational complexity (Q1044836): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4936120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed Lambda Calculi and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus, its syntax and semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a measurement-free quantum lambda calculus with classical control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computational networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality in quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum programming languages: survey and bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft linear logic and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / 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: Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3445918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An arithmetic for polynomial-time computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional and Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a quantum programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lambda calculus for quantum computation with classical control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light affine lambda calculus and polynomial time strong normalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lambda Calculus for Quantum Computation / rank
 
Normal rank

Latest revision as of 07:48, 2 July 2024

scientific article
Language Label Description Also known as
English
Quantum implicit computational complexity
scientific article

    Statements

    Quantum implicit computational complexity (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum computation
    0 references
    implicit computational complexity
    0 references
    lambda calculus
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references