On the simulation of quantum Turing machines. (Q1401393): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum mechanical Hamiltonian models of 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: Mixed-state entanglement and quantum error correction / 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 Computers, Factoring, and Decoherence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Hilbert space and quantum logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / 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: Q3247887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Among Complexity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5614773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5612183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demonstration of a Fundamental Quantum Logic Gate / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lattice Point Covering Theorem for Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network complexity and the Turing machine complexity of finite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizable Universal Quantum Logic Gates / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:52, 6 June 2024

scientific article
Language Label Description Also known as
English
On the simulation of quantum Turing machines.
scientific article

    Statements

    On the simulation of quantum Turing machines. (English)
    0 references
    0 references
    17 August 2003
    0 references
    0 references
    0 references
    0 references
    0 references