Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11128-008-0091-8 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099196844 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0511117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log Depth Circuits for Division and Related Problems / 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: On Relating Time and Space to Size and Depth / 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: Q3522362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3398949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES / 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: Uniformity of quantum circuit families for error-free algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Transition Functions of Quantum Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / 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: Q4941921 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11128-008-0091-8 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:42, 10 December 2024

scientific article
Language Label Description Also known as
English
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
scientific article

    Statements

    Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (English)
    0 references
    0 references
    0 references
    31 March 2009
    0 references
    Quantum computation
    0 references
    Complexity theory
    0 references
    Uniform circuit families
    0 references
    Turing machines
    0 references
    Finitely generated uniform quantum circuit families
    0 references

    Identifiers