Pages that link to "Item:Q4376181"
From MaRDI portal
The following pages link to On the Power of Quantum Computation (Q4376181):
Displaying 50 items.
- The effect of electric field on RbCl asymmetric Gaussian potential quantum well qubit (Q267252) (← links)
- Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (Q294804) (← links)
- On the uselessness of quantum queries (Q433109) (← links)
- New maximally entangled states and pattern classification in two-qubit system (Q458575) (← links)
- Using quantum key distribution for cryptographic purposes: a survey (Q477173) (← links)
- Quantum Boolean image denoising (Q501140) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Processes of quantum associative memory (QuAM) through new maximally entangled states (Singh-Rajput MES) (Q518024) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- Quantum computing without entanglement (Q596121) (← links)
- The query complexity of order-finding (Q596296) (← links)
- Mathematical model of stored logic based computation (Q623023) (← links)
- Quantum information processing: The case of vanishing interaction energy (Q699172) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Quantum information processing, operational quantum logic, convexity, and the foundations of physics (Q720547) (← links)
- (Quantum) cryptanalysis of misty schemes (Q831628) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Quantum algorithms for finding constant-sized sub-hypergraphs (Q896154) (← links)
- Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases (Q942549) (← links)
- Physical quantum algorithms (Q1613778) (← links)
- Improved quantum circuit modelling based on Heisenberg representation (Q1617199) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Optimal separation in exact query complexities for Simon's problem (Q1672002) (← links)
- Quantum algorithm to solve function inversion with time-space trade-off (Q1674561) (← links)
- Nonadaptive quantum query complexity (Q1675876) (← links)
- Global multipartite entanglement dynamics in Grover's search algorithm (Q1700345) (← links)
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms (Q1700378) (← links)
- Simultaneous classification of Oranges and Apples using Grover's and Ventura' algorithms in a two-qubits system (Q1700830) (← links)
- New maximally entangled states for pattern-association through evolutionary processes in a two-qubit system (Q1705112) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Quantum key-recovery on full AEZ (Q1746983) (← links)
- Quantum key search with side channel advice (Q1746986) (← links)
- Almost-everywhere superiority for quantum polynomial time (Q1854537) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
- Complexity limitations on quantum computation (Q1961375) (← links)
- Space-bounded quantum complexity (Q1961378) (← links)
- A Hamiltonian for quantum copying (Q1968158) (← links)
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions (Q2018202) (← links)
- Breaking tweakable enciphering schemes using Simon's algorithm (Q2043415) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- Quantum algorithms for learning Walsh spectra of multi-output Boolean functions (Q2100831) (← links)
- Quantum cryptographic property testing of multi-output Boolean functions (Q2100834) (← links)
- Quantum generic attacks on key-alternating Feistel ciphers for shorter keys (Q2101200) (← links)
- Quantum absentminded driver problem revisited (Q2102236) (← links)
- Leveraging the hardness of dihedral coset problem for quantum cryptography (Q2104711) (← links)
- Some efficient quantum circuit implementations of Camellia (Q2107075) (← links)
- Improved BV-based quantum attack on block ciphers (Q2110996) (← links)
- A fusion algorithm for solving the hidden shift problem in finite abelian groups (Q2118532) (← links)
