The following pages link to Quantum Computability (Q4376180):
Displaying 50 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- A new universal and fault-tolerant quantum basis (Q294808) (← links)
- Improving direct state measurements by using rebits in real enlarged Hilbert spaces (Q822903) (← links)
- Entropy and algorithmic complexity in quantum information theory (Q885683) (← links)
- A new connection between quantum circuits, graphs and the Ising partition function (Q1007123) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Quantum zero-error algorithms cannot be composed (Q1014398) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Quantum computing and quadratically signed weight enumerators (Q1603471) (← links)
- Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) (← links)
- Necessary and sufficient condition for quantum computing (Q1740946) (← links)
- Uniformity of quantum circuit families for error-free algorithms (Q1770403) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- Complexity limitations on quantum computation (Q1961375) (← links)
- Quantum random access stored-program machines (Q2084736) (← links)
- Classical simulation of quantum circuits by half Gauss sums (Q2113488) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Uncountable realtime probabilistic classes (Q2400994) (← links)
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- (Q2980972) (← links)
- EXACT NON-IDENTITY CHECK IS NQP-COMPLETE (Q3057846) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- (Q3095822) (← links)
- Computational Complexity of Quantum Satisfiability (Q3177775) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- Quantum Algorithmic Complexities and Entropy (Q3567165) (← links)
- Quantum theory, the Church–Turing principle and the universal quantum computer (Q4212472) (← links)
- Necessary and Sufficient Conditions for Quantum Computation (Q4490496) (← links)
- COMPUTATIONICS AND QUANTUM ANALYSIS (Q4502830) (← links)
- (Q4520281) (← links)
- Quantum simulation from the bottom up: the case of rebits (Q4565125) (← links)
- Skepticism of quantum computing (Q4897689) (← links)
- Quantum information distance (Q5037882) (← links)
- (Q5121907) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- Classical Ising model test for quantum circuits (Q5131403) (← links)
- Revisiting the simulation of quantum Turing machines by quantum circuits (Q5160678) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)
- (Q5232904) (← links)
- ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
