An application of quantum finite automata to interactive proof systems
type: Item
instance of: scholarly article
title: An application of quantum finite automata to interactive proof systems
zbMATH Open document ID: 1183.68350
author: Harumichi Nishimura
author: Tomoyuki Yamakami
published in: Journal of Computer and System Sciences
publication date: 2009-04-30T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 5550301
zbMATH Keywords: quantum finite automaton
zbMATH Keywords: quantum interactive proof system
zbMATH Keywords: quantum measurement
zbMATH Keywords: quantum circuit
MaRDI profile type: Publication
full work available at URL: j.jcss.2008.12.001
OpenAlex ID: W1959691716
cites work: Undecidability on quantum finite automata
cites work: STACS 2004
cites work: Two-way finite automata with quantum and classical states.
cites work: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines
cites work: Characterizations of 1-Way Quantum Finite Automata
cites work: Q4281496
cites work: On the Power of Finite Automata with both Nondeterministic and Probabilistic States
cites work: Interactive proof systems with polynomially bounded strategies
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Finite state verifiers I
cites work: Finite state verifiers II
cites work: Multi-oracle interactive protocols with constant space verifiers
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Q4471995
cites work: Q4506483
cites work: Quantum computations: algorithms and error correction
cites work: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
cites work: Algorithms and Computation
cites work: Quantum multi-prover interactive proof systems with limited prior entanglement.
cites work: Algebraic methods for interactive proof systems
cites work: Quantum automata and quantum grammars
cites work: Q2706552
cites work: Polynomial time quantum computation with advice
cites work: Games against nature
cites work: IP = PSPACE
cites work: Parallel transport and ``quantum holonomy'' along density operators
cites work: PSPACE has constant-round quantum interactive proof systems
cites work: Q4501686
DOI: 10.1016/J.JCSS.2008.12.001
description: scientific article; zbMATH DE number 5550301