The following pages link to Quantum Complexity Theory (Q4376183):
Displaying 50 items.
- Exact results for accepting probabilities of quantum automata. (Q1401229) (← links)
- Hypercomputation with quantum adiabatic processes (Q1434370) (← links)
- Quantum computing and quadratically signed weight enumerators (Q1603471) (← links)
- Quantum neural networks (Q1604195) (← links)
- Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) (← links)
- Simplified proof of the Fourier sampling theorem (Q1607051) (← links)
- Physical quantum algorithms (Q1613778) (← links)
- Simulating fermions on a quantum computer (Q1613779) (← links)
- Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488) (← links)
- Creating very true quantum algorithms for quantum energy based computing (Q1643461) (← links)
- Quantum algorithm to solve function inversion with time-space trade-off (Q1674561) (← links)
- Nonadaptive quantum query complexity (Q1675876) (← links)
- Quantum arithmetic with the quantum Fourier transform (Q1679367) (← links)
- The complexity of translationally invariant spin chains with low local dimension (Q1683948) (← links)
- Quantum cryptography based on the Deutsch-Jozsa algorithm (Q1685724) (← links)
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms (Q1700378) (← links)
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment (Q1701186) (← links)
- An improved filtering method for quantum color image in frequency domain (Q1703514) (← links)
- A classical probability space exists for the measurement theory based on the truth values (Q1708034) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Efficient quantum algorithm for the parity problem of a certain function (Q1740738) (← links)
- Necessary and sufficient condition for quantum computing (Q1740946) (← links)
- Quantum communication based on an algorithm of determining a matrix (Q1740965) (← links)
- Uniformity of quantum circuit families for error-free algorithms (Q1770403) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Architecture of a deterministic quantum central processing unit (Q1810354) (← links)
- Computing with quanta -- impacts of quantum theory on computation. (Q1853471) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- On the impossibility of interaction-free quantum sensing for small I/O bandwidth (Q1854387) (← links)
- Almost-everywhere superiority for quantum polynomial time (Q1854537) (← links)
- Mathematical models of quantum computation (Q1862645) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- A new protocol and lower bounds for quantum coin flipping (Q1887717) (← links)
- Human rationality challenges universal logic (Q1931349) (← links)
- An improved lower bound on query complexity for quantum PAC learning (Q1944033) (← links)
- Complexity limitations on quantum computation (Q1961375) (← links)
- Space-bounded quantum complexity (Q1961378) (← links)
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions (Q1993748) (← links)
- Quantum algorithm for determining a complex number string (Q2010995) (← links)
- Prefix-free quantum Kolmogorov complexity (Q2034780) (← links)
- Towards quantum computing based community detection (Q2065973) (← links)
- Quantum random access stored-program machines (Q2084736) (← links)
- Blind quantum machine learning based on quantum circuit model (Q2099578) (← links)
- Quantum cryptographic property testing of multi-output Boolean functions (Q2100834) (← links)
- Solving Bernstein and Vazirani's problem with the 2-bit permutation function (Q2102201) (← links)
- An improved quantum algorithm for the quantum learning with errors problem (Q2107929) (← links)
- Quantum algorithm for learning secret strings and its experimental demonstration (Q2111665) (← links)
- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product (Q2118738) (← links)
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) (Q2152096) (← links)
