An application of quantum finite automata to interactive proof systems
From MaRDI portal
Recommendations
- Implementation and Application of Automata
- Interactive proofs with quantum finite automata
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Constant-space quantum interactive proofs against multiple provers
- Quantum finite automata: a modern introduction
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 512803 (Why is no real title available?)
- scientific article; zbMATH DE number 2079870 (Why is no real title available?)
- scientific article; zbMATH DE number 1500664 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- Algebraic methods for interactive proof systems
- Algorithms and Computation
- Algorithms and Computation
- Characterizations of 1-Way Quantum Finite Automata
- Finite state verifiers I
- Finite state verifiers II
- Games against nature
- IP = PSPACE
- Interactive proof systems with polynomially bounded strategies
- Multi-oracle interactive protocols with constant space verifiers
- On the Power of Finite Automata with both Nondeterministic and Probabilistic States
- PSPACE has constant-round quantum interactive proof systems
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Parallel transport and ``quantum holonomy along density operators
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Polynomial time quantum computation with advice
- Quantum automata and quantum grammars
- Quantum computations: algorithms and error correction
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- Quantum theory, the Church–Turing principle and the universal quantum computer
- STACS 2004
- The Knowledge Complexity of Interactive Proof Systems
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Two-way finite automata with quantum and classical states.
- Undecidability on quantum finite automata
Cited in
(18)- Constant-space quantum interactive proofs against multiple provers
- Interactive proofs with quantum finite automata
- scientific article; zbMATH DE number 7104930 (Why is no real title available?)
- Modeling of RNA secondary structures using two-way quantum finite automata
- Exponentially more concise quantum recognition of non-RMM regular languages
- Lifting query complexity to time-space complexity for two-way finite automata
- Implementation and Application of Automata
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Quantum state complexity of formal languages
- Classically time-controlled quantum automata
- scientific article; zbMATH DE number 7378343 (Why is no real title available?)
- Complexity bounds of constant-space quantum computation
- On hybrid models of quantum finite automata
- Classical and quantum Merlin-Arthur automata
- One-way topological automata and the tantalizing effects of their topological features
- Constant-space, constant-randomness verifiers with arbitrarily small error
- State complexity of one-way quantum finite automata together with classical states
- Affine automata verifiers
This page was built for publication: An application of quantum finite automata to interactive proof systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015813)
