Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/9906095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primality testing and Abelian varieties over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle Quantum Computing / 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: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computations: algorithms and error correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4505574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / 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: A Fast Monte-Carlo Test for Primality / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:54, 4 June 2024

scientific article
Language Label Description Also known as
English
Computational complexity of uniform quantum circuit families and quantum Turing machines
scientific article

    Statements

    Computational complexity of uniform quantum circuit families and quantum Turing machines (English)
    0 references
    0 references
    0 references
    15 July 2002
    0 references
    quantum computation
    0 references
    complexity theory
    0 references
    quantum Turing machines
    0 references
    uniform quantum circuit families
    0 references
    universal quantum Turing machines
    0 references

    Identifiers