Computation with multiple CTCs of fixed length and width
From MaRDI portal
Publication:256423
DOI10.1007/s11047-012-9337-6zbMath1332.68051OpenAlexW2077512752MaRDI QIDQ256423
Abuzer Yakaryılmaz, A. C. Cem Say
Publication date: 9 March 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-012-9337-6
quantum automataclosed timelike curve (CTC)CTC-based computationdeterministic pushdown automatalimited nondeterminismpolynomial-time probabilistic and quantum algorithmspostselectionprobabilistic automata
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect state distinguishability and computational speedups with postselected closed timelike curves
- Unbounded-error quantum computation with small space bounds
- On probabilistic pushdown automata
- Nondeterminism and Boolean operations in pda's
- Pushdown automata with bounded nondeterminism and bounded ambiguity
- Two-way finite automata with quantum and classical states.
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
- Closed timelike curves make quantum and classical computing equivalent
- Quantum Computability
- Proving the Power of Postselection
- Quantum computing, postselection, and probabilistic polynomial-time
- Two-way pushdown automata
- Probabilistic automata
This page was built for publication: Computation with multiple CTCs of fixed length and width
