The following pages link to Quantum Complexity Theory (Q4376183):
Displaying 50 items.
- A generalisation of the phase kick-back (Q2693897) (← links)
- Local transition functions of quantum Turing machines (Q2720411) (← links)
- Quantum computation and NP-complete problems (Q2735169) (← links)
- On the computational power of bounded error quantum Turing machines (Q2735185) (← links)
- The space ``just above'' BQP (Q2800575) (← links)
- Partial observation of quantum Turing machines and a weaker well-formedness condition (Q2825346) (← links)
- Fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qubits (Q2837721) (← links)
- Time-space efficient simulations of quantum computations (Q2913801) (← links)
- Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ (Q2969880) (← links)
- On quantum lambda calculi: a foundational perspective (Q2973238) (← links)
- Universality of quantum Turing machines with deterministic control (Q2987040) (← links)
- Can a Quantum Computer Run the von Neumann Architecture? (Q3000932) (← links)
- An introduction to quantum annealing (Q3006161) (← links)
- Computational Depth Complexity of Measurement-Based Quantum Computation (Q3070975) (← links)
- Quantum matchgate computations and linear threshold gates (Q3076715) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Computational Complexity of Projected Entangled Pair States (Q3107793) (← links)
- Computational Complexity of Quantum Satisfiability (Q3177775) (← links)
- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm (Q3182964) (← links)
- On Halting Process of Quantum Turing Machine (Q3368408) (← links)
- Quantum computation and quantum information† (Q3375535) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- SOME REMARKS ON QUANTUM AUTOMATA (Q3401475) (← links)
- Quantum computing: beyond the limits of conventional computation† (Q3426225) (← links)
- Quantum Hamiltonian Complexity (Q3451340) (← links)
- Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification (Q3455200) (← links)
- THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY (Q3528819) (← links)
- A LOGIC FOR QUANTUM COMPUTATION AND CLASSICAL SIMULATION OF QUANTUM ALGORITHMS (Q3534214) (← links)
- SECOND QUANTIZED KOLMOGOROV COMPLEXITY (Q3536074) (← links)
- Temporally unstructured quantum computation (Q3561913) (← links)
- NMR Quantum Computing (Q3565465) (← links)
- Quantum Algorithmic Complexities and Entropy (Q3567165) (← links)
- Measurement-Based and Universal Blind Quantum Computation (Q3575028) (← links)
- Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (Q3591441) (← links)
- On a measurement-free quantum lambda calculus with classical control (Q3625676) (← links)
- DELETING A MARKED BASIS-STATE FROM AN EVEN SUPERPOSITION OF ALL BASIS-STATES WITH A SINGLE QUERY (Q3634177) (← links)
- ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS (Q3637941) (← links)
- Rapid solution of problems by quantum computation (Q4033175) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- Quantum algorithm for multivariate polynomial interpolation (Q4556869) (← links)
- Quantum simulation from the bottom up: the case of rebits (Q4565125) (← links)
- “Quantumness” versus “classicality” of quantum states and quantum protocols (Q4584402) (← links)
- The complexity of translationally invariant low-dimensional spin lattices in 3D (Q4599491) (← links)
- Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
- (Q4614114) (← links)
- Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels (Q4832727) (← links)
- Efficient discrete approximations of quantum gates (Q4832734) (← links)
- Realizable Hamiltonians for universal adiabatic quantum computers (Q4903123) (← links)
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy (Q4946417) (← links)
- Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer (Q4972864) (← links)
