The following pages link to Quantum Complexity Theory (Q4376183):
Displaying 50 items.
- Multi-party quantum key agreement protocol for detection of collusive attacks in each sub-circle segment by headers (Q2165335) (← links)
- A exact quantum learning algorithm for the 2-junta problem in constant time (Q2165341) (← links)
- An exact quantum algorithm for a restricted subtraction game (Q2190513) (← links)
- Generalization of Deutsch's algorithm (Q2197057) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← 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)
- An exact quantum algorithm for the 2-junta problem (Q2240988) (← links)
- Models of quantum computation and quantum programming languages (Q2250909) (← links)
- Approximation and robustness of fuzzy finite automata (Q2270389) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- Some theoretically organized algorithm for quantum computers (Q2300853) (← links)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
- Quantum algorithm for the root-finding problem (Q2329950) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
- Generality's price: Inescapable deficiencies in machine-learned programs (Q2368918) (← links)
- The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries (Q2384174) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Kochen-Specker theorem as a precondition for quantum computing (Q2400205) (← links)
- Quantum image processing? (Q2411571) (← links)
- Using Bernstein-Vazirani algorithm to attack block ciphers (Q2414939) (← links)
- A modeling and verification framework for optical quantum circuits (Q2418045) (← links)
- Complexity of operators generated by quantum mechanical Hamiltonians (Q2421044) (← links)
- Histogram-based segmentation of quantum images (Q2440830) (← links)
- Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453) (← links)
- Quantum algorithms for learning and testing juntas (Q2462663) (← links)
- On the complexity of the multivariate Sturm-Liouville eigenvalue problem (Q2465305) (← links)
- Computing spin networks (Q2484201) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Improved bounds on quantum learning algorithms (Q2491374) (← links)
- Zeno machines and hypercomputation (Q2503270) (← links)
- Determination of equivalence between quantum sequential machines (Q2503273) (← links)
- Quantum principles and mathematical computability (Q2505977) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Universality and programmability of quantum computers (Q2518381) (← links)
- The quantum ultimatum game (Q2573104) (← links)
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness (Q2658032) (← links)
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables (Q2681549) (← links)
- A quantum related-key attack based on the Bernstein-Vazirani algorithm (Q2681588) (← links)
- Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions (Q2681633) (← links)
- Sample-size-reduction of quantum states for the noisy linear problem (Q2682658) (← links)
- An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product (Q2684236) (← links)
- A quantum distinguisher for 7/8-round SMS4 block cipher (Q2684290) (← links)
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm (Q2685637) (← links)
- Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms (Q2690280) (← links)
- On a poset of quantum exact promise problems (Q2690501) (← links)
