The following pages link to Quantum complexity theory (Q5248467):
Displaying 50 items.
- Quantum computation with coherent spin states and the close Hadamard problem (Q291464) (← links)
- Analytical error analysis of Clifford gates by the fault-path tracer method (Q331869) (← links)
- Monoidal computer. I: Basic computability by string diagrams (Q385721) (← links)
- Computational complexity and applications of quantum algorithm (Q440659) (← links)
- Local random quantum circuits are approximate polynomial-designs (Q506483) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- The quadratic speedup in Grover's search algorithm from the entanglement perspective (Q663021) (← links)
- Reversible simulation of space-bounded computations (Q673645) (← links)
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm (Q726023) (← links)
- Quantum mechanics and computation (Q816791) (← links)
- Quantum loop programs (Q977174) (← links)
- The geometry of quantum learning (Q989901) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Recursive information transducers: Computation models (Q1288659) (← links)
- Testing the shift-equivalence of polynomials using quantum machines (Q1356318) (← links)
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870) (← links)
- On the simulation of quantum Turing machines. (Q1401393) (← links)
- New quantum algorithm for studying NP-complete problems (Q1422459) (← links)
- Quantum search on structured problems (Q1573936) (← links)
- Stochastic analog networks and computational complexity (Q1578510) (← links)
- Quantum computation based on retarded and advanced propagation. (Q1586917) (← links)
- A framework for structured quantum search. (Q1586960) (← links)
- Quantum model of computations: Underlying principles and achievements (Q1592007) (← links)
- Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) (← links)
- Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488) (← links)
- Circuit complexity in interacting QFTs and RG flows (Q1627371) (← links)
- Creating very true quantum algorithms for quantum energy based computing (Q1643461) (← links)
- A classical probability space exists for the measurement theory based on the truth values (Q1708034) (← links)
- Necessary and sufficient condition for quantum computing (Q1740946) (← links)
- Quantum communication based on an algorithm of determining a matrix (Q1740965) (← links)
- New quantum algorithm solving the NP complete problem (Q1760321) (← links)
- Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) (Q1798794) (← links)
- On the impossibility of interaction-free quantum sensing for small I/O bandwidth (Q1854387) (← links)
- Regular languages accepted by quantum automata (Q1854417) (← links)
- Quantum entanglement as a new information processing resource (Q1880335) (← links)
- Quantum algorithm for determining a complex number string (Q2010995) (← links)
- Improved BV-based quantum attack on block ciphers (Q2110996) (← links)
- Efficient computation of permanents, with applications to boson sampling and random matrices (Q2133747) (← links)
- Generalization of Deutsch's algorithm (Q2197057) (← links)
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer (Q2239688) (← links)
- Physics' evolution toward computing (Q2240987) (← links)
- Some theoretically organized algorithm for quantum computers (Q2300853) (← links)
- Quantum algorithm for the root-finding problem (Q2329950) (← links)
- A quantum algorithm for approximating the influences of Boolean functions and its applications (Q2355587) (← links)
- Kochen-Specker theorem as a precondition for quantum computing (Q2400205) (← links)
- Time evolution of complexity: a critique of three methods (Q2421658) (← links)
- Computational universes (Q2483574) (← links)
- Quantum learning Boolean linear functions w.r.t. product distributions (Q2677243) (← links)
- Quantum algorithms for the Goldreich-Levin learning problem (Q2684273) (← links)
- (Q2980972) (← links)
