Uniformity of quantum circuit families for error-free algorithms (Q1770403): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2004.12.020 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963604719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819589 / 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: Complexity limitations on quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / 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: Programmable Quantum Gate Arrays / 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: 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 / DOI
 
Property / DOI: 10.1016/J.TCS.2004.12.020 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:07, 11 December 2024

scientific article
Language Label Description Also known as
English
Uniformity of quantum circuit families for error-free algorithms
scientific article

    Statements

    Uniformity of quantum circuit families for error-free algorithms (English)
    0 references
    0 references
    0 references
    6 April 2005
    0 references
    Quantum computation
    0 references
    Complexity theory
    0 references
    Uniform circuit families
    0 references
    Zero-error algorithms
    0 references
    Exact algorithms
    0 references

    Identifiers

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