Quantum Computability
From MaRDI portal
Recommendations
Cited in
(65)- Quantum algorithms for algebraic problems
- Improving direct state measurements by using rebits in real enlarged Hilbert spaces
- Computation with multiple CTCs of fixed length and width
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Quantum computing and quadratically signed weight enumerators
- Spread and asymmetry of typical quantum coherence and their inhibition in response to glassy disorder
- scientific article; zbMATH DE number 7104930 (Why is no real title available?)
- scientific article; zbMATH DE number 5968445 (Why is no real title available?)
- Polynomial time quantum computation with advice
- A new universal and fault-tolerant quantum basis
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- Classical simulation of quantum circuits by half Gauss sums
- Necessary and sufficient condition for quantum computing
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Uncountable classical and quantum complexity classes
- Complexity limitations on quantum computation
- Quantum zero-error algorithms cannot be composed
- Entropy and algorithmic complexity in quantum information theory
- Computational Complexity of Quantum Satisfiability
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- A common algebraic description for probabilistic and quantum computations
- PSPACE has constant-round quantum interactive proof systems
- Quantum algorithmic complexities and entropy
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Quantum branching programs and space-bounded nonuniform quantum complexity
- Nondeterministic unitary OBDDs
- On interpolating between quantum and classical complexity classes
- Complexity bounds of constant-space quantum computation
- Determining the equivalence for one-way quantum finite automata
- Quantum and classical complexity classes: Separations, collapses, and closure properties
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Classical Ising model test for quantum circuits
- A new connection between quantum circuits, graphs and the Ising partition function
- On the maximum-likelihood decoding problem
- Uniformity of quantum circuit families for error-free algorithms
- Debates with small transparent quantum verifiers
- Quantum state testing beyond the polarizing regime and quantum triangular discrimination
- scientific article; zbMATH DE number 1542832 (Why is no real title available?)
- ANALYSIS OF QUANTUM FUNCTIONS
- Problems and prospects for quantum computational speed-up
- One complexity theorist's view of quantum computing
- Quantum information distance
- Quantum finite automata: a modern introduction
- On the computational power of bounded error quantum Turing machines
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
- Necessary and Sufficient Conditions for Quantum Computation
- Interference as a computational resource: a tutorial
- Unconventional Computation
- Exact non-identity check is NQP-complete
- Real-valued affine automata compute beyond Turing machines
- Quantum computation by quantumlike systems
- COMPUTATIONICS AND QUANTUM ANALYSIS
- A classical proof system for quantum unsatisfiability, based on a matrix Nullstellensatz
- Quantum simulation from the bottom up: the case of rebits
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Theory of one-tape linear-time Turing machines
- A structured view on weighted counting with relations to counting, quantum computation and applications
- Quantum random access stored-program machines
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
- scientific article; zbMATH DE number 7250159 (Why is no real title available?)
- Circuit lower bounds for nondeterministic quasi-polytime from a new easy witness lemma
- Skepticism of quantum computing
This page was built for publication: Quantum Computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376180)
