On the simulation of quantum Turing machines

Authors:
Marco Carpentieri
Affiliations:
Università di Salerno, 84081 Baronissi (SA), Italy
Venue:
Theoretical Computer Science
Year:
2003

Citing 9
Cited 0

Introduction to algorithms

Introduction to algorithms
Quantum complexity theory

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Computing

SIAM Journal on Computing
Relations Among Complexity Measures

Journal of the ACM (JACM)
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On the Language Accepted by Finite Reversible Automata

ICALP '87 Proceedings of the 14th International Colloquium, on Automata, Languages and Programming
Fault-tolerant quantum computation

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper studies properties of almost periodic sequences (also known as uniformly recursive).A sequence is almost periodic if for every finite string that ccurs infinitely many times in the sequence there exists a number m such that every segment ...