Interactive proofs with quantum finite automata (Q2513604): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969389934 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113863226 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.2929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Finite Automata with both Nondeterministic and Probabilistic States / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of quantum finite automata to interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE has constant-round quantum interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501686 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:06, 9 July 2024

scientific article
Language Label Description Also known as
English
Interactive proofs with quantum finite automata
scientific article

    Statements

    Interactive proofs with quantum finite automata (English)
    0 references
    0 references
    0 references
    28 January 2015
    0 references
    finite automaton
    0 references
    interactive proof system
    0 references
    quantum computing
    0 references
    classical prover
    0 references
    quantum prover
    0 references
    interaction
    0 references

    Identifiers