Unconditional proofs of quantumness between small-space machines
From MaRDI portal
Cites work
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
- Automata and quantum computing
- Automaticity. I: Properties of a measure of descriptional complexity
- Classical verification of quantum computations
- Complexity of multi-head finite automata: origins and directions
- Computational Complexity
- Constant-space, constant-randomness verifiers with arbitrarily small error
- Delegating computation: interactive proofs for muggles
- Finite state verifiers I
- Finite state verifiers with constant randomness
- scientific article; zbMATH DE number 3860421 (Why is no real title available?)
- scientific article; zbMATH DE number 3765145 (Why is no real title available?)
- scientific article; zbMATH DE number 3278278 (Why is no real title available?)
- scientific article; zbMATH DE number 7651035 (Why is no real title available?)
- Interactive proof systems with polynomially bounded strategies
- IP = PSPACE
- Languages recognized by nondeterministic quantum finite automata
- Lower space bounds for randomized computation
- On lattices, learning with errors, random linear codes, and cryptography
- On the complexity of simulating space-bounded quantum computations
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Proposed experiment to test local hidden-variable theories
- Quantum Complexity Theory
- Quantum logspace computations are verifiable
- Real-time, constant-space, constant-randomness verifiers
- Succinctness of two-way probabilistic and quantum finite automata
- Two-way finite automata with quantum and classical states.
This page was built for publication: Unconditional proofs of quantumness between small-space machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874240)
