Quantum alternation
From MaRDI portal
Recommendations
- Quantum alternation
- Quantum alternation: prospects and problems
- Quantum correlation swapping
- Quantum transformations
- Quantum Stochastics
- On alternating quantum walks
- Physical quantum algorithms
- ``Counterfactual quantum protocols
- Ancilla-approximable quantum state transformations
- Quantum retrodiction
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1335895 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- A context-free language which is not acceptable by a probabilistic automaton
- Alternation
- Computational Complexity
- Computer science -- theory and applications. 8th international computer science symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25--29, 2013. Proceedings
- Computing with new resources. Essays dedicated to Jozef Gruska on the occasion of his 80th birthday
- Debates with small transparent quantum verifiers
- Games against nature
- Languages recognized by nondeterministic quantum finite automata
- On the complexity of simulating space-bounded quantum computations
- Proving the power of postselection
- Quantum computing, postselection, and probabilistic polynomial-time
- Reachability in two-clock timed automata is PSPACE-complete
- Relationships between nondeterministic and deterministic tape complexities
- Space-bounded quantum complexity
- Superiority of exact quantum automata for promise problems
- The Knowledge Complexity of Interactive Proof Systems
- The complexity of two-player games of incomplete information
- Time-space efficient simulations of quantum computations
- Unbounded-error quantum computation with small space bounds
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
Cited in
(3)
This page was built for publication: Quantum alternation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361668)
