Quantum computation with write-only memory (Q1761714): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Quantum Computation with Devices Whose Contents Are Never Read
description / endescription / en
scientific article
scientific article; zbMATH DE number 5761574
Property / title
 
Quantum Computation with Devices Whose Contents Are Never Read (English)
Property / title: Quantum Computation with Devices Whose Contents Are Never Read (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1286.68148 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-13523-1_18 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
26 July 2010
Timestamp+2010-07-26T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 26 July 2010 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 81P68 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5761574 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098706366 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1615715904 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.1201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the nondeterministic space complexity of context-free recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable and Undecidable Problems about Quantum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending stochastic and quantum functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new family of nonstochastic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Various Aspects of Finite Quantum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the equivalence for one-way quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A context-free language which is not acceptable by a probabilistic automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with sublogarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of simulating space-bounded quantum computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probability amplification in two-way quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3171611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way probabilistic reversible and quantum one-counter automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum versus deterministic counter automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:58, 5 July 2024

scientific article; zbMATH DE number 5761574
  • Quantum Computation with Devices Whose Contents Are Never Read
Language Label Description Also known as
English
Quantum computation with write-only memory
scientific article; zbMATH DE number 5761574
  • Quantum Computation with Devices Whose Contents Are Never Read

Statements

Quantum computation with write-only memory (English)
0 references
Quantum Computation with Devices Whose Contents Are Never Read (English)
0 references
0 references
0 references
0 references
0 references
15 November 2012
0 references
26 July 2010
0 references
quantum computation
0 references
write-only memory
0 references
quantum finite automata
0 references
counter automata
0 references
quantum Fourier transform
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references