Space-bounded quantum complexity (Q1961378)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Space-bounded quantum complexity	scientific article

Statements

scholarly article

0 references

Space-bounded quantum complexity (English)

0 references

0 references

Journal of Computer and System Sciences

0 references

publication date

6 November 2000

0 references

zbMATH Keywords

space-bounded quantum Turing machines

0 references

MaRDI profile type

MaRDI publication profile

0 references

Relationships among $PL$, $\#L$, and the determinant

0 references

Logical Reversibility of Computation

0 references

Time/Space Trade-Offs for Reversible Computation

0 references

Quantum Complexity Theory

0 references

Oracle Quantum Computing

0 references

On Relating Time and Space to Size and Depth

0 references

Parallel computation for well-endowed rings and space-bounded probabilistic machines

0 references

Reversible simulation of space-bounded computations

0 references

Quantum theory, the Church–Turing principle and the universal quantum computer

0 references

Rapid solution of problems by quantum computation

0 references

Computational Complexity of Probabilistic Turing Machines

0 references

The Kantorovich and Some Related Inequalities

0 references

0 references

Space-bounded hierarchies and probabilistic computations

0 references

0 references

0 references

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

0 references

On the Power of Quantum Computation

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1961378

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1961378&oldid=34233469"