Pages that link to "Item:Q2390250"
From MaRDI portal
The following pages link to Polynomial time quantum computation with advice (Q2390250):
Displaying 12 items.
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Quantum information and the PCP theorem (Q835644) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Amount of nonconstructivity in deterministic finite automata (Q1959651) (← links)
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) (Q2152096) (← links)
- Constant-space quantum interactive proofs against multiple provers (Q2252642) (← links)
- Multiple Usage of Random Bits in Finite Automata (Q2898066) (← links)
- Amount of Nonconstructivity in Finite Automata (Q3637360) (← links)
- Shadow Tomography of Quantum States (Q5130848) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
