The following pages link to Quantum Complexity Theory (Q4376183):
Displaying 50 items.
- A search for quantum coin-flipping protocols using optimization techniques (Q263220) (← links)
- A new universal and fault-tolerant quantum basis (Q294808) (← links)
- Realization of a quantum gate using gravitational search algorithm by perturbing three-dimensional harmonic oscillator with an electromagnetic field (Q332007) (← links)
- Quantum entanglement and the communication complexity of the inner product function (Q387020) (← links)
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- On using probabilistic Turing machines to model participants in cryptographic protocols (Q391316) (← links)
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- The quantum query complexity of learning multilinear polynomials (Q436558) (← links)
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- Computing power of Turing machines in the framework of unsharp quantum logic (Q496026) (← links)
- Quantum Boolean image denoising (Q501140) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- The query complexity of order-finding (Q596296) (← links)
- Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
- The Fourier spectrum of critical percolation (Q617882) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Quantum Kolmogorov complexity and information-disturbance theorem (Q657557) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- Quantum counterfeit coin problems (Q714865) (← links)
- Note on a universal quantum Turing machine (Q717053) (← links)
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm (Q726023) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- Approximation of fuzzy context-free grammars (Q845326) (← links)
- The quantum setting with randomized queries for continuous problems (Q850543) (← links)
- Fiber optics protocols for quantum communication (Q851888) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Entropy and algorithmic complexity in quantum information theory (Q885683) (← links)
- A theoretical framework for quantum image representation and data loading scheme (Q893708) (← links)
- Quantum protocols for untrusted computations (Q924542) (← links)
- Quantum algorithm for SAT problem andquantum mutual entropy (Q930728) (← links)
- Representation-theoretical properties of the approximate quantum Fourier transform (Q937218) (← links)
- Approximation and universality of fuzzy Turing machines (Q954457) (← links)
- Machine semantics (Q959818) (← links)
- Quantum circuit oracles for abstract machine computations (Q960862) (← links)
- Quantum information cannot be split into complementary parts (Q973541) (← links)
- Quantum loop programs (Q977174) (← links)
- The geometry of quantum learning (Q989901) (← links)
- Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← 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)
- Weakly regular quantum grammars and asynchronous quantum automata (Q1013764) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency (Q1043325) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- Quantum lower bounds for the Goldreich-Levin problem (Q1045938) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- Exact results for accepting probabilities of quantum automata. (Q1401229) (← links)
