Cristopher Moore, James P. Crutchfield  Home/Search
Context Related
| santafe.edu/pub/moore/qrl.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: santafe.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of nite-state and push-down automata, and regular and context-free grammars. We nd analogs of several classical theorems, including pumping lemmas, closure properties, rational and algebraic generating functions, and Greibach normal form. We also show that there are quantum context-free languages that are not context-free, ... (Update)
Context of citations to this paper: More
...some questions for further work. Parsing classical context free languages is in NC. Quantum context free languages have been defined in [6]. Is quantum parsing, i.e. producing derivation trees with the appropriate amplitudes, in QNC Can circuits for quantum error correction...
Cited by: More
Quantum Computation: Theory and Implementation - Boyden, III (1999) (Correct)
Some Notes on Parallel Quantum Computation - Moore, Nilsson (1998) (Correct)
Similar documents (at the sentence level):
58.0%: Quantum Automata and Quantum Grammars - Moore, Crutchfield (Correct)
Active bibliography (related documents): More All
0.3: Space-Efficient Deterministic Simulation of Probabilistic Automata - Macarie (1993) (Correct)
0.3: Queues, Stacks, and Transcendentality at the Transition to Chaos - Moore, Lakdawala (Correct)
0.3: Computational Mechanics - Leskelä (2002) (Correct)
Similar documents based on text: More All
0.4: Decidable and Undecidable Problems about Quantum Automata - Blondel, Jeandel, Koiran, .. (Correct)
0.2: Grammars with Generalized Contextfree Rules and Their Tree Automata - Volger (1999) (Correct)
0.1: On Patterns and Graphs - Mayoh (Correct)
Related documents from co-citation: More All
2: Elementary gates for quantum computation - Adriano, Bennett et al. - 1995
BibTeX entry: (Update)
C. Moore and J.P. Crutchfield, "Quantum automata and quantum grammars." quant-ph/9707031, submitted to Theoretical Computer Science. http://citeseer.ist.psu.edu/367142.html More
@article{ moore00quantum,
author = "Cristopher Moore and James P. Crutchfield",
title = "Quantum automata and quantum grammars",
journal = "Theoretical Computer Science",
volume = "237",
number = "1--2",
pages = "275--306",
year = "2000",
url = "citeseer.ist.psu.edu/367142.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
249 Molecular computation of solutions to combinatorial problems - Adleman - 1994
213 a theory of computation and complexity over the real numbers.. (context) - Blum, Shub et al. - 1989
197 Transductions and Context-Free Languages (context) - Berstel - 1978
168 Algorithms for quantum computation: discrete logarithms and .. - Shor - 1994
118 the Church-Turing principle and the universal quantum comput.. (context) - Deutsch, theory - 1985
73 Introduction to probabilistic automata (context) - Paz - 1971
61 Analog Computation Via Neural Networks - Siegelmann, Sontag - 1994
46 Quantum computations with cold trapped ions (context) - Cirac, Zoller - 1995
45 Fault-tolerant quantum computation - Shor - 1996
39 The evolution of emergent computation - Crutcheld, Mitchell - 1995
37 A potentially realizable quantum computer (context) - Lloyd - 1993
37 Analytic models and ambiguity of context-free languages (context) - Flajolet - 1987
34 Probabilistic automata (context) - Rabin - 1963
30 Bulk spin-resonance quantum computation - Gershenfeld, Chuang - 1997
29 Dynamical recognizers: real-time language recognition by ana.. - Moore - 1998
27 EATCS Monographs on Theoretical Computer Science (context) - Kuich, Salomaa et al. - 1986
15 The complexity of language recognition by neural networks (context) - Siegelmann, Sontag et al. - 1992
14 Quantum mechanical Hamiltonian models of Turing machines tha.. (context) - Benio - 1982
10 The linguistics of DNA (context) - Searls - 1992
8 Recent Methods for RNA Modeling Using Stochastic Context-Fre.. - Sakakibara, Brown et al. - 1994
8 Closure properties of stochastic languages (context) - Macarie - 1993
7 the power of quantum nite state automata - Kondacs, Watrous - 1997
7 A decision procedure for unitary linear quantum cellular aut.. (context) - urr, Santha - 1996
4 Real-time denable languages (context) - Rosenberg - 1967
4 The calculi of emergence: computation (context) - Crutcheld - 1994
4 the representability of events in probabilistic automata (context) - Bukharaev - 1967
4 personal communication (context) - Diablo
3 Reconstruction of gauge potentials from Wilson loops (context) - Giles - 1981
3 Theory and Algorithms for Hidden Markov Models and Generaliz.. (context) - Upper - 1997
3 breadth-rst grammars and their relations (context) - Cherubini, Citrini et al. - 1991
2 A Modern Approach to Quantum Mechanics (context) - Townsend - 1992
2 On stochastic languages (context) - Turakainen - 1968
2 Probabilistic languages and automata (context) - Ellis - 1969
1 and quantum state synthesis (context) - Steane, stabilization et al. - 1997
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.santafe.edu.html): More
ECA 18 Temporal Decay - Crutchfield, Hanson (Correct)
Stochastic Modeling and Optimization of Phage Display - Levitan (1997) (Correct)
An Agent Based Model for the Study of Publicity/consumer Dynamics. - Prieto (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC